{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DFQYV4NXDTG6TQ2QHIHBDWLLUJ","short_pith_number":"pith:DFQYV4NX","schema_version":"1.0","canonical_sha256":"19618af1b71ccde9c3503a0e11d96ba24d76a723e5ab4355e26591dbb8efd0cc","source":{"kind":"arxiv","id":"1807.10160","version":1},"attestation_state":"computed","paper":{"title":"Adaptively Transforming Graph Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Fudong Wang, Gui-Song Xia, Nan Xue, Xiang Bai, Yipeng Zhang","submitted_at":"2018-07-26T14:12:40Z","abstract_excerpt":"Recently, many graph matching methods that incorporate pairwise constraint and that can be formulated as a quadratic assignment problem (QAP) have been proposed. Although these methods demonstrate promising results for the graph matching problem, they have high complexity in space or time. In this paper, we introduce an adaptively transforming graph matching (ATGM) method from the perspective of functional representation. More precisely, under a transformation formulation, we aim to match two graphs by minimizing the discrepancy between the original graph and the transformed graph. With a line"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1807.10160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-07-26T14:12:40Z","cross_cats_sorted":[],"title_canon_sha256":"cb2d82c28a9f257c0cd7d4318fb831b2f546ef25454cfb5b7a526a61b8951e36","abstract_canon_sha256":"1c3030864103f04c7790eed22f2a3a1c6585d06ea652933cfbc3ae7498c0f20e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:45.213804Z","signature_b64":"R32FdPMnBjL8TubwcSWm+fSQtyUU5lFjxWG9k8cjtZnbA8fwU2nADBZkouanC3HpR2y+Shg2rO6hMISZXFWYBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19618af1b71ccde9c3503a0e11d96ba24d76a723e5ab4355e26591dbb8efd0cc","last_reissued_at":"2026-05-18T00:09:45.213101Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:45.213101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptively Transforming Graph Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Fudong Wang, Gui-Song Xia, Nan Xue, Xiang Bai, Yipeng Zhang","submitted_at":"2018-07-26T14:12:40Z","abstract_excerpt":"Recently, many graph matching methods that incorporate pairwise constraint and that can be formulated as a quadratic assignment problem (QAP) have been proposed. Although these methods demonstrate promising results for the graph matching problem, they have high complexity in space or time. In this paper, we introduce an adaptively transforming graph matching (ATGM) method from the perspective of functional representation. More precisely, under a transformation formulation, we aim to match two graphs by minimizing the discrepancy between the original graph and the transformed graph. With a line"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.10160","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.10160","created_at":"2026-05-18T00:09:45.213213+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.10160v1","created_at":"2026-05-18T00:09:45.213213+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.10160","created_at":"2026-05-18T00:09:45.213213+00:00"},{"alias_kind":"pith_short_12","alias_value":"DFQYV4NXDTG6","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DFQYV4NXDTG6TQ2Q","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DFQYV4NX","created_at":"2026-05-18T12:32:19.392346+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DFQYV4NXDTG6TQ2QHIHBDWLLUJ","json":"https://pith.science/pith/DFQYV4NXDTG6TQ2QHIHBDWLLUJ.json","graph_json":"https://pith.science/api/pith-number/DFQYV4NXDTG6TQ2QHIHBDWLLUJ/graph.json","events_json":"https://pith.science/api/pith-number/DFQYV4NXDTG6TQ2QHIHBDWLLUJ/events.json","paper":"https://pith.science/paper/DFQYV4NX"},"agent_actions":{"view_html":"https://pith.science/pith/DFQYV4NXDTG6TQ2QHIHBDWLLUJ","download_json":"https://pith.science/pith/DFQYV4NXDTG6TQ2QHIHBDWLLUJ.json","view_paper":"https://pith.science/paper/DFQYV4NX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.10160&json=true","fetch_graph":"https://pith.science/api/pith-number/DFQYV4NXDTG6TQ2QHIHBDWLLUJ/graph.json","fetch_events":"https://pith.science/api/pith-number/DFQYV4NXDTG6TQ2QHIHBDWLLUJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DFQYV4NXDTG6TQ2QHIHBDWLLUJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DFQYV4NXDTG6TQ2QHIHBDWLLUJ/action/storage_attestation","attest_author":"https://pith.science/pith/DFQYV4NXDTG6TQ2QHIHBDWLLUJ/action/author_attestation","sign_citation":"https://pith.science/pith/DFQYV4NXDTG6TQ2QHIHBDWLLUJ/action/citation_signature","submit_replication":"https://pith.science/pith/DFQYV4NXDTG6TQ2QHIHBDWLLUJ/action/replication_record"}},"created_at":"2026-05-18T00:09:45.213213+00:00","updated_at":"2026-05-18T00:09:45.213213+00:00"}