{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:YDLAJ3OZJZM4YZ6YDMLNRMR6UB","short_pith_number":"pith:YDLAJ3OZ","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"},"canonical_sha256":"c0d604edd94e59cc67d81b16d8b23ea0740227cd8780f292da601c77e52df273","source":{"kind":"arxiv","id":"1511.02667","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02667","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02667v2","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02667","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"pith_short_12","alias_value":"YDLAJ3OZJZM4","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YDLAJ3OZJZM4YZ6Y","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YDLAJ3OZ","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:YDLAJ3OZJZM4YZ6YDMLNRMR6UB","target":"record","payload":{"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"},"canonical_sha256":"c0d604edd94e59cc67d81b16d8b23ea0740227cd8780f292da601c77e52df273","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"},"source_kind":"arxiv","source_id":"1511.02667","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:58:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"okkis+Y9CRPmK+C8owPI3ukOXmwJkkry5dWmkC0dlmWKNnjIpr30WeaHbFZuPOotCNyHUfWsi+1J+7rTuBZBCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T06:03:19.241564Z"},"content_sha256":"59ee6bf468ea52012c80f0abd97688d7a18f355a62aedc479d30040c05f7ccfd","schema_version":"1.0","event_id":"sha256:59ee6bf468ea52012c80f0abd97688d7a18f355a62aedc479d30040c05f7ccfd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:YDLAJ3OZJZM4YZ6YDMLNRMR6UB","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:58:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6iZyj6xQwGmojJ58E2JtAhmcTXm+HQJeuF0D+oXlhcMJl1m/y84Y5NK7QzvTnVk2w3+PFst9CKXKDwlbD0myBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T06:03:19.241910Z"},"content_sha256":"547206f34ec26e18f51a4a67523437551f85185927fc88e8142f52ac2acffdce","schema_version":"1.0","event_id":"sha256:547206f34ec26e18f51a4a67523437551f85185927fc88e8142f52ac2acffdce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YDLAJ3OZJZM4YZ6YDMLNRMR6UB/bundle.json","state_url":"https://pith.science/pith/YDLAJ3OZJZM4YZ6YDMLNRMR6UB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YDLAJ3OZJZM4YZ6YDMLNRMR6UB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-23T06:03:19Z","links":{"resolver":"https://pith.science/pith/YDLAJ3OZJZM4YZ6YDMLNRMR6UB","bundle":"https://pith.science/pith/YDLAJ3OZJZM4YZ6YDMLNRMR6UB/bundle.json","state":"https://pith.science/pith/YDLAJ3OZJZM4YZ6YDMLNRMR6UB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YDLAJ3OZJZM4YZ6YDMLNRMR6UB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:YDLAJ3OZJZM4YZ6YDMLNRMR6UB","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5669037b378aca2b0b6e02bcefc23ddae522c427e5338308255f7b76c271b9c6","cross_cats_sorted":["cs.DS","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-11-09T13:15:10Z","title_canon_sha256":"22d7ae83f75c9460e7d49e8620062d68c21c27b1063c24d4d9e8b029a2a58dcb"},"schema_version":"1.0","source":{"id":"1511.02667","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02667","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02667v2","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02667","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"pith_short_12","alias_value":"YDLAJ3OZJZM4","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YDLAJ3OZJZM4YZ6Y","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YDLAJ3OZ","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:547206f34ec26e18f51a4a67523437551f85185927fc88e8142f52ac2acffdce","target":"graph","created_at":"2026-05-18T00:58:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Antoine Gautier, Francesco Tudisco, Matthias Hein, Quynh Nguyen","cross_cats":["cs.DS","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-11-09T13:15:10Z","title":"An Efficient Multilinear Optimization Framework for Hypergraph Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02667","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:59ee6bf468ea52012c80f0abd97688d7a18f355a62aedc479d30040c05f7ccfd","target":"record","created_at":"2026-05-18T00:58:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5669037b378aca2b0b6e02bcefc23ddae522c427e5338308255f7b76c271b9c6","cross_cats_sorted":["cs.DS","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-11-09T13:15:10Z","title_canon_sha256":"22d7ae83f75c9460e7d49e8620062d68c21c27b1063c24d4d9e8b029a2a58dcb"},"schema_version":"1.0","source":{"id":"1511.02667","kind":"arxiv","version":2}},"canonical_sha256":"c0d604edd94e59cc67d81b16d8b23ea0740227cd8780f292da601c77e52df273","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0d604edd94e59cc67d81b16d8b23ea0740227cd8780f292da601c77e52df273","first_computed_at":"2026-05-18T00:58:34.613340Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:34.613340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kebmgYH/wkWaBjB/0c2VLcFmEVnkCHjGFIhBqRk+PmbvhudzUhE7qm9yrHs1B1aa4gKadAb5j3++6V9DupvHCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:34.613937Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.02667","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59ee6bf468ea52012c80f0abd97688d7a18f355a62aedc479d30040c05f7ccfd","sha256:547206f34ec26e18f51a4a67523437551f85185927fc88e8142f52ac2acffdce"],"state_sha256":"a86bafd4935ac80c4a0d2bdb0c1472caf6fd41521e50e497e73fcdfa23d4d642"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LxOCfYytr23V6fVug0LDYYp7W8kjiXnj8pYrn7yuovOBO6mWLBZvSYICQvANPHVy2khIc5YtMt5gGnEdOlZcDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T06:03:19.243842Z","bundle_sha256":"197e4ff4907e6d6a1356b4d24172a2f6c4ffefcfd85c43e6dd50d30bfec6e80c"}}