{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ZOFPII723OB3AYJXBILERM46HO","short_pith_number":"pith:ZOFPII72","schema_version":"1.0","canonical_sha256":"cb8af423fadb83b061370a1648b39e3b8cfa3e8002223634133a7f3d552b6e2c","source":{"kind":"arxiv","id":"2304.12673","version":1},"attestation_state":"computed","paper":{"title":"Tools for the analysis of quantum protocols requiring state generation within a time window","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"quant-ph","authors_text":"Bethany Davies, Gayane Vardoyan, Stephanie Wehner, Thomas Beauchamp","submitted_at":"2023-04-25T09:22:16Z","abstract_excerpt":"Quantum protocols commonly require a certain number of quantum resource states to be available simultaneously. An important class of examples is quantum network protocols that require a certain number of entangled pairs. Here, we consider a setting in which a process generates a quantum resource state with some probability $p$ in each time step, and stores it in a quantum memory that is subject to time-dependent noise. To maintain sufficient quality for an application, each resource state is discarded from the memory after $w$ time steps. Let $s$ be the number of desired resource states requir"},"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":"2304.12673","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-04-25T09:22:16Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"799d69a920513e558d46333db5c880b5907d80a99cff1ec913cc3ec4d6ab0e31","abstract_canon_sha256":"f8acf89f6eb2e99227419064b688ff1bd8dde0ea9a25a339c4a6378031c8ea38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:04:19.509269Z","signature_b64":"8eK+rvp4BhtGENhm2Sa5BOQ4x8TUbyYIdAca13cwhV9/crBmnEGO7mnoiurr7AebcyXuFRC/lkOI6bPA+/HtBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb8af423fadb83b061370a1648b39e3b8cfa3e8002223634133a7f3d552b6e2c","last_reissued_at":"2026-07-05T06:04:19.508787Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:04:19.508787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tools for the analysis of quantum protocols requiring state generation within a time window","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"quant-ph","authors_text":"Bethany Davies, Gayane Vardoyan, Stephanie Wehner, Thomas Beauchamp","submitted_at":"2023-04-25T09:22:16Z","abstract_excerpt":"Quantum protocols commonly require a certain number of quantum resource states to be available simultaneously. An important class of examples is quantum network protocols that require a certain number of entangled pairs. Here, we consider a setting in which a process generates a quantum resource state with some probability $p$ in each time step, and stores it in a quantum memory that is subject to time-dependent noise. To maintain sufficient quality for an application, each resource state is discarded from the memory after $w$ time steps. Let $s$ be the number of desired resource states requir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.12673","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/2304.12673/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":"2304.12673","created_at":"2026-07-05T06:04:19.508860+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.12673v1","created_at":"2026-07-05T06:04:19.508860+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.12673","created_at":"2026-07-05T06:04:19.508860+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZOFPII723OB3","created_at":"2026-07-05T06:04:19.508860+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZOFPII723OB3AYJX","created_at":"2026-07-05T06:04:19.508860+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZOFPII72","created_at":"2026-07-05T06:04:19.508860+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.05650","citing_title":"Verifiable blind quantum computing: Comparative analysis and design considerations for client architectures","ref_index":50,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZOFPII723OB3AYJXBILERM46HO","json":"https://pith.science/pith/ZOFPII723OB3AYJXBILERM46HO.json","graph_json":"https://pith.science/api/pith-number/ZOFPII723OB3AYJXBILERM46HO/graph.json","events_json":"https://pith.science/api/pith-number/ZOFPII723OB3AYJXBILERM46HO/events.json","paper":"https://pith.science/paper/ZOFPII72"},"agent_actions":{"view_html":"https://pith.science/pith/ZOFPII723OB3AYJXBILERM46HO","download_json":"https://pith.science/pith/ZOFPII723OB3AYJXBILERM46HO.json","view_paper":"https://pith.science/paper/ZOFPII72","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.12673&json=true","fetch_graph":"https://pith.science/api/pith-number/ZOFPII723OB3AYJXBILERM46HO/graph.json","fetch_events":"https://pith.science/api/pith-number/ZOFPII723OB3AYJXBILERM46HO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZOFPII723OB3AYJXBILERM46HO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZOFPII723OB3AYJXBILERM46HO/action/storage_attestation","attest_author":"https://pith.science/pith/ZOFPII723OB3AYJXBILERM46HO/action/author_attestation","sign_citation":"https://pith.science/pith/ZOFPII723OB3AYJXBILERM46HO/action/citation_signature","submit_replication":"https://pith.science/pith/ZOFPII723OB3AYJXBILERM46HO/action/replication_record"}},"created_at":"2026-07-05T06:04:19.508860+00:00","updated_at":"2026-07-05T06:04:19.508860+00:00"}