{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ENUA2OSM5MQG2HSTDTCLROQE3U","short_pith_number":"pith:ENUA2OSM","canonical_record":{"source":{"id":"1607.03425","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-07-12T16:04:54Z","cross_cats_sorted":[],"title_canon_sha256":"aade7af6ff98d0c990004dceaabfaaa5297d0d9be427b42c0d44915e821d26e8","abstract_canon_sha256":"e4ddb2b8afee08f69d1b731a9ba7f3493e4946d027f3072ff8432ff280fc0561"},"schema_version":"1.0"},"canonical_sha256":"23680d3a4ceb206d1e531cc4b8ba04dd0d10da96c01fd85a3611cfa5211f5870","source":{"kind":"arxiv","id":"1607.03425","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.03425","created_at":"2026-05-18T01:11:09Z"},{"alias_kind":"arxiv_version","alias_value":"1607.03425v1","created_at":"2026-05-18T01:11:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.03425","created_at":"2026-05-18T01:11:09Z"},{"alias_kind":"pith_short_12","alias_value":"ENUA2OSM5MQG","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"ENUA2OSM5MQG2HST","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"ENUA2OSM","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ENUA2OSM5MQG2HSTDTCLROQE3U","target":"record","payload":{"canonical_record":{"source":{"id":"1607.03425","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-07-12T16:04:54Z","cross_cats_sorted":[],"title_canon_sha256":"aade7af6ff98d0c990004dceaabfaaa5297d0d9be427b42c0d44915e821d26e8","abstract_canon_sha256":"e4ddb2b8afee08f69d1b731a9ba7f3493e4946d027f3072ff8432ff280fc0561"},"schema_version":"1.0"},"canonical_sha256":"23680d3a4ceb206d1e531cc4b8ba04dd0d10da96c01fd85a3611cfa5211f5870","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:09.020478Z","signature_b64":"A0yVajM41F4B/+dk6RVboI2hyYb3W4/R5zf9kZSAQQPJV/qT5KrEzfMPuifNk2Jg+upiGVACHdUBuqm5VwFPAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23680d3a4ceb206d1e531cc4b8ba04dd0d10da96c01fd85a3611cfa5211f5870","last_reissued_at":"2026-05-18T01:11:09.019972Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:09.019972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.03425","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-18T01:11:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BaXIIcZNjCZQ8Z8634gYXYOQ4NWbylo0X48+Bgpt/5hBQWjpWm88FMbQe/g6a5vxh5WKayyzOkXS8Z8ZPHz3BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T03:02:42.764036Z"},"content_sha256":"24ca62b33cec7325dbcfc572bed9f20529f290bf2987c11143e7b0f49e4f29b7","schema_version":"1.0","event_id":"sha256:24ca62b33cec7325dbcfc572bed9f20529f290bf2987c11143e7b0f49e4f29b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ENUA2OSM5MQG2HSTDTCLROQE3U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bayesian Inference of Bijective Non-Rigid Shape Correspondence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Alex Bronstein, Daniel Cremers, Emanuele Rodol\\`a, Matthias Vestner, Roee Litman","submitted_at":"2016-07-12T16:04:54Z","abstract_excerpt":"Many algorithms for the computation of correspondences between deformable shapes rely on some variant of nearest neighbor matching in a descriptor space. Such are, for example, various point-wise correspondence recovery algorithms used as a postprocessing stage in the functional correspondence framework. In this paper, we show that such frequently used techniques in practice suffer from lack of accuracy and result in poor surjectivity. We propose an alternative recovery technique guaranteeing a bijective correspondence and producing significantly higher accuracy. We derive the proposed method "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.03425","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-18T01:11:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ihGUgRhKWMVi7nn+vJ/2zgsD6iEuS4i8QS+uFxzwvoutdAZyvU2NnpxzfmNahSeDEEpaCu3Mtu4XshD/Y+mPBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T03:02:42.764679Z"},"content_sha256":"1e6d5db071d3dc66b7ba12b3c225848ee981a4c20f34deb90b97e1872eb33095","schema_version":"1.0","event_id":"sha256:1e6d5db071d3dc66b7ba12b3c225848ee981a4c20f34deb90b97e1872eb33095"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ENUA2OSM5MQG2HSTDTCLROQE3U/bundle.json","state_url":"https://pith.science/pith/ENUA2OSM5MQG2HSTDTCLROQE3U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ENUA2OSM5MQG2HSTDTCLROQE3U/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-06T03:02:42Z","links":{"resolver":"https://pith.science/pith/ENUA2OSM5MQG2HSTDTCLROQE3U","bundle":"https://pith.science/pith/ENUA2OSM5MQG2HSTDTCLROQE3U/bundle.json","state":"https://pith.science/pith/ENUA2OSM5MQG2HSTDTCLROQE3U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ENUA2OSM5MQG2HSTDTCLROQE3U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ENUA2OSM5MQG2HSTDTCLROQE3U","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":"e4ddb2b8afee08f69d1b731a9ba7f3493e4946d027f3072ff8432ff280fc0561","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-07-12T16:04:54Z","title_canon_sha256":"aade7af6ff98d0c990004dceaabfaaa5297d0d9be427b42c0d44915e821d26e8"},"schema_version":"1.0","source":{"id":"1607.03425","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.03425","created_at":"2026-05-18T01:11:09Z"},{"alias_kind":"arxiv_version","alias_value":"1607.03425v1","created_at":"2026-05-18T01:11:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.03425","created_at":"2026-05-18T01:11:09Z"},{"alias_kind":"pith_short_12","alias_value":"ENUA2OSM5MQG","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"ENUA2OSM5MQG2HST","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"ENUA2OSM","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:1e6d5db071d3dc66b7ba12b3c225848ee981a4c20f34deb90b97e1872eb33095","target":"graph","created_at":"2026-05-18T01:11:09Z","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":"Many algorithms for the computation of correspondences between deformable shapes rely on some variant of nearest neighbor matching in a descriptor space. Such are, for example, various point-wise correspondence recovery algorithms used as a postprocessing stage in the functional correspondence framework. In this paper, we show that such frequently used techniques in practice suffer from lack of accuracy and result in poor surjectivity. We propose an alternative recovery technique guaranteeing a bijective correspondence and producing significantly higher accuracy. We derive the proposed method ","authors_text":"Alex Bronstein, Daniel Cremers, Emanuele Rodol\\`a, Matthias Vestner, Roee Litman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-07-12T16:04:54Z","title":"Bayesian Inference of Bijective Non-Rigid Shape Correspondence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.03425","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:24ca62b33cec7325dbcfc572bed9f20529f290bf2987c11143e7b0f49e4f29b7","target":"record","created_at":"2026-05-18T01:11:09Z","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":"e4ddb2b8afee08f69d1b731a9ba7f3493e4946d027f3072ff8432ff280fc0561","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-07-12T16:04:54Z","title_canon_sha256":"aade7af6ff98d0c990004dceaabfaaa5297d0d9be427b42c0d44915e821d26e8"},"schema_version":"1.0","source":{"id":"1607.03425","kind":"arxiv","version":1}},"canonical_sha256":"23680d3a4ceb206d1e531cc4b8ba04dd0d10da96c01fd85a3611cfa5211f5870","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"23680d3a4ceb206d1e531cc4b8ba04dd0d10da96c01fd85a3611cfa5211f5870","first_computed_at":"2026-05-18T01:11:09.019972Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:09.019972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A0yVajM41F4B/+dk6RVboI2hyYb3W4/R5zf9kZSAQQPJV/qT5KrEzfMPuifNk2Jg+upiGVACHdUBuqm5VwFPAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:09.020478Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.03425","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24ca62b33cec7325dbcfc572bed9f20529f290bf2987c11143e7b0f49e4f29b7","sha256:1e6d5db071d3dc66b7ba12b3c225848ee981a4c20f34deb90b97e1872eb33095"],"state_sha256":"15eae9dc10215203065febe41f466aed5129336bfe86fbc82873e1833ee0bb6d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X95iNY+SZqcIFahh9r9MlgSMrnkiOwtnOOq3I341zAxZe1Dxy6fvvmiunMRPLvjQphAweY8yWlBeO/F5eVc4Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T03:02:42.769295Z","bundle_sha256":"15e9b0e9203752b5d54969d311c6d9daf0a56cf8d001253144f2b022be4ea2fa"}}