{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:2Z45NBDCTXNDP3SXONAE6RJDRR","short_pith_number":"pith:2Z45NBDC","schema_version":"1.0","canonical_sha256":"d679d684629dda37ee5773404f45238c6d1c5ba45baa75402b8bab54d65ee342","source":{"kind":"arxiv","id":"2502.20240","version":1},"attestation_state":"computed","paper":{"title":"Entanglement buffering with multiple quantum memories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"quant-ph","authors_text":"\\'Alvaro G. I\\~nesta, Bethany Davies, Sounak Kar, Stephanie Wehner","submitted_at":"2025-02-27T16:25:43Z","abstract_excerpt":"Entanglement buffers are systems that maintain high-quality entanglement, ensuring it is readily available for consumption when needed. In this work, we study the performance of a two-node buffer, where each node has one long-lived quantum memory for storing entanglement and multiple short-lived memories for generating fresh entanglement. Newly generated entanglement may be used to purify the stored entanglement, which degrades over time. Stored entanglement may be removed due to failed purification or consumption. We derive analytical expressions for the system performance, which is measured "},"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":"2502.20240","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-02-27T16:25:43Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"04c1606aaef0bdf7507cff2bd55d26bcba4239d9fa1da0594ce0c067a5b4ec3b","abstract_canon_sha256":"7f53f55957e5487abd16b0eb865c8fdadc2fd22230043d6b65a96f0c6dc00f69"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:21:11.591568Z","signature_b64":"9/SOS+1cBzYoHdEeWY4StAfWRoEz6+l1n8ViWGuL4PX9iUWptbsiGhds7TPaWJ6yUGgqyavjF/KOOrdIQdcqDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d679d684629dda37ee5773404f45238c6d1c5ba45baa75402b8bab54d65ee342","last_reissued_at":"2026-07-05T10:21:11.590998Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:21:11.590998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Entanglement buffering with multiple quantum memories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"quant-ph","authors_text":"\\'Alvaro G. I\\~nesta, Bethany Davies, Sounak Kar, Stephanie Wehner","submitted_at":"2025-02-27T16:25:43Z","abstract_excerpt":"Entanglement buffers are systems that maintain high-quality entanglement, ensuring it is readily available for consumption when needed. In this work, we study the performance of a two-node buffer, where each node has one long-lived quantum memory for storing entanglement and multiple short-lived memories for generating fresh entanglement. Newly generated entanglement may be used to purify the stored entanglement, which degrades over time. Stored entanglement may be removed due to failed purification or consumption. We derive analytical expressions for the system performance, which is measured "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.20240","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/2502.20240/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":"2502.20240","created_at":"2026-07-05T10:21:11.591076+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.20240v1","created_at":"2026-07-05T10:21:11.591076+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.20240","created_at":"2026-07-05T10:21:11.591076+00:00"},{"alias_kind":"pith_short_12","alias_value":"2Z45NBDCTXND","created_at":"2026-07-05T10:21:11.591076+00:00"},{"alias_kind":"pith_short_16","alias_value":"2Z45NBDCTXNDP3SX","created_at":"2026-07-05T10:21:11.591076+00:00"},{"alias_kind":"pith_short_8","alias_value":"2Z45NBDC","created_at":"2026-07-05T10:21:11.591076+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.22316","citing_title":"Making Quantum Networks Work: Routing, Calibration, and Programmable Quantum Repeaters","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2606.18167","citing_title":"Optimal Calibration of Quantum Network Links","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2Z45NBDCTXNDP3SXONAE6RJDRR","json":"https://pith.science/pith/2Z45NBDCTXNDP3SXONAE6RJDRR.json","graph_json":"https://pith.science/api/pith-number/2Z45NBDCTXNDP3SXONAE6RJDRR/graph.json","events_json":"https://pith.science/api/pith-number/2Z45NBDCTXNDP3SXONAE6RJDRR/events.json","paper":"https://pith.science/paper/2Z45NBDC"},"agent_actions":{"view_html":"https://pith.science/pith/2Z45NBDCTXNDP3SXONAE6RJDRR","download_json":"https://pith.science/pith/2Z45NBDCTXNDP3SXONAE6RJDRR.json","view_paper":"https://pith.science/paper/2Z45NBDC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.20240&json=true","fetch_graph":"https://pith.science/api/pith-number/2Z45NBDCTXNDP3SXONAE6RJDRR/graph.json","fetch_events":"https://pith.science/api/pith-number/2Z45NBDCTXNDP3SXONAE6RJDRR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2Z45NBDCTXNDP3SXONAE6RJDRR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2Z45NBDCTXNDP3SXONAE6RJDRR/action/storage_attestation","attest_author":"https://pith.science/pith/2Z45NBDCTXNDP3SXONAE6RJDRR/action/author_attestation","sign_citation":"https://pith.science/pith/2Z45NBDCTXNDP3SXONAE6RJDRR/action/citation_signature","submit_replication":"https://pith.science/pith/2Z45NBDCTXNDP3SXONAE6RJDRR/action/replication_record"}},"created_at":"2026-07-05T10:21:11.591076+00:00","updated_at":"2026-07-05T10:21:11.591076+00:00"}