{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:PC3WJ6NNDZBXI3LNHEHLKIPDAH","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":"3884251703e1045a63fb4e808f088a07359c2a7a1ad86166e2ae5300e4b2111c","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2021-08-01T08:29:55Z","title_canon_sha256":"72dec4064af310eae0eb3238509752f5d4a5060254adb6ca6ac7d5412e3c4abe"},"schema_version":"1.0","source":{"id":"2108.00394","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2108.00394","created_at":"2026-07-05T08:40:03Z"},{"alias_kind":"arxiv_version","alias_value":"2108.00394v5","created_at":"2026-07-05T08:40:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.00394","created_at":"2026-07-05T08:40:03Z"},{"alias_kind":"pith_short_12","alias_value":"PC3WJ6NNDZBX","created_at":"2026-07-05T08:40:03Z"},{"alias_kind":"pith_short_16","alias_value":"PC3WJ6NNDZBXI3LN","created_at":"2026-07-05T08:40:03Z"},{"alias_kind":"pith_short_8","alias_value":"PC3WJ6NN","created_at":"2026-07-05T08:40:03Z"}],"graph_snapshots":[{"event_id":"sha256:09c97cec91fd4496aef94c707e1804f76d9e1d4168cc3ffa1a079fb6164ef45c","target":"graph","created_at":"2026-07-05T08:40:03Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2108.00394/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph matching is an important problem that has received widespread attention, especially in the field of computer vision. Recently, state-of-the-art methods seek to incorporate graph matching with deep learning. However, there is no research to explain what role the graph matching algorithm plays in the model. Therefore, we propose an approach integrating a MILP formulation of the graph matching problem. This formulation is solved to optimal and it provides inherent baseline. Meanwhile, similar approaches are derived by releasing the optimal guarantee of the graph matching solver and by intro","authors_text":"Huadong Liu, Puqing Chen, Romain Raveaux, Xin Yang, Zhoubo Xu","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2021-08-01T08:29:55Z","title":"Deep graph matching meets mixed-integer linear programming: Relax at your own risk ?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.00394","kind":"arxiv","version":5},"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:659ccde5625e5aad846bb1047188d7b8f30a2a5fe355c78b1a1379315f34d011","target":"record","created_at":"2026-07-05T08:40:03Z","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":"3884251703e1045a63fb4e808f088a07359c2a7a1ad86166e2ae5300e4b2111c","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2021-08-01T08:29:55Z","title_canon_sha256":"72dec4064af310eae0eb3238509752f5d4a5060254adb6ca6ac7d5412e3c4abe"},"schema_version":"1.0","source":{"id":"2108.00394","kind":"arxiv","version":5}},"canonical_sha256":"78b764f9ad1e43746d6d390eb521e301db7e21654b7792fd1f79d996061677bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78b764f9ad1e43746d6d390eb521e301db7e21654b7792fd1f79d996061677bc","first_computed_at":"2026-07-05T08:40:03.048556Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:40:03.048556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AJeSQITK5blC9sLwrrmfaTObjWQN/5GkBASpPt1NboB3veuxir7yZ5c9YN12RuVCD3/UsX3kDvj0rezl9tjCDg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:40:03.049066Z","signed_message":"canonical_sha256_bytes"},"source_id":"2108.00394","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:659ccde5625e5aad846bb1047188d7b8f30a2a5fe355c78b1a1379315f34d011","sha256:09c97cec91fd4496aef94c707e1804f76d9e1d4168cc3ffa1a079fb6164ef45c"],"state_sha256":"8d803c57342ad90e4981520cd118dc477d9f123ebc6d71ba2394f8914d054a5b"}