{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TCZGKYRWL6INTFQNHLOZORQKDV","short_pith_number":"pith:TCZGKYRW","schema_version":"1.0","canonical_sha256":"98b26562365f90d9960d3add97460a1d5dfbca5f146b90f9f7740a154cc25804","source":{"kind":"arxiv","id":"2504.07410","version":1},"attestation_state":"computed","paper":{"title":"Distributing graph states with a photon-weaving quantum server","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Bhatti, Kenneth Goodenough","submitted_at":"2025-04-10T03:03:14Z","abstract_excerpt":"One of the key aims of quantum networks is the efficient distribution of multipartite entangled states among end users. While various architectures have been proposed, each comes with distinct advantages and limitations. Many designs depend on long-lived quantum memories and deterministic gates, which, while powerful, introduce considerable cost and technical challenges. Experimentally cheaper alternatives that circumvent these constraints are often limited to specific types of entanglement and a specific number of users. Here, we present an experiment-friendly quantum server that relies only "},"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":"2504.07410","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-04-10T03:03:14Z","cross_cats_sorted":[],"title_canon_sha256":"252ab9387b4bc64ec0d5e1e756081fdc50a799bbedd1fa147e12f52c5aa1a591","abstract_canon_sha256":"8199c3daffb15f53f8005256ec52a19141998da917227cc9400b16a4d0cd4f77"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:47:08.580014Z","signature_b64":"N+9PP+WSihtXE4O8Q3Mtg4qUiia/XHxkZZJAsNcNeViI5SwBDeCvX1PHSkMH3YncsjN2m4+UsJ0BDStWUEaNDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98b26562365f90d9960d3add97460a1d5dfbca5f146b90f9f7740a154cc25804","last_reissued_at":"2026-07-05T10:47:08.579549Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:47:08.579549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributing graph states with a photon-weaving quantum server","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Bhatti, Kenneth Goodenough","submitted_at":"2025-04-10T03:03:14Z","abstract_excerpt":"One of the key aims of quantum networks is the efficient distribution of multipartite entangled states among end users. While various architectures have been proposed, each comes with distinct advantages and limitations. Many designs depend on long-lived quantum memories and deterministic gates, which, while powerful, introduce considerable cost and technical challenges. Experimentally cheaper alternatives that circumvent these constraints are often limited to specific types of entanglement and a specific number of users. Here, we present an experiment-friendly quantum server that relies only "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.07410","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/2504.07410/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":"2504.07410","created_at":"2026-07-05T10:47:08.579606+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.07410v1","created_at":"2026-07-05T10:47:08.579606+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.07410","created_at":"2026-07-05T10:47:08.579606+00:00"},{"alias_kind":"pith_short_12","alias_value":"TCZGKYRWL6IN","created_at":"2026-07-05T10:47:08.579606+00:00"},{"alias_kind":"pith_short_16","alias_value":"TCZGKYRWL6INTFQN","created_at":"2026-07-05T10:47:08.579606+00:00"},{"alias_kind":"pith_short_8","alias_value":"TCZGKYRW","created_at":"2026-07-05T10:47:08.579606+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.15029","citing_title":"A Resource-Driven Framework for Configurable Entanglement in Quantum Networks","ref_index":45,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TCZGKYRWL6INTFQNHLOZORQKDV","json":"https://pith.science/pith/TCZGKYRWL6INTFQNHLOZORQKDV.json","graph_json":"https://pith.science/api/pith-number/TCZGKYRWL6INTFQNHLOZORQKDV/graph.json","events_json":"https://pith.science/api/pith-number/TCZGKYRWL6INTFQNHLOZORQKDV/events.json","paper":"https://pith.science/paper/TCZGKYRW"},"agent_actions":{"view_html":"https://pith.science/pith/TCZGKYRWL6INTFQNHLOZORQKDV","download_json":"https://pith.science/pith/TCZGKYRWL6INTFQNHLOZORQKDV.json","view_paper":"https://pith.science/paper/TCZGKYRW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.07410&json=true","fetch_graph":"https://pith.science/api/pith-number/TCZGKYRWL6INTFQNHLOZORQKDV/graph.json","fetch_events":"https://pith.science/api/pith-number/TCZGKYRWL6INTFQNHLOZORQKDV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TCZGKYRWL6INTFQNHLOZORQKDV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TCZGKYRWL6INTFQNHLOZORQKDV/action/storage_attestation","attest_author":"https://pith.science/pith/TCZGKYRWL6INTFQNHLOZORQKDV/action/author_attestation","sign_citation":"https://pith.science/pith/TCZGKYRWL6INTFQNHLOZORQKDV/action/citation_signature","submit_replication":"https://pith.science/pith/TCZGKYRWL6INTFQNHLOZORQKDV/action/replication_record"}},"created_at":"2026-07-05T10:47:08.579606+00:00","updated_at":"2026-07-05T10:47:08.579606+00:00"}