{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:E57WAO7VWQOJ7DFVFW4VZTA225","short_pith_number":"pith:E57WAO7V","schema_version":"1.0","canonical_sha256":"277f603bf5b41c9f8cb52db95ccc1ad74fa32ee959da474dd4c816ac2a521d41","source":{"kind":"arxiv","id":"1310.0710","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1310.0710","created_at":"2026-05-18T03:11:34.249337+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.0710v1","created_at":"2026-05-18T03:11:34.249337+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.0710","created_at":"2026-05-18T03:11:34.249337+00:00"},{"alias_kind":"pith_short_12","alias_value":"E57WAO7VWQOJ","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"E57WAO7VWQOJ7DFV","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"E57WAO7V","created_at":"2026-05-18T12:27:43.054852+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E57WAO7VWQOJ7DFVFW4VZTA225","json":"https://pith.science/pith/E57WAO7VWQOJ7DFVFW4VZTA225.json","graph_json":"https://pith.science/api/pith-number/E57WAO7VWQOJ7DFVFW4VZTA225/graph.json","events_json":"https://pith.science/api/pith-number/E57WAO7VWQOJ7DFVFW4VZTA225/events.json","paper":"https://pith.science/paper/E57WAO7V"},"agent_actions":{"view_html":"https://pith.science/pith/E57WAO7VWQOJ7DFVFW4VZTA225","download_json":"https://pith.science/pith/E57WAO7VWQOJ7DFVFW4VZTA225.json","view_paper":"https://pith.science/paper/E57WAO7V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.0710&json=true","fetch_graph":"https://pith.science/api/pith-number/E57WAO7VWQOJ7DFVFW4VZTA225/graph.json","fetch_events":"https://pith.science/api/pith-number/E57WAO7VWQOJ7DFVFW4VZTA225/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E57WAO7VWQOJ7DFVFW4VZTA225/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E57WAO7VWQOJ7DFVFW4VZTA225/action/storage_attestation","attest_author":"https://pith.science/pith/E57WAO7VWQOJ7DFVFW4VZTA225/action/author_attestation","sign_citation":"https://pith.science/pith/E57WAO7VWQOJ7DFVFW4VZTA225/action/citation_signature","submit_replication":"https://pith.science/pith/E57WAO7VWQOJ7DFVFW4VZTA225/action/replication_record"}},"created_at":"2026-05-18T03:11:34.249337+00:00","updated_at":"2026-05-18T03:11:34.249337+00:00"}