{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:N25BT5SPW73VA5BKAOO2T6RT45","short_pith_number":"pith:N25BT5SP","schema_version":"1.0","canonical_sha256":"6eba19f64fb7f750742a039da9fa33e7619ddb81a41737849ae7aa60342b58b9","source":{"kind":"arxiv","id":"1611.07583","version":4},"attestation_state":"computed","paper":{"title":"Alternating Direction Graph Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"D. Khu\\^e L\\^e-Huu, Nikos Paragios","submitted_at":"2016-11-22T23:51:03Z","abstract_excerpt":"In this paper, we introduce a graph matching method that can account for constraints of arbitrary order, with arbitrary potential functions. Unlike previous decomposition approaches that rely on the graph structures, we introduce a decomposition of the matching constraints. Graph matching is then reformulated as a non-convex non-separable optimization problem that can be split into smaller and much-easier-to-solve subproblems, by means of the alternating direction method of multipliers. The proposed framework is modular, scalable, and can be instantiated into different variants. Two instantiat"},"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":"1611.07583","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-11-22T23:51:03Z","cross_cats_sorted":[],"title_canon_sha256":"7b32dc0fa2869eeca5be149e2d34c964bc637f9f72c99f641dda53a24539944f","abstract_canon_sha256":"bb0b60e36e7f2b16556028a9a75e6ed093c5da9620b910da0bf3a473c9e988db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:44.845263Z","signature_b64":"z7t6mOgztlnFcW6FCeuovyVbvR9yW+jotM/ZNjoZvkq8z/PyV1zNQFnHVI17TX+R/uMzF5uWdEVsq+BRHEtgAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6eba19f64fb7f750742a039da9fa33e7619ddb81a41737849ae7aa60342b58b9","last_reissued_at":"2026-05-18T00:22:44.844754Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:44.844754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Alternating Direction Graph Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"D. Khu\\^e L\\^e-Huu, Nikos Paragios","submitted_at":"2016-11-22T23:51:03Z","abstract_excerpt":"In this paper, we introduce a graph matching method that can account for constraints of arbitrary order, with arbitrary potential functions. Unlike previous decomposition approaches that rely on the graph structures, we introduce a decomposition of the matching constraints. Graph matching is then reformulated as a non-convex non-separable optimization problem that can be split into smaller and much-easier-to-solve subproblems, by means of the alternating direction method of multipliers. The proposed framework is modular, scalable, and can be instantiated into different variants. Two instantiat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07583","kind":"arxiv","version":4},"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":"1611.07583","created_at":"2026-05-18T00:22:44.844841+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.07583v4","created_at":"2026-05-18T00:22:44.844841+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07583","created_at":"2026-05-18T00:22:44.844841+00:00"},{"alias_kind":"pith_short_12","alias_value":"N25BT5SPW73V","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"N25BT5SPW73VA5BK","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"N25BT5SP","created_at":"2026-05-18T12:30:32.724797+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/N25BT5SPW73VA5BKAOO2T6RT45","json":"https://pith.science/pith/N25BT5SPW73VA5BKAOO2T6RT45.json","graph_json":"https://pith.science/api/pith-number/N25BT5SPW73VA5BKAOO2T6RT45/graph.json","events_json":"https://pith.science/api/pith-number/N25BT5SPW73VA5BKAOO2T6RT45/events.json","paper":"https://pith.science/paper/N25BT5SP"},"agent_actions":{"view_html":"https://pith.science/pith/N25BT5SPW73VA5BKAOO2T6RT45","download_json":"https://pith.science/pith/N25BT5SPW73VA5BKAOO2T6RT45.json","view_paper":"https://pith.science/paper/N25BT5SP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.07583&json=true","fetch_graph":"https://pith.science/api/pith-number/N25BT5SPW73VA5BKAOO2T6RT45/graph.json","fetch_events":"https://pith.science/api/pith-number/N25BT5SPW73VA5BKAOO2T6RT45/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N25BT5SPW73VA5BKAOO2T6RT45/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N25BT5SPW73VA5BKAOO2T6RT45/action/storage_attestation","attest_author":"https://pith.science/pith/N25BT5SPW73VA5BKAOO2T6RT45/action/author_attestation","sign_citation":"https://pith.science/pith/N25BT5SPW73VA5BKAOO2T6RT45/action/citation_signature","submit_replication":"https://pith.science/pith/N25BT5SPW73VA5BKAOO2T6RT45/action/replication_record"}},"created_at":"2026-05-18T00:22:44.844841+00:00","updated_at":"2026-05-18T00:22:44.844841+00:00"}