{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YDLAJ3OZJZM4YZ6YDMLNRMR6UB","short_pith_number":"pith:YDLAJ3OZ","schema_version":"1.0","canonical_sha256":"c0d604edd94e59cc67d81b16d8b23ea0740227cd8780f292da601c77e52df273","source":{"kind":"arxiv","id":"1511.02667","version":2},"attestation_state":"computed","paper":{"title":"An Efficient Multilinear Optimization Framework for Hypergraph Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC"],"primary_cat":"cs.CV","authors_text":"Antoine Gautier, Francesco Tudisco, Matthias Hein, Quynh Nguyen","submitted_at":"2015-11-09T13:15:10Z","abstract_excerpt":"Hypergraph matching has recently become a popular approach for solving correspondence problems in computer vision as it allows to integrate higher-order geometric information. Hypergraph matching can be formulated as a third-order optimization problem subject to the assignment constraints which turns out to be NP-hard. In recent work, we have proposed an algorithm for hypergraph matching which first lifts the third-order problem to a fourth-order problem and then solves the fourth-order problem via optimization of the corresponding multilinear form. This leads to a tensor block coordinate asce"},"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":"1511.02667","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-11-09T13:15:10Z","cross_cats_sorted":["cs.DS","math.OC"],"title_canon_sha256":"22d7ae83f75c9460e7d49e8620062d68c21c27b1063c24d4d9e8b029a2a58dcb","abstract_canon_sha256":"5669037b378aca2b0b6e02bcefc23ddae522c427e5338308255f7b76c271b9c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:34.613937Z","signature_b64":"kebmgYH/wkWaBjB/0c2VLcFmEVnkCHjGFIhBqRk+PmbvhudzUhE7qm9yrHs1B1aa4gKadAb5j3++6V9DupvHCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0d604edd94e59cc67d81b16d8b23ea0740227cd8780f292da601c77e52df273","last_reissued_at":"2026-05-18T00:58:34.613340Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:34.613340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Multilinear Optimization Framework for Hypergraph Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC"],"primary_cat":"cs.CV","authors_text":"Antoine Gautier, Francesco Tudisco, Matthias Hein, Quynh Nguyen","submitted_at":"2015-11-09T13:15:10Z","abstract_excerpt":"Hypergraph matching has recently become a popular approach for solving correspondence problems in computer vision as it allows to integrate higher-order geometric information. Hypergraph matching can be formulated as a third-order optimization problem subject to the assignment constraints which turns out to be NP-hard. In recent work, we have proposed an algorithm for hypergraph matching which first lifts the third-order problem to a fourth-order problem and then solves the fourth-order problem via optimization of the corresponding multilinear form. This leads to a tensor block coordinate asce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02667","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":"1511.02667","created_at":"2026-05-18T00:58:34.613420+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.02667v2","created_at":"2026-05-18T00:58:34.613420+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02667","created_at":"2026-05-18T00:58:34.613420+00:00"},{"alias_kind":"pith_short_12","alias_value":"YDLAJ3OZJZM4","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"YDLAJ3OZJZM4YZ6Y","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"YDLAJ3OZ","created_at":"2026-05-18T12:29:50.041715+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/YDLAJ3OZJZM4YZ6YDMLNRMR6UB","json":"https://pith.science/pith/YDLAJ3OZJZM4YZ6YDMLNRMR6UB.json","graph_json":"https://pith.science/api/pith-number/YDLAJ3OZJZM4YZ6YDMLNRMR6UB/graph.json","events_json":"https://pith.science/api/pith-number/YDLAJ3OZJZM4YZ6YDMLNRMR6UB/events.json","paper":"https://pith.science/paper/YDLAJ3OZ"},"agent_actions":{"view_html":"https://pith.science/pith/YDLAJ3OZJZM4YZ6YDMLNRMR6UB","download_json":"https://pith.science/pith/YDLAJ3OZJZM4YZ6YDMLNRMR6UB.json","view_paper":"https://pith.science/paper/YDLAJ3OZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.02667&json=true","fetch_graph":"https://pith.science/api/pith-number/YDLAJ3OZJZM4YZ6YDMLNRMR6UB/graph.json","fetch_events":"https://pith.science/api/pith-number/YDLAJ3OZJZM4YZ6YDMLNRMR6UB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YDLAJ3OZJZM4YZ6YDMLNRMR6UB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YDLAJ3OZJZM4YZ6YDMLNRMR6UB/action/storage_attestation","attest_author":"https://pith.science/pith/YDLAJ3OZJZM4YZ6YDMLNRMR6UB/action/author_attestation","sign_citation":"https://pith.science/pith/YDLAJ3OZJZM4YZ6YDMLNRMR6UB/action/citation_signature","submit_replication":"https://pith.science/pith/YDLAJ3OZJZM4YZ6YDMLNRMR6UB/action/replication_record"}},"created_at":"2026-05-18T00:58:34.613420+00:00","updated_at":"2026-05-18T00:58:34.613420+00:00"}