Learning With Partial and Noisy Correspondence in Graph Matching.
- DOI
- 10.1109/tpami.2026.3670236
- Published
- 2026 Jul
- Container
- IEEE transactions on pattern analysis and machine intelligence
- Publisher
- Not recorded
- Open access
- unknown
Credibility signals
limited evidence Score 43/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.
Show all credibility signals
- cautionDOI registered: No matching Crossref record was present in this response.
- cautionDOI resolves: No matching Crossref record was present in this response.
- not scoredDirectory of Open Access Journals: No matching DOAJ record was present in this response. No allow-list match; this is not evidence of low credibility.
- not scoredMEDLINE indexed: Not checked or no result supplied; no credibility inference made.
- not scoredOpenAlex core source: Not checked or no result supplied; no credibility inference made.
- not scoredKnown publisher allow-list: Not checked or no result supplied; no credibility inference made.
- not scoredROR affiliation: Not checked or no result supplied; no credibility inference made.
- not scoredRetraction Watch retraction: No retraction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch expression of concern: No expression of concern notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch correction: No correction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch reinstatement: No reinstatement notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredOpen access status: Not checked or no result supplied; no credibility inference made.
- not scoredPublication license: Not checked or no result supplied; no credibility inference made.
- not scoredPublication version: A publication version was supplied but is not scored.
- cautionMetadata completeness: 5 of 6 scored descriptive metadata groups are present; missing fields increase uncertainty.
Cite this work
BibTeX
@article{allodium:10.1109/tpami.2026.3670236,
title = {Learning With Partial and Noisy Correspondence in Graph Matching.},
author = {Lin Y and Yang M and Hu P and Lv J and Chen H and Peng X},
year = {2026},
journal = {IEEE transactions on pattern analysis and machine intelligence},
doi = {10.1109/tpami.2026.3670236},
url = {https://doi.org/10.1109/tpami.2026.3670236}
}RIS
TY - JOUR TI - Learning With Partial and Noisy Correspondence in Graph Matching. AU - Lin Y AU - Yang M AU - Hu P AU - Lv J AU - Chen H AU - Peng X PY - 2026 JO - IEEE transactions on pattern analysis and machine intelligence DO - 10.1109/tpami.2026.3670236 UR - https://doi.org/10.1109/tpami.2026.3670236 ER -
APA
Y, L., M, Y., P, H., J, L., H, C., & X, P. (2026). Learning With Partial and Noisy Correspondence in Graph Matching.. IEEE transactions on pattern analysis and machine intelligence. https://doi.org/10.1109/tpami.2026.3670236
Source records
- pubmed · retrieved 2026-09-25T19:00:38.309Z