{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OBFRUUQSABSTO7K3PBUGQGS75D","short_pith_number":"pith:OBFRUUQS","schema_version":"1.0","canonical_sha256":"704b1a52120065377d5b7868681a5fe8dd893320f9b8830e8c0e61a48e3020d3","source":{"kind":"arxiv","id":"1701.02208","version":2},"attestation_state":"computed","paper":{"title":"Barcodes of Towers and a Streaming Algorithm for Persistent Homology","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.AT","authors_text":"Hannah Schreiber, Michael Kerber","submitted_at":"2017-01-09T15:18:28Z","abstract_excerpt":"A tower is a sequence of simplicial complexes connected by simplicial maps. We show how to compute a filtration, a sequence of nested simplicial complexes, with the same persistent barcode as the tower. Our approach is based on the coning strategy by Dey et al. (SoCG 2014). We show that a variant of this approach yields a filtration that is asymptotically only marginally larger than the tower and can be efficiently computed by a streaming algorithm, both in theory and in practice. Furthermore, we show that our approach can be combined with a streaming algorithm to compute the barcode of the to"},"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":"1701.02208","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2017-01-09T15:18:28Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"52d5329d2492838e2fffc644f06a5cb63381db419a698229c99835f3e5ff736a","abstract_canon_sha256":"516b881b5d961ee17b743b5dd4e90aba4578ae6a19ddff84f6fcd37c36b803b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:02.269604Z","signature_b64":"uVQPScpiFJx260Utm9eY7Uzblvd8azzSQuHTJ88NrVuZSy2YT8qq/hyZFFc8t0S5qwGuI/T1hXyZsPvvsOh7Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"704b1a52120065377d5b7868681a5fe8dd893320f9b8830e8c0e61a48e3020d3","last_reissued_at":"2026-05-18T00:33:02.269156Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:02.269156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Barcodes of Towers and a Streaming Algorithm for Persistent Homology","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.AT","authors_text":"Hannah Schreiber, Michael Kerber","submitted_at":"2017-01-09T15:18:28Z","abstract_excerpt":"A tower is a sequence of simplicial complexes connected by simplicial maps. We show how to compute a filtration, a sequence of nested simplicial complexes, with the same persistent barcode as the tower. Our approach is based on the coning strategy by Dey et al. (SoCG 2014). We show that a variant of this approach yields a filtration that is asymptotically only marginally larger than the tower and can be efficiently computed by a streaming algorithm, both in theory and in practice. Furthermore, we show that our approach can be combined with a streaming algorithm to compute the barcode of the to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02208","kind":"arxiv","version":2},"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":"1701.02208","created_at":"2026-05-18T00:33:02.269223+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.02208v2","created_at":"2026-05-18T00:33:02.269223+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02208","created_at":"2026-05-18T00:33:02.269223+00:00"},{"alias_kind":"pith_short_12","alias_value":"OBFRUUQSABST","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OBFRUUQSABSTO7K3","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OBFRUUQS","created_at":"2026-05-18T12:31:34.259226+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/OBFRUUQSABSTO7K3PBUGQGS75D","json":"https://pith.science/pith/OBFRUUQSABSTO7K3PBUGQGS75D.json","graph_json":"https://pith.science/api/pith-number/OBFRUUQSABSTO7K3PBUGQGS75D/graph.json","events_json":"https://pith.science/api/pith-number/OBFRUUQSABSTO7K3PBUGQGS75D/events.json","paper":"https://pith.science/paper/OBFRUUQS"},"agent_actions":{"view_html":"https://pith.science/pith/OBFRUUQSABSTO7K3PBUGQGS75D","download_json":"https://pith.science/pith/OBFRUUQSABSTO7K3PBUGQGS75D.json","view_paper":"https://pith.science/paper/OBFRUUQS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.02208&json=true","fetch_graph":"https://pith.science/api/pith-number/OBFRUUQSABSTO7K3PBUGQGS75D/graph.json","fetch_events":"https://pith.science/api/pith-number/OBFRUUQSABSTO7K3PBUGQGS75D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OBFRUUQSABSTO7K3PBUGQGS75D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OBFRUUQSABSTO7K3PBUGQGS75D/action/storage_attestation","attest_author":"https://pith.science/pith/OBFRUUQSABSTO7K3PBUGQGS75D/action/author_attestation","sign_citation":"https://pith.science/pith/OBFRUUQSABSTO7K3PBUGQGS75D/action/citation_signature","submit_replication":"https://pith.science/pith/OBFRUUQSABSTO7K3PBUGQGS75D/action/replication_record"}},"created_at":"2026-05-18T00:33:02.269223+00:00","updated_at":"2026-05-18T00:33:02.269223+00:00"}