{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:RW5D63B2SCOZ2N4GH7FMA3CVDU","short_pith_number":"pith:RW5D63B2","schema_version":"1.0","canonical_sha256":"8dba3f6c3a909d9d37863fcac06c551d36040f95afb484a91fcab3cf81f931c8","source":{"kind":"arxiv","id":"2105.02878","version":2},"attestation_state":"computed","paper":{"title":"Q-Match: Iterative Shape Matching via Quantum Annealing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Christian Theobalt, Christof Wunderlich, Marcel Seelbach Benkner, Michael Moeller, Vladislav Golyanik, Zorah L\\\"ahner","submitted_at":"2021-05-06T17:59:38Z","abstract_excerpt":"Finding shape correspondences can be formulated as an NP-hard quadratic assignment problem (QAP) that becomes infeasible for shapes with high sampling density. A promising research direction is to tackle such quadratic optimization problems over binary variables with quantum annealing, which allows for some problems a more efficient search in the solution space. Unfortunately, enforcing the linear equality constraints in QAPs via a penalty significantly limits the success probability of such methods on currently available quantum hardware. To address this limitation, this paper proposes Q-Matc"},"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":"2105.02878","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2021-05-06T17:59:38Z","cross_cats_sorted":[],"title_canon_sha256":"9899b0d47027744b1ac68d97ea297229db3db3932e2963057b35d9c1a66d8a67","abstract_canon_sha256":"8ce477d51f0371254ca20fcc7330b709e1f2104b7cf7c5ed3d8438b6f7e44003"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:07:06.314104Z","signature_b64":"eIjy3bRHYn+cSZCGF8p+OwmGG33FMRRxNpLborF9Hk5N0aSFh3CYdlgPu//Fd1BDlFbXUELMDQ6e7jHhUR+hDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8dba3f6c3a909d9d37863fcac06c551d36040f95afb484a91fcab3cf81f931c8","last_reissued_at":"2026-07-05T03:07:06.313536Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:07:06.313536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Q-Match: Iterative Shape Matching via Quantum Annealing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Christian Theobalt, Christof Wunderlich, Marcel Seelbach Benkner, Michael Moeller, Vladislav Golyanik, Zorah L\\\"ahner","submitted_at":"2021-05-06T17:59:38Z","abstract_excerpt":"Finding shape correspondences can be formulated as an NP-hard quadratic assignment problem (QAP) that becomes infeasible for shapes with high sampling density. A promising research direction is to tackle such quadratic optimization problems over binary variables with quantum annealing, which allows for some problems a more efficient search in the solution space. Unfortunately, enforcing the linear equality constraints in QAPs via a penalty significantly limits the success probability of such methods on currently available quantum hardware. To address this limitation, this paper proposes Q-Matc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.02878","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2105.02878/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2105.02878","created_at":"2026-07-05T03:07:06.313602+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.02878v2","created_at":"2026-07-05T03:07:06.313602+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.02878","created_at":"2026-07-05T03:07:06.313602+00:00"},{"alias_kind":"pith_short_12","alias_value":"RW5D63B2SCOZ","created_at":"2026-07-05T03:07:06.313602+00:00"},{"alias_kind":"pith_short_16","alias_value":"RW5D63B2SCOZ2N4G","created_at":"2026-07-05T03:07:06.313602+00:00"},{"alias_kind":"pith_short_8","alias_value":"RW5D63B2","created_at":"2026-07-05T03:07:06.313602+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/RW5D63B2SCOZ2N4GH7FMA3CVDU","json":"https://pith.science/pith/RW5D63B2SCOZ2N4GH7FMA3CVDU.json","graph_json":"https://pith.science/api/pith-number/RW5D63B2SCOZ2N4GH7FMA3CVDU/graph.json","events_json":"https://pith.science/api/pith-number/RW5D63B2SCOZ2N4GH7FMA3CVDU/events.json","paper":"https://pith.science/paper/RW5D63B2"},"agent_actions":{"view_html":"https://pith.science/pith/RW5D63B2SCOZ2N4GH7FMA3CVDU","download_json":"https://pith.science/pith/RW5D63B2SCOZ2N4GH7FMA3CVDU.json","view_paper":"https://pith.science/paper/RW5D63B2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.02878&json=true","fetch_graph":"https://pith.science/api/pith-number/RW5D63B2SCOZ2N4GH7FMA3CVDU/graph.json","fetch_events":"https://pith.science/api/pith-number/RW5D63B2SCOZ2N4GH7FMA3CVDU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RW5D63B2SCOZ2N4GH7FMA3CVDU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RW5D63B2SCOZ2N4GH7FMA3CVDU/action/storage_attestation","attest_author":"https://pith.science/pith/RW5D63B2SCOZ2N4GH7FMA3CVDU/action/author_attestation","sign_citation":"https://pith.science/pith/RW5D63B2SCOZ2N4GH7FMA3CVDU/action/citation_signature","submit_replication":"https://pith.science/pith/RW5D63B2SCOZ2N4GH7FMA3CVDU/action/replication_record"}},"created_at":"2026-07-05T03:07:06.313602+00:00","updated_at":"2026-07-05T03:07:06.313602+00:00"}