{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:524QPQRKVO4QQ52LUVCNKMOX2L","short_pith_number":"pith:524QPQRK","canonical_record":{"source":{"id":"2112.04165","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2021-12-08T08:23:37Z","cross_cats_sorted":["cs.GR","cs.LG","math.OC"],"title_canon_sha256":"fb34eec8e2a648ee8ddc024949819d764360b78f82d1f55ca4f6a9a368051e56","abstract_canon_sha256":"070c8d24e2d75f9d5a9e746a0535dc9ee2926b4df14f9fc9c9561c8ef06c9d66"},"schema_version":"1.0"},"canonical_sha256":"eeb907c22aabb908774ba544d531d7d2c9fdc6a907005da2bbbaf68472d4429b","source":{"kind":"arxiv","id":"2112.04165","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.04165","created_at":"2026-07-05T03:39:06Z"},{"alias_kind":"arxiv_version","alias_value":"2112.04165v1","created_at":"2026-07-05T03:39:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.04165","created_at":"2026-07-05T03:39:06Z"},{"alias_kind":"pith_short_12","alias_value":"524QPQRKVO4Q","created_at":"2026-07-05T03:39:06Z"},{"alias_kind":"pith_short_16","alias_value":"524QPQRKVO4QQ52L","created_at":"2026-07-05T03:39:06Z"},{"alias_kind":"pith_short_8","alias_value":"524QPQRK","created_at":"2026-07-05T03:39:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:524QPQRKVO4QQ52LUVCNKMOX2L","target":"record","payload":{"canonical_record":{"source":{"id":"2112.04165","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2021-12-08T08:23:37Z","cross_cats_sorted":["cs.GR","cs.LG","math.OC"],"title_canon_sha256":"fb34eec8e2a648ee8ddc024949819d764360b78f82d1f55ca4f6a9a368051e56","abstract_canon_sha256":"070c8d24e2d75f9d5a9e746a0535dc9ee2926b4df14f9fc9c9561c8ef06c9d66"},"schema_version":"1.0"},"canonical_sha256":"eeb907c22aabb908774ba544d531d7d2c9fdc6a907005da2bbbaf68472d4429b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:39:06.760406Z","signature_b64":"cxwTuEAkWnRiJHP7ilZnQ+FeOkzvpszTIbDOKQ6Z3GZ71/1M83fCfwZuYxhozrvgTfsdqGORaIZQGiiE0rewAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eeb907c22aabb908774ba544d531d7d2c9fdc6a907005da2bbbaf68472d4429b","last_reissued_at":"2026-07-05T03:39:06.759987Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:39:06.759987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2112.04165","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-07-05T03:39:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eP1Zoz13NXUmqY8UqV4Bu/A4rNQdg03ai0UExgo6lAJRwoL5iuCtNP2ghGZnmE4kNS4EUa/YrpHojVc7xTKzDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T01:11:09.649633Z"},"content_sha256":"16f0d0a61e24435af489ab7ae02094e5ed83b598d2a7cdab98faf0007ea652b7","schema_version":"1.0","event_id":"sha256:16f0d0a61e24435af489ab7ae02094e5ed83b598d2a7cdab98faf0007ea652b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:524QPQRKVO4QQ52LUVCNKMOX2L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Shortest Paths in Graphs with Matrix-Valued Edges: Concepts, Algorithm and Application to 3D Multi-Shape Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GR","cs.LG","math.OC"],"primary_cat":"cs.CV","authors_text":"Daniel Cremers, Florian Bernard, Viktoria Ehm","submitted_at":"2021-12-08T08:23:37Z","abstract_excerpt":"Finding shortest paths in a graph is relevant for numerous problems in computer vision and graphics, including image segmentation, shape matching, or the computation of geodesic distances on discrete surfaces. Traditionally, the concept of a shortest path is considered for graphs with scalar edge weights, which makes it possible to compute the length of a path by adding up the individual edge weights. Yet, graphs with scalar edge weights are severely limited in their expressivity, since oftentimes edges are used to encode significantly more complex interrelations. In this work we compensate fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.04165","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2112.04165/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:39:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mvNEiHLCesHDHOBtOcAIFasvUxe2vNHtVjqijJSlAFO8O42m+mDlUr/82cik+Bz0lqQl1jumrzSiy919k2caCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T01:11:09.649982Z"},"content_sha256":"6e662502324e3c936130dc38cb2ebf051ed7075f150e02d06e55c69da27df635","schema_version":"1.0","event_id":"sha256:6e662502324e3c936130dc38cb2ebf051ed7075f150e02d06e55c69da27df635"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/524QPQRKVO4QQ52LUVCNKMOX2L/bundle.json","state_url":"https://pith.science/pith/524QPQRKVO4QQ52LUVCNKMOX2L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/524QPQRKVO4QQ52LUVCNKMOX2L/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-08-24T01:11:09Z","links":{"resolver":"https://pith.science/pith/524QPQRKVO4QQ52LUVCNKMOX2L","bundle":"https://pith.science/pith/524QPQRKVO4QQ52LUVCNKMOX2L/bundle.json","state":"https://pith.science/pith/524QPQRKVO4QQ52LUVCNKMOX2L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/524QPQRKVO4QQ52LUVCNKMOX2L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:524QPQRKVO4QQ52LUVCNKMOX2L","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":"070c8d24e2d75f9d5a9e746a0535dc9ee2926b4df14f9fc9c9561c8ef06c9d66","cross_cats_sorted":["cs.GR","cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2021-12-08T08:23:37Z","title_canon_sha256":"fb34eec8e2a648ee8ddc024949819d764360b78f82d1f55ca4f6a9a368051e56"},"schema_version":"1.0","source":{"id":"2112.04165","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.04165","created_at":"2026-07-05T03:39:06Z"},{"alias_kind":"arxiv_version","alias_value":"2112.04165v1","created_at":"2026-07-05T03:39:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.04165","created_at":"2026-07-05T03:39:06Z"},{"alias_kind":"pith_short_12","alias_value":"524QPQRKVO4Q","created_at":"2026-07-05T03:39:06Z"},{"alias_kind":"pith_short_16","alias_value":"524QPQRKVO4QQ52L","created_at":"2026-07-05T03:39:06Z"},{"alias_kind":"pith_short_8","alias_value":"524QPQRK","created_at":"2026-07-05T03:39:06Z"}],"graph_snapshots":[{"event_id":"sha256:6e662502324e3c936130dc38cb2ebf051ed7075f150e02d06e55c69da27df635","target":"graph","created_at":"2026-07-05T03:39:06Z","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/2112.04165/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Finding shortest paths in a graph is relevant for numerous problems in computer vision and graphics, including image segmentation, shape matching, or the computation of geodesic distances on discrete surfaces. Traditionally, the concept of a shortest path is considered for graphs with scalar edge weights, which makes it possible to compute the length of a path by adding up the individual edge weights. Yet, graphs with scalar edge weights are severely limited in their expressivity, since oftentimes edges are used to encode significantly more complex interrelations. In this work we compensate fo","authors_text":"Daniel Cremers, Florian Bernard, Viktoria Ehm","cross_cats":["cs.GR","cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2021-12-08T08:23:37Z","title":"Shortest Paths in Graphs with Matrix-Valued Edges: Concepts, Algorithm and Application to 3D Multi-Shape Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.04165","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:16f0d0a61e24435af489ab7ae02094e5ed83b598d2a7cdab98faf0007ea652b7","target":"record","created_at":"2026-07-05T03:39:06Z","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":"070c8d24e2d75f9d5a9e746a0535dc9ee2926b4df14f9fc9c9561c8ef06c9d66","cross_cats_sorted":["cs.GR","cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2021-12-08T08:23:37Z","title_canon_sha256":"fb34eec8e2a648ee8ddc024949819d764360b78f82d1f55ca4f6a9a368051e56"},"schema_version":"1.0","source":{"id":"2112.04165","kind":"arxiv","version":1}},"canonical_sha256":"eeb907c22aabb908774ba544d531d7d2c9fdc6a907005da2bbbaf68472d4429b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eeb907c22aabb908774ba544d531d7d2c9fdc6a907005da2bbbaf68472d4429b","first_computed_at":"2026-07-05T03:39:06.759987Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:39:06.759987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cxwTuEAkWnRiJHP7ilZnQ+FeOkzvpszTIbDOKQ6Z3GZ71/1M83fCfwZuYxhozrvgTfsdqGORaIZQGiiE0rewAw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:39:06.760406Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.04165","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16f0d0a61e24435af489ab7ae02094e5ed83b598d2a7cdab98faf0007ea652b7","sha256:6e662502324e3c936130dc38cb2ebf051ed7075f150e02d06e55c69da27df635"],"state_sha256":"8206ccbdb87cc1b779f202ae7e1881ba861cdf425edf5a54c31d1dcd94ec908c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dXOfOpFWLnUvdecqVJq7rDtI9237FoU3ndZo3bTNK70sIoV4yt08UKs2XITkOpqzVHQdrGgZFKf/6uCdwFlpDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-24T01:11:09.654453Z","bundle_sha256":"d1fe13cd4a37071643b91201a18507863935e27eea8c2b8b67c88b7241abfd7f"}}