{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:OX4RKDU5Q2LGAZ5TXKUSNE25OL","short_pith_number":"pith:OX4RKDU5","schema_version":"1.0","canonical_sha256":"75f9150e9d86966067b3baa926935d72c73d461c011201b307422bb7f58f2863","source":{"kind":"arxiv","id":"2209.14146","version":3},"attestation_state":"computed","paper":{"title":"Quantum Subroutine Composition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Stacey Jeffery","submitted_at":"2022-09-28T14:52:13Z","abstract_excerpt":"An important tool in algorithm design is the ability to build algorithms from other algorithms that run as subroutines. In the case of quantum algorithms, a subroutine may be called on a superposition of different inputs, which complicates things. For example, a classical algorithm that calls a subroutine $Q$ times, where the average probability of querying the subroutine on input $i$ is $p_i$, and the cost of the subroutine on input $i$ is $T_i$, incurs expected cost $Q\\sum_i p_i E[T_i]$ from all subroutine queries. While this statement is obvious for classical algorithms, for quantum algorit"},"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":"2209.14146","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-09-28T14:52:13Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"520f0983288ab9744ebab663c2e8ad15e48d731414d7b2524b810099258e9bdb","abstract_canon_sha256":"59b4d64e9a2e5d8566b8d39edd14d51a48a1ef98557d96fc7fe71be2b79d5eee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:13:36.130507Z","signature_b64":"jYBZ0pCLFYvTCk0IarlIMzYpz1xJBQSGDFTK+1zDZ+IZEbv7MtfcYzBXAaY0reIdMSl74VBO3OKkpLC8N6h8BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75f9150e9d86966067b3baa926935d72c73d461c011201b307422bb7f58f2863","last_reissued_at":"2026-07-05T10:13:36.129918Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:13:36.129918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Subroutine Composition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Stacey Jeffery","submitted_at":"2022-09-28T14:52:13Z","abstract_excerpt":"An important tool in algorithm design is the ability to build algorithms from other algorithms that run as subroutines. In the case of quantum algorithms, a subroutine may be called on a superposition of different inputs, which complicates things. For example, a classical algorithm that calls a subroutine $Q$ times, where the average probability of querying the subroutine on input $i$ is $p_i$, and the cost of the subroutine on input $i$ is $T_i$, incurs expected cost $Q\\sum_i p_i E[T_i]$ from all subroutine queries. While this statement is obvious for classical algorithms, for quantum algorit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.14146","kind":"arxiv","version":3},"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/2209.14146/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":"2209.14146","created_at":"2026-07-05T10:13:36.129977+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.14146v3","created_at":"2026-07-05T10:13:36.129977+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.14146","created_at":"2026-07-05T10:13:36.129977+00:00"},{"alias_kind":"pith_short_12","alias_value":"OX4RKDU5Q2LG","created_at":"2026-07-05T10:13:36.129977+00:00"},{"alias_kind":"pith_short_16","alias_value":"OX4RKDU5Q2LGAZ5T","created_at":"2026-07-05T10:13:36.129977+00:00"},{"alias_kind":"pith_short_8","alias_value":"OX4RKDU5","created_at":"2026-07-05T10:13:36.129977+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.05099","citing_title":"Quantum Time Lower Bounds by Permutation Invariance","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09017","citing_title":"Quantum algorithms for path and cycle containment problems","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OX4RKDU5Q2LGAZ5TXKUSNE25OL","json":"https://pith.science/pith/OX4RKDU5Q2LGAZ5TXKUSNE25OL.json","graph_json":"https://pith.science/api/pith-number/OX4RKDU5Q2LGAZ5TXKUSNE25OL/graph.json","events_json":"https://pith.science/api/pith-number/OX4RKDU5Q2LGAZ5TXKUSNE25OL/events.json","paper":"https://pith.science/paper/OX4RKDU5"},"agent_actions":{"view_html":"https://pith.science/pith/OX4RKDU5Q2LGAZ5TXKUSNE25OL","download_json":"https://pith.science/pith/OX4RKDU5Q2LGAZ5TXKUSNE25OL.json","view_paper":"https://pith.science/paper/OX4RKDU5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.14146&json=true","fetch_graph":"https://pith.science/api/pith-number/OX4RKDU5Q2LGAZ5TXKUSNE25OL/graph.json","fetch_events":"https://pith.science/api/pith-number/OX4RKDU5Q2LGAZ5TXKUSNE25OL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OX4RKDU5Q2LGAZ5TXKUSNE25OL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OX4RKDU5Q2LGAZ5TXKUSNE25OL/action/storage_attestation","attest_author":"https://pith.science/pith/OX4RKDU5Q2LGAZ5TXKUSNE25OL/action/author_attestation","sign_citation":"https://pith.science/pith/OX4RKDU5Q2LGAZ5TXKUSNE25OL/action/citation_signature","submit_replication":"https://pith.science/pith/OX4RKDU5Q2LGAZ5TXKUSNE25OL/action/replication_record"}},"created_at":"2026-07-05T10:13:36.129977+00:00","updated_at":"2026-07-05T10:13:36.129977+00:00"}