{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:R3JCTAD46O2IH7ZSJJXBBVJ5ZI","short_pith_number":"pith:R3JCTAD4","schema_version":"1.0","canonical_sha256":"8ed229807cf3b483ff324a6e10d53dca3be2d8077a48b3663f175b45b0e70122","source":{"kind":"arxiv","id":"2605.28795","version":1},"attestation_state":"computed","paper":{"title":"Dynamic Entanglement Packet Scheduling for Quantum Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"quant-ph","authors_text":"Andrea Passarella, Claudio Cicconetti, Marco Conti, Quang-Phong Tran","submitted_at":"2026-05-27T17:51:30Z","abstract_excerpt":"Sharing entanglement among multiple users remains a central challenge for scalable quantum networks. Recent work proposed an on-demand entanglement packet architecture in which a controller uses a Time Division Multiple Access (TDMA) approach to allocate network resources. Quantum nodes are assigned a periodic schedule that probabilistically fulfills application requests for end-to-end entanglements. The schedule is recomputed periodically using well-known algorithms, such as Earliest Deadline First (EDF). However, a static schedule offers limited flexibility when outcomes are stochastic and a"},"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":"2605.28795","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-27T17:51:30Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"dc78441ad503a16dea43f5a273fd39e6d984018d1b4e57dae26529f1a571f850","abstract_canon_sha256":"4abac6e7c6da655869f5e0efaaaebd1238ab1f66b2baa5d9a393e6bc5706486e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T02:05:03.811875Z","signature_b64":"KJmqtmmNvukWtDv208YRso4/VJWGl1f0erq8v9yeAas4d198kPpuFf0MhMpiiw9qvm3Fdd8mGtby0fyYpYURAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ed229807cf3b483ff324a6e10d53dca3be2d8077a48b3663f175b45b0e70122","last_reissued_at":"2026-05-28T02:05:03.811477Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T02:05:03.811477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Entanglement Packet Scheduling for Quantum Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"quant-ph","authors_text":"Andrea Passarella, Claudio Cicconetti, Marco Conti, Quang-Phong Tran","submitted_at":"2026-05-27T17:51:30Z","abstract_excerpt":"Sharing entanglement among multiple users remains a central challenge for scalable quantum networks. Recent work proposed an on-demand entanglement packet architecture in which a controller uses a Time Division Multiple Access (TDMA) approach to allocate network resources. Quantum nodes are assigned a periodic schedule that probabilistically fulfills application requests for end-to-end entanglements. The schedule is recomputed periodically using well-known algorithms, such as Earliest Deadline First (EDF). However, a static schedule offers limited flexibility when outcomes are stochastic and a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.28795","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/2605.28795/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":"2605.28795","created_at":"2026-05-28T02:05:03.811541+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.28795v1","created_at":"2026-05-28T02:05:03.811541+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.28795","created_at":"2026-05-28T02:05:03.811541+00:00"},{"alias_kind":"pith_short_12","alias_value":"R3JCTAD46O2I","created_at":"2026-05-28T02:05:03.811541+00:00"},{"alias_kind":"pith_short_16","alias_value":"R3JCTAD46O2IH7ZS","created_at":"2026-05-28T02:05:03.811541+00:00"},{"alias_kind":"pith_short_8","alias_value":"R3JCTAD4","created_at":"2026-05-28T02:05:03.811541+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/R3JCTAD46O2IH7ZSJJXBBVJ5ZI","json":"https://pith.science/pith/R3JCTAD46O2IH7ZSJJXBBVJ5ZI.json","graph_json":"https://pith.science/api/pith-number/R3JCTAD46O2IH7ZSJJXBBVJ5ZI/graph.json","events_json":"https://pith.science/api/pith-number/R3JCTAD46O2IH7ZSJJXBBVJ5ZI/events.json","paper":"https://pith.science/paper/R3JCTAD4"},"agent_actions":{"view_html":"https://pith.science/pith/R3JCTAD46O2IH7ZSJJXBBVJ5ZI","download_json":"https://pith.science/pith/R3JCTAD46O2IH7ZSJJXBBVJ5ZI.json","view_paper":"https://pith.science/paper/R3JCTAD4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.28795&json=true","fetch_graph":"https://pith.science/api/pith-number/R3JCTAD46O2IH7ZSJJXBBVJ5ZI/graph.json","fetch_events":"https://pith.science/api/pith-number/R3JCTAD46O2IH7ZSJJXBBVJ5ZI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R3JCTAD46O2IH7ZSJJXBBVJ5ZI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R3JCTAD46O2IH7ZSJJXBBVJ5ZI/action/storage_attestation","attest_author":"https://pith.science/pith/R3JCTAD46O2IH7ZSJJXBBVJ5ZI/action/author_attestation","sign_citation":"https://pith.science/pith/R3JCTAD46O2IH7ZSJJXBBVJ5ZI/action/citation_signature","submit_replication":"https://pith.science/pith/R3JCTAD46O2IH7ZSJJXBBVJ5ZI/action/replication_record"}},"created_at":"2026-05-28T02:05:03.811541+00:00","updated_at":"2026-05-28T02:05:03.811541+00:00"}