{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MRMDJ3GLNTZMBGRAI5CNN5QL2U","short_pith_number":"pith:MRMDJ3GL","schema_version":"1.0","canonical_sha256":"645834eccb6cf2c09a204744d6f60bd52960367a41e66683e320d8bdc56b5c5e","source":{"kind":"arxiv","id":"1401.7623","version":5},"attestation_state":"computed","paper":{"title":"Graph matching: relax or not?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.CV","math.OC"],"primary_cat":"cs.DS","authors_text":"Alex Bronstein, Ron Kimmel, Yonathan Aflalo","submitted_at":"2014-01-29T18:59:06Z","abstract_excerpt":"We consider the problem of exact and inexact matching of weighted undirected graphs, in which a bijective correspondence is sought to minimize a quadratic weight disagreement. This computationally challenging problem is often relaxed as a convex quadratic program, in which the space of permutations is replaced by the space of doubly-stochastic matrices. However, the applicability of such a relaxation is poorly understood. We define a broad class of friendly graphs characterized by an easily verifiable spectral property. We prove that for friendly graphs, the convex relaxation is guaranteed to "},"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":"1401.7623","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-29T18:59:06Z","cross_cats_sorted":["cs.CG","cs.CV","math.OC"],"title_canon_sha256":"8ed2cabb40caca405268843217f24efa5d0a2fef7d91344a6891f8a227315cb3","abstract_canon_sha256":"3a4ee76afd62ee7f7c53c261d025d6a39c39a5caca4b18c56c5c72ff1e37081e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:18.484407Z","signature_b64":"oh78LlGKDfk4F2p/RK4t8ktCGlIgHd8l8Oq29E/bzQxYX+IL8iTct2xH9l7gDeJtst5PRbT5e7AKYna+5hYKBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"645834eccb6cf2c09a204744d6f60bd52960367a41e66683e320d8bdc56b5c5e","last_reissued_at":"2026-05-18T02:40:18.483941Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:18.483941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph matching: relax or not?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.CV","math.OC"],"primary_cat":"cs.DS","authors_text":"Alex Bronstein, Ron Kimmel, Yonathan Aflalo","submitted_at":"2014-01-29T18:59:06Z","abstract_excerpt":"We consider the problem of exact and inexact matching of weighted undirected graphs, in which a bijective correspondence is sought to minimize a quadratic weight disagreement. This computationally challenging problem is often relaxed as a convex quadratic program, in which the space of permutations is replaced by the space of doubly-stochastic matrices. However, the applicability of such a relaxation is poorly understood. We define a broad class of friendly graphs characterized by an easily verifiable spectral property. We prove that for friendly graphs, the convex relaxation is guaranteed to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7623","kind":"arxiv","version":5},"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":"1401.7623","created_at":"2026-05-18T02:40:18.484015+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.7623v5","created_at":"2026-05-18T02:40:18.484015+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7623","created_at":"2026-05-18T02:40:18.484015+00:00"},{"alias_kind":"pith_short_12","alias_value":"MRMDJ3GLNTZM","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"MRMDJ3GLNTZMBGRA","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"MRMDJ3GL","created_at":"2026-05-18T12:28:38.356838+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/MRMDJ3GLNTZMBGRAI5CNN5QL2U","json":"https://pith.science/pith/MRMDJ3GLNTZMBGRAI5CNN5QL2U.json","graph_json":"https://pith.science/api/pith-number/MRMDJ3GLNTZMBGRAI5CNN5QL2U/graph.json","events_json":"https://pith.science/api/pith-number/MRMDJ3GLNTZMBGRAI5CNN5QL2U/events.json","paper":"https://pith.science/paper/MRMDJ3GL"},"agent_actions":{"view_html":"https://pith.science/pith/MRMDJ3GLNTZMBGRAI5CNN5QL2U","download_json":"https://pith.science/pith/MRMDJ3GLNTZMBGRAI5CNN5QL2U.json","view_paper":"https://pith.science/paper/MRMDJ3GL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.7623&json=true","fetch_graph":"https://pith.science/api/pith-number/MRMDJ3GLNTZMBGRAI5CNN5QL2U/graph.json","fetch_events":"https://pith.science/api/pith-number/MRMDJ3GLNTZMBGRAI5CNN5QL2U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MRMDJ3GLNTZMBGRAI5CNN5QL2U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MRMDJ3GLNTZMBGRAI5CNN5QL2U/action/storage_attestation","attest_author":"https://pith.science/pith/MRMDJ3GLNTZMBGRAI5CNN5QL2U/action/author_attestation","sign_citation":"https://pith.science/pith/MRMDJ3GLNTZMBGRAI5CNN5QL2U/action/citation_signature","submit_replication":"https://pith.science/pith/MRMDJ3GLNTZMBGRAI5CNN5QL2U/action/replication_record"}},"created_at":"2026-05-18T02:40:18.484015+00:00","updated_at":"2026-05-18T02:40:18.484015+00:00"}