{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:H5VLGSEX7XMR7A2CQRIQ7SZTS3","short_pith_number":"pith:H5VLGSEX","schema_version":"1.0","canonical_sha256":"3f6ab34897fdd91f834284510fcb3396e19caff5a48fdd88e3cf02e036bd02a1","source":{"kind":"arxiv","id":"2407.05178","version":1},"attestation_state":"computed","paper":{"title":"A typology of quantum algorithms","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Evi Kasnetsi, Pablo Arnault, Pablo Arrighi, Steven Herbert, Tianyi Li","submitted_at":"2024-07-06T20:41:05Z","abstract_excerpt":"We draw the current landscape of quantum algorithms, by classifying about 130 quantum algorithms, according to the fundamental mathematical problems they solve, their real-world applications, the main subroutines they employ, and several other relevant criteria. The primary objectives include revealing trends of algorithms, identifying promising fields for implementations in the NISQ era, and identifying the key algorithmic primitives that power quantum advantage."},"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":"2407.05178","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2024-07-06T20:41:05Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"62d10ec8579cd6388ab91a17dd203caeb7709b7ea784f2c94ae2f9ea8256f7f5","abstract_canon_sha256":"0ff575bf734c732f3f0cf8f469c1a81806cb3c026653e6cf5f8525bd1e2534df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:32:28.024518Z","signature_b64":"tXW2+vyW67ImI3vGmmWeNikKRlkysLCQ9JdUo+0Aq1diKKeqyFHOojducIbobRfbkiW1YFwX0H2yGTkOEvr2CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f6ab34897fdd91f834284510fcb3396e19caff5a48fdd88e3cf02e036bd02a1","last_reissued_at":"2026-07-05T10:32:28.023958Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:32:28.023958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A typology of quantum algorithms","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Evi Kasnetsi, Pablo Arnault, Pablo Arrighi, Steven Herbert, Tianyi Li","submitted_at":"2024-07-06T20:41:05Z","abstract_excerpt":"We draw the current landscape of quantum algorithms, by classifying about 130 quantum algorithms, according to the fundamental mathematical problems they solve, their real-world applications, the main subroutines they employ, and several other relevant criteria. The primary objectives include revealing trends of algorithms, identifying promising fields for implementations in the NISQ era, and identifying the key algorithmic primitives that power quantum advantage."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.05178","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2407.05178/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":"2407.05178","created_at":"2026-07-05T10:32:28.024020+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.05178v1","created_at":"2026-07-05T10:32:28.024020+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.05178","created_at":"2026-07-05T10:32:28.024020+00:00"},{"alias_kind":"pith_short_12","alias_value":"H5VLGSEX7XMR","created_at":"2026-07-05T10:32:28.024020+00:00"},{"alias_kind":"pith_short_16","alias_value":"H5VLGSEX7XMR7A2C","created_at":"2026-07-05T10:32:28.024020+00:00"},{"alias_kind":"pith_short_8","alias_value":"H5VLGSEX","created_at":"2026-07-05T10:32:28.024020+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2511.21225","citing_title":"Phase Estimation with Compressed Controlled Time Evolution","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2605.13279","citing_title":"Robust Mutation Analysis of Quantum Programs Under Noise","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01800","citing_title":"Quantum Software Architecture Framework (QSAF): A Component-Based Framework for Designing Hybrid Quantum-Classical Systems","ref_index":43,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H5VLGSEX7XMR7A2CQRIQ7SZTS3","json":"https://pith.science/pith/H5VLGSEX7XMR7A2CQRIQ7SZTS3.json","graph_json":"https://pith.science/api/pith-number/H5VLGSEX7XMR7A2CQRIQ7SZTS3/graph.json","events_json":"https://pith.science/api/pith-number/H5VLGSEX7XMR7A2CQRIQ7SZTS3/events.json","paper":"https://pith.science/paper/H5VLGSEX"},"agent_actions":{"view_html":"https://pith.science/pith/H5VLGSEX7XMR7A2CQRIQ7SZTS3","download_json":"https://pith.science/pith/H5VLGSEX7XMR7A2CQRIQ7SZTS3.json","view_paper":"https://pith.science/paper/H5VLGSEX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.05178&json=true","fetch_graph":"https://pith.science/api/pith-number/H5VLGSEX7XMR7A2CQRIQ7SZTS3/graph.json","fetch_events":"https://pith.science/api/pith-number/H5VLGSEX7XMR7A2CQRIQ7SZTS3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H5VLGSEX7XMR7A2CQRIQ7SZTS3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H5VLGSEX7XMR7A2CQRIQ7SZTS3/action/storage_attestation","attest_author":"https://pith.science/pith/H5VLGSEX7XMR7A2CQRIQ7SZTS3/action/author_attestation","sign_citation":"https://pith.science/pith/H5VLGSEX7XMR7A2CQRIQ7SZTS3/action/citation_signature","submit_replication":"https://pith.science/pith/H5VLGSEX7XMR7A2CQRIQ7SZTS3/action/replication_record"}},"created_at":"2026-07-05T10:32:28.024020+00:00","updated_at":"2026-07-05T10:32:28.024020+00:00"}