{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:SHMMAYIFZKXOETU4SFW4XASX23","short_pith_number":"pith:SHMMAYIF","schema_version":"1.0","canonical_sha256":"91d8c06105caaee24e9c916dcb8257d6f790438f7adbceaaaa5cafd0e87cd540","source":{"kind":"arxiv","id":"2107.05412","version":2},"attestation_state":"computed","paper":{"title":"giotto-ph: A Python Library for High-Performance Computation of Persistent Homology of Vietoris-Rips Filtrations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"cs.CG","authors_text":"Alberto Dassatti, Juli\\'an Burella P\\'erez, Matteo Caorsi, Sydney Hauke, Umberto Lupo","submitted_at":"2021-07-12T13:30:45Z","abstract_excerpt":"We introduce giotto-ph, a high-performance, open-source software package for the computation of Vietoris-Rips barcodes. giotto-ph is based on Morozov and Nigmetov's lockfree (multicore) implementation of Ulrich Bauer's Ripser package. It also contains a re-working of the GUDHI library's implementation of Boissonnat and Pritam's Edge Collapser, which can be used as a pre-processing step to dramatically reduce overall run-times in certain scenarios. Our contribution is twofold: on the one hand, we integrate existing state-of-the-art ideas coherently in a single library and provide Python binding"},"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":"2107.05412","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2021-07-12T13:30:45Z","cross_cats_sorted":["cs.MS"],"title_canon_sha256":"0767b4059b512fb51ddf9444afb4568827e3431b829b767123f0e63a97ddff9c","abstract_canon_sha256":"cb13120ee91d7b9cb8b7a530d257e6b3f476e54a7e88dbdf979c923fc4559f05"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:02:56.997486Z","signature_b64":"yw+ovkOdt06ZnUqRC4rRf7EtNh+zZcZvYlx7ZukgzdtLtek0UTVUphfm90rn1n8n45XsQ6cHAWbvhk9j8+GABg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91d8c06105caaee24e9c916dcb8257d6f790438f7adbceaaaa5cafd0e87cd540","last_reissued_at":"2026-07-05T03:02:56.997026Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:02:56.997026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"giotto-ph: A Python Library for High-Performance Computation of Persistent Homology of Vietoris-Rips Filtrations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"cs.CG","authors_text":"Alberto Dassatti, Juli\\'an Burella P\\'erez, Matteo Caorsi, Sydney Hauke, Umberto Lupo","submitted_at":"2021-07-12T13:30:45Z","abstract_excerpt":"We introduce giotto-ph, a high-performance, open-source software package for the computation of Vietoris-Rips barcodes. giotto-ph is based on Morozov and Nigmetov's lockfree (multicore) implementation of Ulrich Bauer's Ripser package. It also contains a re-working of the GUDHI library's implementation of Boissonnat and Pritam's Edge Collapser, which can be used as a pre-processing step to dramatically reduce overall run-times in certain scenarios. Our contribution is twofold: on the one hand, we integrate existing state-of-the-art ideas coherently in a single library and provide Python binding"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.05412","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2107.05412/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2107.05412","created_at":"2026-07-05T03:02:56.997120+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.05412v2","created_at":"2026-07-05T03:02:56.997120+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.05412","created_at":"2026-07-05T03:02:56.997120+00:00"},{"alias_kind":"pith_short_12","alias_value":"SHMMAYIFZKXO","created_at":"2026-07-05T03:02:56.997120+00:00"},{"alias_kind":"pith_short_16","alias_value":"SHMMAYIFZKXOETU4","created_at":"2026-07-05T03:02:56.997120+00:00"},{"alias_kind":"pith_short_8","alias_value":"SHMMAYIF","created_at":"2026-07-05T03:02:56.997120+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2312.03925","citing_title":"Pruning vineyards: updating barcodes and representative cycles by removing simplices","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SHMMAYIFZKXOETU4SFW4XASX23","json":"https://pith.science/pith/SHMMAYIFZKXOETU4SFW4XASX23.json","graph_json":"https://pith.science/api/pith-number/SHMMAYIFZKXOETU4SFW4XASX23/graph.json","events_json":"https://pith.science/api/pith-number/SHMMAYIFZKXOETU4SFW4XASX23/events.json","paper":"https://pith.science/paper/SHMMAYIF"},"agent_actions":{"view_html":"https://pith.science/pith/SHMMAYIFZKXOETU4SFW4XASX23","download_json":"https://pith.science/pith/SHMMAYIFZKXOETU4SFW4XASX23.json","view_paper":"https://pith.science/paper/SHMMAYIF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.05412&json=true","fetch_graph":"https://pith.science/api/pith-number/SHMMAYIFZKXOETU4SFW4XASX23/graph.json","fetch_events":"https://pith.science/api/pith-number/SHMMAYIFZKXOETU4SFW4XASX23/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SHMMAYIFZKXOETU4SFW4XASX23/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SHMMAYIFZKXOETU4SFW4XASX23/action/storage_attestation","attest_author":"https://pith.science/pith/SHMMAYIFZKXOETU4SFW4XASX23/action/author_attestation","sign_citation":"https://pith.science/pith/SHMMAYIFZKXOETU4SFW4XASX23/action/citation_signature","submit_replication":"https://pith.science/pith/SHMMAYIFZKXOETU4SFW4XASX23/action/replication_record"}},"created_at":"2026-07-05T03:02:56.997120+00:00","updated_at":"2026-07-05T03:02:56.997120+00:00"}