{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:E57WAO7VWQOJ7DFVFW4VZTA225","short_pith_number":"pith:E57WAO7V","canonical_record":{"source":{"id":"1310.0710","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-10-02T14:08:33Z","cross_cats_sorted":["cs.DC","math.AT"],"title_canon_sha256":"4488988a1f890769997155accbde1651e589f0a43a6b277af237c30f9ae66678","abstract_canon_sha256":"fc8db3eecd5178a500b5c36d783db560659f593fcfd2f5168ef5bf53016fb77a"},"schema_version":"1.0"},"canonical_sha256":"277f603bf5b41c9f8cb52db95ccc1ad74fa32ee959da474dd4c816ac2a521d41","source":{"kind":"arxiv","id":"1310.0710","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.0710","created_at":"2026-05-18T03:11:34Z"},{"alias_kind":"arxiv_version","alias_value":"1310.0710v1","created_at":"2026-05-18T03:11:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.0710","created_at":"2026-05-18T03:11:34Z"},{"alias_kind":"pith_short_12","alias_value":"E57WAO7VWQOJ","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"E57WAO7VWQOJ7DFV","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"E57WAO7V","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:E57WAO7VWQOJ7DFVFW4VZTA225","target":"record","payload":{"canonical_record":{"source":{"id":"1310.0710","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-10-02T14:08:33Z","cross_cats_sorted":["cs.DC","math.AT"],"title_canon_sha256":"4488988a1f890769997155accbde1651e589f0a43a6b277af237c30f9ae66678","abstract_canon_sha256":"fc8db3eecd5178a500b5c36d783db560659f593fcfd2f5168ef5bf53016fb77a"},"schema_version":"1.0"},"canonical_sha256":"277f603bf5b41c9f8cb52db95ccc1ad74fa32ee959da474dd4c816ac2a521d41","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:34.249985Z","signature_b64":"zbaCd7SXIxNGuDon3qdDYbDCqC9oBlWkgtVd4cjZ50PC1bjfvZtx1OZilnqyljvE2EOzFDUZv9ygB9V3lA1LBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"277f603bf5b41c9f8cb52db95ccc1ad74fa32ee959da474dd4c816ac2a521d41","last_reissued_at":"2026-05-18T03:11:34.249215Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:34.249215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.0710","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-18T03:11:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FvVFthbsXoZxpNULQnP41Ji8Qy8but0fvo8mweZcJ2iHdPJ7azqdEBb2r2zk6iI/58nKrwLASpZbu+IQ8oMNCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:06:41.781051Z"},"content_sha256":"364db1121ea8a8ca22241a8649913139bd7322740e8e2d259acf13885c03ba6a","schema_version":"1.0","event_id":"sha256:364db1121ea8a8ca22241a8649913139bd7322740e8e2d259acf13885c03ba6a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:E57WAO7VWQOJ7DFVFW4VZTA225","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed computation of persistent homology","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.AT"],"primary_cat":"cs.CG","authors_text":"Jan Reininghaus, Michael Kerber, Ulrich Bauer","submitted_at":"2013-10-02T14:08:33Z","abstract_excerpt":"Persistent homology is a popular and powerful tool for capturing topological features of data. Advances in algorithms for computing persistent homology have reduced the computation time drastically -- as long as the algorithm does not exhaust the available memory. Following up on a recently presented parallel method for persistence computation on shared memory systems, we demonstrate that a simple adaption of the standard reduction algorithm leads to a variant for distributed systems. Our algorithmic design ensures that the data is distributed over the nodes without redundancy; this permits th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.0710","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-18T03:11:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y7BW2cfzwwUMce60PN9OxH8FU4cQ2lCCTfR5njHRTwXmUVr01x2AZV8FdnGAd2EtHGhN3jt6OP2HOqqFzehnAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:06:41.781406Z"},"content_sha256":"5bc93719923c9de5efe18fa85246c449a0c679b0f42e3636c3b19569626db1a0","schema_version":"1.0","event_id":"sha256:5bc93719923c9de5efe18fa85246c449a0c679b0f42e3636c3b19569626db1a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E57WAO7VWQOJ7DFVFW4VZTA225/bundle.json","state_url":"https://pith.science/pith/E57WAO7VWQOJ7DFVFW4VZTA225/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E57WAO7VWQOJ7DFVFW4VZTA225/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-04T22:06:41Z","links":{"resolver":"https://pith.science/pith/E57WAO7VWQOJ7DFVFW4VZTA225","bundle":"https://pith.science/pith/E57WAO7VWQOJ7DFVFW4VZTA225/bundle.json","state":"https://pith.science/pith/E57WAO7VWQOJ7DFVFW4VZTA225/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E57WAO7VWQOJ7DFVFW4VZTA225/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:E57WAO7VWQOJ7DFVFW4VZTA225","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":"fc8db3eecd5178a500b5c36d783db560659f593fcfd2f5168ef5bf53016fb77a","cross_cats_sorted":["cs.DC","math.AT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-10-02T14:08:33Z","title_canon_sha256":"4488988a1f890769997155accbde1651e589f0a43a6b277af237c30f9ae66678"},"schema_version":"1.0","source":{"id":"1310.0710","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.0710","created_at":"2026-05-18T03:11:34Z"},{"alias_kind":"arxiv_version","alias_value":"1310.0710v1","created_at":"2026-05-18T03:11:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.0710","created_at":"2026-05-18T03:11:34Z"},{"alias_kind":"pith_short_12","alias_value":"E57WAO7VWQOJ","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"E57WAO7VWQOJ7DFV","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"E57WAO7V","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:5bc93719923c9de5efe18fa85246c449a0c679b0f42e3636c3b19569626db1a0","target":"graph","created_at":"2026-05-18T03:11:34Z","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":"Persistent homology is a popular and powerful tool for capturing topological features of data. Advances in algorithms for computing persistent homology have reduced the computation time drastically -- as long as the algorithm does not exhaust the available memory. Following up on a recently presented parallel method for persistence computation on shared memory systems, we demonstrate that a simple adaption of the standard reduction algorithm leads to a variant for distributed systems. Our algorithmic design ensures that the data is distributed over the nodes without redundancy; this permits th","authors_text":"Jan Reininghaus, Michael Kerber, Ulrich Bauer","cross_cats":["cs.DC","math.AT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-10-02T14:08:33Z","title":"Distributed computation of persistent homology"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.0710","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:364db1121ea8a8ca22241a8649913139bd7322740e8e2d259acf13885c03ba6a","target":"record","created_at":"2026-05-18T03:11:34Z","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":"fc8db3eecd5178a500b5c36d783db560659f593fcfd2f5168ef5bf53016fb77a","cross_cats_sorted":["cs.DC","math.AT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-10-02T14:08:33Z","title_canon_sha256":"4488988a1f890769997155accbde1651e589f0a43a6b277af237c30f9ae66678"},"schema_version":"1.0","source":{"id":"1310.0710","kind":"arxiv","version":1}},"canonical_sha256":"277f603bf5b41c9f8cb52db95ccc1ad74fa32ee959da474dd4c816ac2a521d41","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"277f603bf5b41c9f8cb52db95ccc1ad74fa32ee959da474dd4c816ac2a521d41","first_computed_at":"2026-05-18T03:11:34.249215Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:34.249215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zbaCd7SXIxNGuDon3qdDYbDCqC9oBlWkgtVd4cjZ50PC1bjfvZtx1OZilnqyljvE2EOzFDUZv9ygB9V3lA1LBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:34.249985Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.0710","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:364db1121ea8a8ca22241a8649913139bd7322740e8e2d259acf13885c03ba6a","sha256:5bc93719923c9de5efe18fa85246c449a0c679b0f42e3636c3b19569626db1a0"],"state_sha256":"106506e1b37cd2fd129ddc5cf34480f11850bc0399f49b00dd1f4b4885086a3a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r1tAHatCb8x2F5dmljDiZ3hqn7xx8ubbbMAHftg+6zs11hxgQVzA2ibcUce7Y1gd7SpX+z7CFRsqJeT4+yo7BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T22:06:41.783412Z","bundle_sha256":"9878d0a4ff4db1282a286cab95a251ba334ba0eb22e0fff6da30a0bc92c5a0f0"}}