{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:C5XXGO3G4UJ4GC7RVSO7P43E5Y","short_pith_number":"pith:C5XXGO3G","schema_version":"1.0","canonical_sha256":"176f733b66e513c30bf1ac9df7f364ee3f94efde34137c6d8efa926eb744a231","source":{"kind":"arxiv","id":"2410.21258","version":2},"attestation_state":"computed","paper":{"title":"Provable quantum speedups for computing persistence in topological data analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LG"],"primary_cat":"quant-ph","authors_text":"Alexander Schmidhuber, Casper Gyurik, Robbie King, Ryu Hayakawa, Vedran Dunjko","submitted_at":"2024-10-28T17:54:43Z","abstract_excerpt":"Topological data analysis (TDA) aims to extract noise-robust features from a data set by examining the number and persistence of holes in its topology. We provide an efficient quantum algorithm for a computational problem closely related to a core task in TDA -- determining whether a given hole persists across different length scales. Further, we prove the problem itself is $\\mathsf{BQP}_1$-hard, implying that a classical solution is extremely unlikely; this stands in contrast to all previous quantum approaches to TDA, where the problems were also intractable for quantum computers, or where a "},"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":"2410.21258","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-10-28T17:54:43Z","cross_cats_sorted":["cs.CC","cs.LG"],"title_canon_sha256":"9f2c8923b18c9c5aafd450aa6a41c6d8c206f94a4d8eaf00b630cd81fce87e5b","abstract_canon_sha256":"035d3bce9f3bffc84477b5d72e7a046c6af3e9a7842466e0a6416c2c14e5820d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:11:09.021521Z","signature_b64":"jq+t4obV4A7RDGB1F6OXqOwTDy1ZabHYehGzQNkkjj8/NHQQrsyHcIspx9DBzJice0HoG3tnY/yTPO7hxhKlCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"176f733b66e513c30bf1ac9df7f364ee3f94efde34137c6d8efa926eb744a231","last_reissued_at":"2026-06-19T16:11:09.021026Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:11:09.021026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Provable quantum speedups for computing persistence in topological data analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LG"],"primary_cat":"quant-ph","authors_text":"Alexander Schmidhuber, Casper Gyurik, Robbie King, Ryu Hayakawa, Vedran Dunjko","submitted_at":"2024-10-28T17:54:43Z","abstract_excerpt":"Topological data analysis (TDA) aims to extract noise-robust features from a data set by examining the number and persistence of holes in its topology. We provide an efficient quantum algorithm for a computational problem closely related to a core task in TDA -- determining whether a given hole persists across different length scales. Further, we prove the problem itself is $\\mathsf{BQP}_1$-hard, implying that a classical solution is extremely unlikely; this stands in contrast to all previous quantum approaches to TDA, where the problems were also intractable for quantum computers, or where a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.21258","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/2410.21258/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":"2410.21258","created_at":"2026-06-19T16:11:09.021085+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.21258v2","created_at":"2026-06-19T16:11:09.021085+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.21258","created_at":"2026-06-19T16:11:09.021085+00:00"},{"alias_kind":"pith_short_12","alias_value":"C5XXGO3G4UJ4","created_at":"2026-06-19T16:11:09.021085+00:00"},{"alias_kind":"pith_short_16","alias_value":"C5XXGO3G4UJ4GC7R","created_at":"2026-06-19T16:11:09.021085+00:00"},{"alias_kind":"pith_short_8","alias_value":"C5XXGO3G","created_at":"2026-06-19T16:11:09.021085+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2506.01432","citing_title":"New aspects of quantum topological data analysis: Betti number estimation, and testing and tracking of homology and cohomology classes","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"2512.00751","citing_title":"Fragmentation is Efficiently Learnable by Quantum Neural Networks","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C5XXGO3G4UJ4GC7RVSO7P43E5Y","json":"https://pith.science/pith/C5XXGO3G4UJ4GC7RVSO7P43E5Y.json","graph_json":"https://pith.science/api/pith-number/C5XXGO3G4UJ4GC7RVSO7P43E5Y/graph.json","events_json":"https://pith.science/api/pith-number/C5XXGO3G4UJ4GC7RVSO7P43E5Y/events.json","paper":"https://pith.science/paper/C5XXGO3G"},"agent_actions":{"view_html":"https://pith.science/pith/C5XXGO3G4UJ4GC7RVSO7P43E5Y","download_json":"https://pith.science/pith/C5XXGO3G4UJ4GC7RVSO7P43E5Y.json","view_paper":"https://pith.science/paper/C5XXGO3G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.21258&json=true","fetch_graph":"https://pith.science/api/pith-number/C5XXGO3G4UJ4GC7RVSO7P43E5Y/graph.json","fetch_events":"https://pith.science/api/pith-number/C5XXGO3G4UJ4GC7RVSO7P43E5Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C5XXGO3G4UJ4GC7RVSO7P43E5Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C5XXGO3G4UJ4GC7RVSO7P43E5Y/action/storage_attestation","attest_author":"https://pith.science/pith/C5XXGO3G4UJ4GC7RVSO7P43E5Y/action/author_attestation","sign_citation":"https://pith.science/pith/C5XXGO3G4UJ4GC7RVSO7P43E5Y/action/citation_signature","submit_replication":"https://pith.science/pith/C5XXGO3G4UJ4GC7RVSO7P43E5Y/action/replication_record"}},"created_at":"2026-06-19T16:11:09.021085+00:00","updated_at":"2026-06-19T16:11:09.021085+00:00"}