{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:IKEEAPGDDYJNZT43CXHJ5XRWNL","short_pith_number":"pith:IKEEAPGD","canonical_record":{"source":{"id":"1312.1494","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-12-05T10:39:40Z","cross_cats_sorted":["cs.CV","math.AT"],"title_canon_sha256":"a3be210a242aadc40027b59dcbfd01f5fd15137c1f25bd524208cccc5d993d50","abstract_canon_sha256":"f8f50c535ef5dde55e256f43746eee58436abd056ad9339eee0a61de3a3140d1"},"schema_version":"1.0"},"canonical_sha256":"4288403cc31e12dccf9b15ce9ede366ad4b6da3da5675828db5699680906f505","source":{"kind":"arxiv","id":"1312.1494","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1494","created_at":"2026-05-18T00:35:05Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1494v2","created_at":"2026-05-18T00:35:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1494","created_at":"2026-05-18T00:35:05Z"},{"alias_kind":"pith_short_12","alias_value":"IKEEAPGDDYJN","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"IKEEAPGDDYJNZT43","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"IKEEAPGD","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:IKEEAPGDDYJNZT43CXHJ5XRWNL","target":"record","payload":{"canonical_record":{"source":{"id":"1312.1494","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-12-05T10:39:40Z","cross_cats_sorted":["cs.CV","math.AT"],"title_canon_sha256":"a3be210a242aadc40027b59dcbfd01f5fd15137c1f25bd524208cccc5d993d50","abstract_canon_sha256":"f8f50c535ef5dde55e256f43746eee58436abd056ad9339eee0a61de3a3140d1"},"schema_version":"1.0"},"canonical_sha256":"4288403cc31e12dccf9b15ce9ede366ad4b6da3da5675828db5699680906f505","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:05.847467Z","signature_b64":"8AamtyVjU6ymGalX3u31Dxegv59qJ06FYYhiRYMcl4AK5uxPMCl889ZTgtQ3SLgySu0E/8IJTefm/gdrRBp7AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4288403cc31e12dccf9b15ce9ede366ad4b6da3da5675828db5699680906f505","last_reissued_at":"2026-05-18T00:35:05.846892Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:05.846892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.1494","source_version":2,"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-18T00:35:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2WQZKu5MDakxp8XTGGI9NRX65OAKrrF2/J3txXj7QpgNCddbMkhGNvdgo4zlC/N7/no1o429wbhWXQI6sJFsBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T03:01:53.779228Z"},"content_sha256":"9244a5f1a68f846c17a0430bcf2b204c2b5364a945d5999141f6ba99b91df84c","schema_version":"1.0","event_id":"sha256:9244a5f1a68f846c17a0430bcf2b204c2b5364a945d5999141f6ba99b91df84c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:IKEEAPGDDYJNZT43CXHJ5XRWNL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating persistent homology for a cloud of $n$ points in a subquadratic time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","math.AT"],"primary_cat":"cs.CG","authors_text":"Vitaliy Kurlin","submitted_at":"2013-12-05T10:39:40Z","abstract_excerpt":"The Vietoris-Rips filtration for an $n$-point metric space is a sequence of large simplicial complexes adding a topological structure to the otherwise disconnected space. The persistent homology is a key tool in topological data analysis and studies topological features of data that persist over many scales. The fastest algorithm for computing persistent homology of a filtration has time $O(M(u)+u^2\\log^2 u)$, where $u$ is the number of updates (additions or deletions of simplices), $M(u)=O(u^{2.376})$ is the time for multiplication of $u\\times u$ matrices. For a space of $n$ points given by t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1494","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"},"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-18T00:35:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8lTaHB4likn7ZVa3zvhwXGbas+8jQHhnK7l6Z/qIwa6gvxIDDsmYz02q52mZv0tvm+zgQWkQt0qICMuw8P1dAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T03:01:53.779714Z"},"content_sha256":"f54b52a767f4151ea31a1f32d36e2cc8248e8cc6215bc9bc9153847a761a58e2","schema_version":"1.0","event_id":"sha256:f54b52a767f4151ea31a1f32d36e2cc8248e8cc6215bc9bc9153847a761a58e2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IKEEAPGDDYJNZT43CXHJ5XRWNL/bundle.json","state_url":"https://pith.science/pith/IKEEAPGDDYJNZT43CXHJ5XRWNL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IKEEAPGDDYJNZT43CXHJ5XRWNL/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-27T03:01:53Z","links":{"resolver":"https://pith.science/pith/IKEEAPGDDYJNZT43CXHJ5XRWNL","bundle":"https://pith.science/pith/IKEEAPGDDYJNZT43CXHJ5XRWNL/bundle.json","state":"https://pith.science/pith/IKEEAPGDDYJNZT43CXHJ5XRWNL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IKEEAPGDDYJNZT43CXHJ5XRWNL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:IKEEAPGDDYJNZT43CXHJ5XRWNL","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":"f8f50c535ef5dde55e256f43746eee58436abd056ad9339eee0a61de3a3140d1","cross_cats_sorted":["cs.CV","math.AT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-12-05T10:39:40Z","title_canon_sha256":"a3be210a242aadc40027b59dcbfd01f5fd15137c1f25bd524208cccc5d993d50"},"schema_version":"1.0","source":{"id":"1312.1494","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1494","created_at":"2026-05-18T00:35:05Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1494v2","created_at":"2026-05-18T00:35:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1494","created_at":"2026-05-18T00:35:05Z"},{"alias_kind":"pith_short_12","alias_value":"IKEEAPGDDYJN","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"IKEEAPGDDYJNZT43","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"IKEEAPGD","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:f54b52a767f4151ea31a1f32d36e2cc8248e8cc6215bc9bc9153847a761a58e2","target":"graph","created_at":"2026-05-18T00:35:05Z","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":"The Vietoris-Rips filtration for an $n$-point metric space is a sequence of large simplicial complexes adding a topological structure to the otherwise disconnected space. The persistent homology is a key tool in topological data analysis and studies topological features of data that persist over many scales. The fastest algorithm for computing persistent homology of a filtration has time $O(M(u)+u^2\\log^2 u)$, where $u$ is the number of updates (additions or deletions of simplices), $M(u)=O(u^{2.376})$ is the time for multiplication of $u\\times u$ matrices. For a space of $n$ points given by t","authors_text":"Vitaliy Kurlin","cross_cats":["cs.CV","math.AT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-12-05T10:39:40Z","title":"Approximating persistent homology for a cloud of $n$ points in a subquadratic time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1494","kind":"arxiv","version":2},"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:9244a5f1a68f846c17a0430bcf2b204c2b5364a945d5999141f6ba99b91df84c","target":"record","created_at":"2026-05-18T00:35:05Z","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":"f8f50c535ef5dde55e256f43746eee58436abd056ad9339eee0a61de3a3140d1","cross_cats_sorted":["cs.CV","math.AT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-12-05T10:39:40Z","title_canon_sha256":"a3be210a242aadc40027b59dcbfd01f5fd15137c1f25bd524208cccc5d993d50"},"schema_version":"1.0","source":{"id":"1312.1494","kind":"arxiv","version":2}},"canonical_sha256":"4288403cc31e12dccf9b15ce9ede366ad4b6da3da5675828db5699680906f505","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4288403cc31e12dccf9b15ce9ede366ad4b6da3da5675828db5699680906f505","first_computed_at":"2026-05-18T00:35:05.846892Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:05.846892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8AamtyVjU6ymGalX3u31Dxegv59qJ06FYYhiRYMcl4AK5uxPMCl889ZTgtQ3SLgySu0E/8IJTefm/gdrRBp7AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:05.847467Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.1494","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9244a5f1a68f846c17a0430bcf2b204c2b5364a945d5999141f6ba99b91df84c","sha256:f54b52a767f4151ea31a1f32d36e2cc8248e8cc6215bc9bc9153847a761a58e2"],"state_sha256":"aa7b07bb6685bf1816fdab1ab0a516dd931ffaca410afdbe414d9e2e171f71d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kJ+VJCaKwijXG8nurqVkJCs50Pxccr/7uO7m87xfiA9PSzprW07Y0aDzPocgyij+XmIF25jIrc0Ji7Da/RjlDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T03:01:53.782017Z","bundle_sha256":"50cf3d32ab4c95e63d747cb3af56bee4b5f837ab0fd3e9c624f66ad5b05dc3a8"}}