{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MN2BC246UD5XGAHSTKBWB5YBQ6","short_pith_number":"pith:MN2BC246","schema_version":"1.0","canonical_sha256":"6374116b9ea0fb7300f29a8360f70187ba97fe4fc4f740d1251f00c45a6454b5","source":{"kind":"arxiv","id":"1811.10541","version":2},"attestation_state":"computed","paper":{"title":"Higher-order Projected Power Iterations for Scalable Multi-Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.CV","authors_text":"Christian Theobalt, Florian Bernard, Johan Thunberg, Paul Swoboda","submitted_at":"2018-11-26T17:44:48Z","abstract_excerpt":"The matching of multiple objects (e.g. shapes or images) is a fundamental problem in vision and graphics. In order to robustly handle ambiguities, noise and repetitive patterns in challenging real-world settings, it is essential to take geometric consistency between points into account. Computationally, the multi-matching problem is difficult. It can be phrased as simultaneously solving multiple (NP-hard) quadratic assignment problems (QAPs) that are coupled via cycle-consistency constraints. The main limitations of existing multi-matching methods are that they either ignore geometric consiste"},"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":"1811.10541","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-11-26T17:44:48Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"0b83c2c995055f4fd5afd73622af0aa6edbf252951aab5d9d6873976c4ffbc9b","abstract_canon_sha256":"f85ce7f1d3e595a0f87d850e5dcf68d9e6f63912f4f8aba5073b474ca94d599d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:19.303685Z","signature_b64":"xqREUhZIcM/KdrZHdM+PgCYYaph/kQnwi/37WPXuBju4xLIAuKRIDdiyCyvkjudvP+4AhMqkiIY1kOsxCjRZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6374116b9ea0fb7300f29a8360f70187ba97fe4fc4f740d1251f00c45a6454b5","last_reissued_at":"2026-05-17T23:51:19.303189Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:19.303189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Higher-order Projected Power Iterations for Scalable Multi-Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.CV","authors_text":"Christian Theobalt, Florian Bernard, Johan Thunberg, Paul Swoboda","submitted_at":"2018-11-26T17:44:48Z","abstract_excerpt":"The matching of multiple objects (e.g. shapes or images) is a fundamental problem in vision and graphics. In order to robustly handle ambiguities, noise and repetitive patterns in challenging real-world settings, it is essential to take geometric consistency between points into account. Computationally, the multi-matching problem is difficult. It can be phrased as simultaneously solving multiple (NP-hard) quadratic assignment problems (QAPs) that are coupled via cycle-consistency constraints. The main limitations of existing multi-matching methods are that they either ignore geometric consiste"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10541","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":""},"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":"1811.10541","created_at":"2026-05-17T23:51:19.303270+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.10541v2","created_at":"2026-05-17T23:51:19.303270+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10541","created_at":"2026-05-17T23:51:19.303270+00:00"},{"alias_kind":"pith_short_12","alias_value":"MN2BC246UD5X","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"MN2BC246UD5XGAHS","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"MN2BC246","created_at":"2026-05-18T12:32:37.024351+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/MN2BC246UD5XGAHSTKBWB5YBQ6","json":"https://pith.science/pith/MN2BC246UD5XGAHSTKBWB5YBQ6.json","graph_json":"https://pith.science/api/pith-number/MN2BC246UD5XGAHSTKBWB5YBQ6/graph.json","events_json":"https://pith.science/api/pith-number/MN2BC246UD5XGAHSTKBWB5YBQ6/events.json","paper":"https://pith.science/paper/MN2BC246"},"agent_actions":{"view_html":"https://pith.science/pith/MN2BC246UD5XGAHSTKBWB5YBQ6","download_json":"https://pith.science/pith/MN2BC246UD5XGAHSTKBWB5YBQ6.json","view_paper":"https://pith.science/paper/MN2BC246","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.10541&json=true","fetch_graph":"https://pith.science/api/pith-number/MN2BC246UD5XGAHSTKBWB5YBQ6/graph.json","fetch_events":"https://pith.science/api/pith-number/MN2BC246UD5XGAHSTKBWB5YBQ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MN2BC246UD5XGAHSTKBWB5YBQ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MN2BC246UD5XGAHSTKBWB5YBQ6/action/storage_attestation","attest_author":"https://pith.science/pith/MN2BC246UD5XGAHSTKBWB5YBQ6/action/author_attestation","sign_citation":"https://pith.science/pith/MN2BC246UD5XGAHSTKBWB5YBQ6/action/citation_signature","submit_replication":"https://pith.science/pith/MN2BC246UD5XGAHSTKBWB5YBQ6/action/replication_record"}},"created_at":"2026-05-17T23:51:19.303270+00:00","updated_at":"2026-05-17T23:51:19.303270+00:00"}