{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:473IBZNQARDW7DK47SO2RJENWV","short_pith_number":"pith:473IBZNQ","canonical_record":{"source":{"id":"1402.1473","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-02-06T20:16:35Z","cross_cats_sorted":["cs.CV","cs.IT","math.IT","math.OC","stat.ML"],"title_canon_sha256":"dd98ca0dabcc2b63e2f679e40b65f09c3eae065477d75c2d57253012fd87c72e","abstract_canon_sha256":"87ec477bb16885d56604b3210b475d8d4a3873a5750e97bcff32c145b7ed2ac4"},"schema_version":"1.0"},"canonical_sha256":"e7f680e5b004476f8d5cfc9da8a48db558f4339eed589822880c682c04655217","source":{"kind":"arxiv","id":"1402.1473","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.1473","created_at":"2026-05-18T02:30:08Z"},{"alias_kind":"arxiv_version","alias_value":"1402.1473v1","created_at":"2026-05-18T02:30:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.1473","created_at":"2026-05-18T02:30:08Z"},{"alias_kind":"pith_short_12","alias_value":"473IBZNQARDW","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"473IBZNQARDW7DK4","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"473IBZNQ","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:473IBZNQARDW7DK47SO2RJENWV","target":"record","payload":{"canonical_record":{"source":{"id":"1402.1473","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-02-06T20:16:35Z","cross_cats_sorted":["cs.CV","cs.IT","math.IT","math.OC","stat.ML"],"title_canon_sha256":"dd98ca0dabcc2b63e2f679e40b65f09c3eae065477d75c2d57253012fd87c72e","abstract_canon_sha256":"87ec477bb16885d56604b3210b475d8d4a3873a5750e97bcff32c145b7ed2ac4"},"schema_version":"1.0"},"canonical_sha256":"e7f680e5b004476f8d5cfc9da8a48db558f4339eed589822880c682c04655217","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:08.471937Z","signature_b64":"ZXaOfwkLsWEjsRQq3n4TeS/XWP3KvpZ3nAxJgeKXOF64j4LBya1xDQYvR665O3qG+vRcQlGIMar6Y9sFFDvXBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7f680e5b004476f8d5cfc9da8a48db558f4339eed589822880c682c04655217","last_reissued_at":"2026-05-18T02:30:08.471407Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:08.471407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.1473","source_version":1,"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:30:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"24IToZuA+xkDvpNArkOvlYAOuzRRqq7/CFBYRKjgY6XATrWQl4Ob2ChGXvFQdAIZFYwORwX+RyQHn20DgLQKBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T16:21:01.001361Z"},"content_sha256":"994b06061e125a81a5096ad56b09790ee15e7674ea5cd088ce979d98cab571db","schema_version":"1.0","event_id":"sha256:994b06061e125a81a5096ad56b09790ee15e7674ea5cd088ce979d98cab571db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:473IBZNQARDW7DK47SO2RJENWV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Near-Optimal Joint Object Matching via Convex Relaxation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.IT","math.IT","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Leonidas J. Guibas, Qi-Xing Huang, Yuxin Chen","submitted_at":"2014-02-06T20:16:35Z","abstract_excerpt":"Joint matching over a collection of objects aims at aggregating information from a large collection of similar instances (e.g. images, graphs, shapes) to improve maps between pairs of them. Given multiple matches computed between a few object pairs in isolation, the goal is to recover an entire collection of maps that are (1) globally consistent, and (2) close to the provided maps --- and under certain conditions provably the ground-truth maps. Despite recent advances on this problem, the best-known recovery guarantees are limited to a small constant barrier --- none of the existing methods fi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.1473","kind":"arxiv","version":1},"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:30:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"puUMm5fNZPq7EPokf1mPUklaB+txfdGgs6bbo2wT99FrmsnJubK94jLNUmyD+yBHMY6a5lwTDHLLfc24BLP/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T16:21:01.001792Z"},"content_sha256":"3858c6a52b3828e760bc03084dc66453b5d41a56e8ec1636aa4310cea528fe62","schema_version":"1.0","event_id":"sha256:3858c6a52b3828e760bc03084dc66453b5d41a56e8ec1636aa4310cea528fe62"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/473IBZNQARDW7DK47SO2RJENWV/bundle.json","state_url":"https://pith.science/pith/473IBZNQARDW7DK47SO2RJENWV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/473IBZNQARDW7DK47SO2RJENWV/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-11T16:21:01Z","links":{"resolver":"https://pith.science/pith/473IBZNQARDW7DK47SO2RJENWV","bundle":"https://pith.science/pith/473IBZNQARDW7DK47SO2RJENWV/bundle.json","state":"https://pith.science/pith/473IBZNQARDW7DK47SO2RJENWV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/473IBZNQARDW7DK47SO2RJENWV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:473IBZNQARDW7DK47SO2RJENWV","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":"87ec477bb16885d56604b3210b475d8d4a3873a5750e97bcff32c145b7ed2ac4","cross_cats_sorted":["cs.CV","cs.IT","math.IT","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-02-06T20:16:35Z","title_canon_sha256":"dd98ca0dabcc2b63e2f679e40b65f09c3eae065477d75c2d57253012fd87c72e"},"schema_version":"1.0","source":{"id":"1402.1473","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.1473","created_at":"2026-05-18T02:30:08Z"},{"alias_kind":"arxiv_version","alias_value":"1402.1473v1","created_at":"2026-05-18T02:30:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.1473","created_at":"2026-05-18T02:30:08Z"},{"alias_kind":"pith_short_12","alias_value":"473IBZNQARDW","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"473IBZNQARDW7DK4","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"473IBZNQ","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:3858c6a52b3828e760bc03084dc66453b5d41a56e8ec1636aa4310cea528fe62","target":"graph","created_at":"2026-05-18T02:30:08Z","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":"Joint matching over a collection of objects aims at aggregating information from a large collection of similar instances (e.g. images, graphs, shapes) to improve maps between pairs of them. Given multiple matches computed between a few object pairs in isolation, the goal is to recover an entire collection of maps that are (1) globally consistent, and (2) close to the provided maps --- and under certain conditions provably the ground-truth maps. Despite recent advances on this problem, the best-known recovery guarantees are limited to a small constant barrier --- none of the existing methods fi","authors_text":"Leonidas J. Guibas, Qi-Xing Huang, Yuxin Chen","cross_cats":["cs.CV","cs.IT","math.IT","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-02-06T20:16:35Z","title":"Near-Optimal Joint Object Matching via Convex Relaxation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.1473","kind":"arxiv","version":1},"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:994b06061e125a81a5096ad56b09790ee15e7674ea5cd088ce979d98cab571db","target":"record","created_at":"2026-05-18T02:30:08Z","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":"87ec477bb16885d56604b3210b475d8d4a3873a5750e97bcff32c145b7ed2ac4","cross_cats_sorted":["cs.CV","cs.IT","math.IT","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-02-06T20:16:35Z","title_canon_sha256":"dd98ca0dabcc2b63e2f679e40b65f09c3eae065477d75c2d57253012fd87c72e"},"schema_version":"1.0","source":{"id":"1402.1473","kind":"arxiv","version":1}},"canonical_sha256":"e7f680e5b004476f8d5cfc9da8a48db558f4339eed589822880c682c04655217","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7f680e5b004476f8d5cfc9da8a48db558f4339eed589822880c682c04655217","first_computed_at":"2026-05-18T02:30:08.471407Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:08.471407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZXaOfwkLsWEjsRQq3n4TeS/XWP3KvpZ3nAxJgeKXOF64j4LBya1xDQYvR665O3qG+vRcQlGIMar6Y9sFFDvXBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:08.471937Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.1473","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:994b06061e125a81a5096ad56b09790ee15e7674ea5cd088ce979d98cab571db","sha256:3858c6a52b3828e760bc03084dc66453b5d41a56e8ec1636aa4310cea528fe62"],"state_sha256":"1106c062a9a4775f4b6ad05e4eb818f548a1361e1f8e804f5cfe05845b1dce41"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O2YWY8sqrKcvaaONRjVtgGAgTzxnVUNcidCpxwoSC6yQG3LMSi2DAqv2kpsuYi6yMIITQTW6+r9+JMvbcKlrBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T16:21:01.009740Z","bundle_sha256":"1bb58adf11896f4f6b5a377d1508071569bdaaee3ab706f8a4c502c05f9267ac"}}