{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:KMQLDVTKX4GR42UNW62YMLQWVJ","short_pith_number":"pith:KMQLDVTK","schema_version":"1.0","canonical_sha256":"5320b1d66abf0d1e6a8db7b5862e16aa76cc055615132459f7a04bfd043ca1ee","source":{"kind":"arxiv","id":"2608.01467","version":1},"attestation_state":"computed","paper":{"title":"Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.ET","authors_text":"Erik M. {\\AA}sgrim, Frej Larssen, Ivy Peng, Luca Pennati, Stefano Markidis","submitted_at":"2026-08-02T20:01:59Z","abstract_excerpt":"We present a distributed method for exact sparse-output quantum circuit simulation based on the pure Feynman sum-over-histories formulation. The method computes selected computational-basis amplitudes exactly and addresses the exponential growth of the path sum through a reduced history formulation based on internal-wire assignments, determinism propagation, artificial sources, pruning, and checkpointed reuse. Boundary constraints are propagated through deterministic and wire-preserving gates, and explicit branching variables are introduced only where residual ambiguity remains. Shared work ac"},"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":"2608.01467","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2026-08-02T20:01:59Z","cross_cats_sorted":[],"title_canon_sha256":"accbbb497926c322fa8e39375ace80f0497c5c3e805986649a058463cbea0b88","abstract_canon_sha256":"36f225a6f59c700b47ebe083a31cc37b22095c14b5a2a65fd2fe36f916afec5a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-04T02:05:20.755168Z","signature_b64":"h4B2Lm9IefUgqFYlwm4FI73iW1B2N6HokmJ83QB9a0cJnZEJOuXYQTYlmgp9JeWuk9Qq/ZMHMmxbXpd9qfM+BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5320b1d66abf0d1e6a8db7b5862e16aa76cc055615132459f7a04bfd043ca1ee","last_reissued_at":"2026-08-04T02:05:20.753701Z","signature_status":"signed_v1","first_computed_at":"2026-08-04T02:05:20.753701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.ET","authors_text":"Erik M. {\\AA}sgrim, Frej Larssen, Ivy Peng, Luca Pennati, Stefano Markidis","submitted_at":"2026-08-02T20:01:59Z","abstract_excerpt":"We present a distributed method for exact sparse-output quantum circuit simulation based on the pure Feynman sum-over-histories formulation. The method computes selected computational-basis amplitudes exactly and addresses the exponential growth of the path sum through a reduced history formulation based on internal-wire assignments, determinism propagation, artificial sources, pruning, and checkpointed reuse. Boundary constraints are propagated through deterministic and wire-preserving gates, and explicit branching variables are introduced only where residual ambiguity remains. Shared work ac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.01467","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/2608.01467/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":"2608.01467","created_at":"2026-08-04T02:05:20.755129+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.01467v1","created_at":"2026-08-04T02:05:20.755129+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.01467","created_at":"2026-08-04T02:05:20.755129+00:00"},{"alias_kind":"pith_short_12","alias_value":"KMQLDVTKX4GR","created_at":"2026-08-04T02:05:20.755129+00:00"},{"alias_kind":"pith_short_16","alias_value":"KMQLDVTKX4GR42UN","created_at":"2026-08-04T02:05:20.755129+00:00"},{"alias_kind":"pith_short_8","alias_value":"KMQLDVTK","created_at":"2026-08-04T02:05:20.755129+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/KMQLDVTKX4GR42UNW62YMLQWVJ","json":"https://pith.science/pith/KMQLDVTKX4GR42UNW62YMLQWVJ.json","graph_json":"https://pith.science/api/pith-number/KMQLDVTKX4GR42UNW62YMLQWVJ/graph.json","events_json":"https://pith.science/api/pith-number/KMQLDVTKX4GR42UNW62YMLQWVJ/events.json","paper":"https://pith.science/paper/KMQLDVTK"},"agent_actions":{"view_html":"https://pith.science/pith/KMQLDVTKX4GR42UNW62YMLQWVJ","download_json":"https://pith.science/pith/KMQLDVTKX4GR42UNW62YMLQWVJ.json","view_paper":"https://pith.science/paper/KMQLDVTK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.01467&json=true","fetch_graph":"https://pith.science/api/pith-number/KMQLDVTKX4GR42UNW62YMLQWVJ/graph.json","fetch_events":"https://pith.science/api/pith-number/KMQLDVTKX4GR42UNW62YMLQWVJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KMQLDVTKX4GR42UNW62YMLQWVJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KMQLDVTKX4GR42UNW62YMLQWVJ/action/storage_attestation","attest_author":"https://pith.science/pith/KMQLDVTKX4GR42UNW62YMLQWVJ/action/author_attestation","sign_citation":"https://pith.science/pith/KMQLDVTKX4GR42UNW62YMLQWVJ/action/citation_signature","submit_replication":"https://pith.science/pith/KMQLDVTKX4GR42UNW62YMLQWVJ/action/replication_record"}},"created_at":"2026-08-04T02:05:20.755129+00:00","updated_at":"2026-08-04T02:05:20.755129+00:00"}