{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:MRMDJ3GLNTZMBGRAI5CNN5QL2U","short_pith_number":"pith:MRMDJ3GL","canonical_record":{"source":{"id":"1401.7623","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-29T18:59:06Z","cross_cats_sorted":["cs.CG","cs.CV","math.OC"],"title_canon_sha256":"8ed2cabb40caca405268843217f24efa5d0a2fef7d91344a6891f8a227315cb3","abstract_canon_sha256":"3a4ee76afd62ee7f7c53c261d025d6a39c39a5caca4b18c56c5c72ff1e37081e"},"schema_version":"1.0"},"canonical_sha256":"645834eccb6cf2c09a204744d6f60bd52960367a41e66683e320d8bdc56b5c5e","source":{"kind":"arxiv","id":"1401.7623","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.7623","created_at":"2026-05-18T02:40:18Z"},{"alias_kind":"arxiv_version","alias_value":"1401.7623v5","created_at":"2026-05-18T02:40:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7623","created_at":"2026-05-18T02:40:18Z"},{"alias_kind":"pith_short_12","alias_value":"MRMDJ3GLNTZM","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MRMDJ3GLNTZMBGRA","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MRMDJ3GL","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:MRMDJ3GLNTZMBGRAI5CNN5QL2U","target":"record","payload":{"canonical_record":{"source":{"id":"1401.7623","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-29T18:59:06Z","cross_cats_sorted":["cs.CG","cs.CV","math.OC"],"title_canon_sha256":"8ed2cabb40caca405268843217f24efa5d0a2fef7d91344a6891f8a227315cb3","abstract_canon_sha256":"3a4ee76afd62ee7f7c53c261d025d6a39c39a5caca4b18c56c5c72ff1e37081e"},"schema_version":"1.0"},"canonical_sha256":"645834eccb6cf2c09a204744d6f60bd52960367a41e66683e320d8bdc56b5c5e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:18.484407Z","signature_b64":"oh78LlGKDfk4F2p/RK4t8ktCGlIgHd8l8Oq29E/bzQxYX+IL8iTct2xH9l7gDeJtst5PRbT5e7AKYna+5hYKBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"645834eccb6cf2c09a204744d6f60bd52960367a41e66683e320d8bdc56b5c5e","last_reissued_at":"2026-05-18T02:40:18.483941Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:18.483941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.7623","source_version":5,"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-18T02:40:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZEJvSobDAzrL0bPk5GtyLkmT3/umLVtqecFpV7bWbkjgvWY74bjOG8pv35aKc74owEovIKjQ7/qV2hMFhSNaAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:10:14.372865Z"},"content_sha256":"030e0907148c3d30faca6bd1f24a4711dca33ed38a305d7e6016dc0f84d0b1fa","schema_version":"1.0","event_id":"sha256:030e0907148c3d30faca6bd1f24a4711dca33ed38a305d7e6016dc0f84d0b1fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:MRMDJ3GLNTZMBGRAI5CNN5QL2U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph matching: relax or not?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.CV","math.OC"],"primary_cat":"cs.DS","authors_text":"Alex Bronstein, Ron Kimmel, Yonathan Aflalo","submitted_at":"2014-01-29T18:59:06Z","abstract_excerpt":"We consider the problem of exact and inexact matching of weighted undirected graphs, in which a bijective correspondence is sought to minimize a quadratic weight disagreement. This computationally challenging problem is often relaxed as a convex quadratic program, in which the space of permutations is replaced by the space of doubly-stochastic matrices. However, the applicability of such a relaxation is poorly understood. We define a broad class of friendly graphs characterized by an easily verifiable spectral property. We prove that for friendly graphs, the convex relaxation is guaranteed to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7623","kind":"arxiv","version":5},"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-18T02:40:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"29tQlsfKOeZ1XzCC0eyv2/UwjrHVki3P8lwy2O0LMyAHpw9R0ZnrO0I6RL9X680XK7iHqVu//aj9jYMxtJysDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:10:14.373204Z"},"content_sha256":"4ab05d066530c460f41ede8a577d887bca2f1be73f56dd4f8908a4b2e7173f5b","schema_version":"1.0","event_id":"sha256:4ab05d066530c460f41ede8a577d887bca2f1be73f56dd4f8908a4b2e7173f5b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MRMDJ3GLNTZMBGRAI5CNN5QL2U/bundle.json","state_url":"https://pith.science/pith/MRMDJ3GLNTZMBGRAI5CNN5QL2U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MRMDJ3GLNTZMBGRAI5CNN5QL2U/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-01T15:10:14Z","links":{"resolver":"https://pith.science/pith/MRMDJ3GLNTZMBGRAI5CNN5QL2U","bundle":"https://pith.science/pith/MRMDJ3GLNTZMBGRAI5CNN5QL2U/bundle.json","state":"https://pith.science/pith/MRMDJ3GLNTZMBGRAI5CNN5QL2U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MRMDJ3GLNTZMBGRAI5CNN5QL2U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:MRMDJ3GLNTZMBGRAI5CNN5QL2U","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":"3a4ee76afd62ee7f7c53c261d025d6a39c39a5caca4b18c56c5c72ff1e37081e","cross_cats_sorted":["cs.CG","cs.CV","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-29T18:59:06Z","title_canon_sha256":"8ed2cabb40caca405268843217f24efa5d0a2fef7d91344a6891f8a227315cb3"},"schema_version":"1.0","source":{"id":"1401.7623","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.7623","created_at":"2026-05-18T02:40:18Z"},{"alias_kind":"arxiv_version","alias_value":"1401.7623v5","created_at":"2026-05-18T02:40:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7623","created_at":"2026-05-18T02:40:18Z"},{"alias_kind":"pith_short_12","alias_value":"MRMDJ3GLNTZM","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MRMDJ3GLNTZMBGRA","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MRMDJ3GL","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:4ab05d066530c460f41ede8a577d887bca2f1be73f56dd4f8908a4b2e7173f5b","target":"graph","created_at":"2026-05-18T02:40:18Z","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":"We consider the problem of exact and inexact matching of weighted undirected graphs, in which a bijective correspondence is sought to minimize a quadratic weight disagreement. This computationally challenging problem is often relaxed as a convex quadratic program, in which the space of permutations is replaced by the space of doubly-stochastic matrices. However, the applicability of such a relaxation is poorly understood. We define a broad class of friendly graphs characterized by an easily verifiable spectral property. We prove that for friendly graphs, the convex relaxation is guaranteed to ","authors_text":"Alex Bronstein, Ron Kimmel, Yonathan Aflalo","cross_cats":["cs.CG","cs.CV","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-29T18:59:06Z","title":"Graph matching: relax or not?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7623","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:030e0907148c3d30faca6bd1f24a4711dca33ed38a305d7e6016dc0f84d0b1fa","target":"record","created_at":"2026-05-18T02:40:18Z","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":"3a4ee76afd62ee7f7c53c261d025d6a39c39a5caca4b18c56c5c72ff1e37081e","cross_cats_sorted":["cs.CG","cs.CV","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-29T18:59:06Z","title_canon_sha256":"8ed2cabb40caca405268843217f24efa5d0a2fef7d91344a6891f8a227315cb3"},"schema_version":"1.0","source":{"id":"1401.7623","kind":"arxiv","version":5}},"canonical_sha256":"645834eccb6cf2c09a204744d6f60bd52960367a41e66683e320d8bdc56b5c5e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"645834eccb6cf2c09a204744d6f60bd52960367a41e66683e320d8bdc56b5c5e","first_computed_at":"2026-05-18T02:40:18.483941Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:40:18.483941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oh78LlGKDfk4F2p/RK4t8ktCGlIgHd8l8Oq29E/bzQxYX+IL8iTct2xH9l7gDeJtst5PRbT5e7AKYna+5hYKBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:40:18.484407Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.7623","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:030e0907148c3d30faca6bd1f24a4711dca33ed38a305d7e6016dc0f84d0b1fa","sha256:4ab05d066530c460f41ede8a577d887bca2f1be73f56dd4f8908a4b2e7173f5b"],"state_sha256":"c7ffd0c06c7f5b831174c1b1f9768f3b18426b5792735c8510f51afc6def1a54"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TLSZJVo63QB7MKqw19j9/MgIMlHCCjoUSWnSLZcyS3eEPKUdpw4QTZhRWamsqy6Z4C46mcUrAQ0mzLLV64pZBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T15:10:14.375507Z","bundle_sha256":"bacc1a68131e0274c3256f90a841f4782389f045963f0bf1fd1556be285bd2b2"}}