{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:5KC3PP6K4V7UIVVLACJA5CZ5Z7","short_pith_number":"pith:5KC3PP6K","schema_version":"1.0","canonical_sha256":"ea85b7bfcae57f4456ab00920e8b3dcfd6dfec4a09012309d50919f8157d5573","source":{"kind":"arxiv","id":"2606.18808","version":1},"attestation_state":"computed","paper":{"title":"Efficient simulation of noisy entanglement generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alessandro Caraceni, Enrico Prati, Federico Grasselli, Lorenzo Brevi, Massimiliano Dispenza, Massimiliano Proietti","submitted_at":"2026-06-17T08:24:45Z","abstract_excerpt":"End-to-end entanglement distribution is a key capability of upcoming quantum networks, enabling applications like distributed quantum computing, quantum sensor networks, and secure communications. Hence, its realistic and efficient simulation is crucial for quantum network design and for assessing the ability of a network to run certain applications. This work provides tools to scale-up and improve the realism of entanglement generation simulations in quantum networks. This is achieved by deriving analytical results that directly return the success probability, the output state and correspondi"},"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":"2606.18808","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-06-17T08:24:45Z","cross_cats_sorted":[],"title_canon_sha256":"58a6cf02769a44b2946bfaa66f386b51636af8e1fecc04894a4786dc1cd08f30","abstract_canon_sha256":"23978d88cc983e10c98e9f270a6eb4263e5eb6d9c2fccf47c7c06ab73d32ecb9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:11:48.112335Z","signature_b64":"kmt5AebHq3wgGV/M6O8GX58ECIOF3XIfX2OsWYBHhgVX938MXLQ0A05N6Hhbo1rz6zr6aAYOEYkFP6AyTRaeAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea85b7bfcae57f4456ab00920e8b3dcfd6dfec4a09012309d50919f8157d5573","last_reissued_at":"2026-06-19T16:11:48.111931Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:11:48.111931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient simulation of noisy entanglement generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alessandro Caraceni, Enrico Prati, Federico Grasselli, Lorenzo Brevi, Massimiliano Dispenza, Massimiliano Proietti","submitted_at":"2026-06-17T08:24:45Z","abstract_excerpt":"End-to-end entanglement distribution is a key capability of upcoming quantum networks, enabling applications like distributed quantum computing, quantum sensor networks, and secure communications. Hence, its realistic and efficient simulation is crucial for quantum network design and for assessing the ability of a network to run certain applications. This work provides tools to scale-up and improve the realism of entanglement generation simulations in quantum networks. This is achieved by deriving analytical results that directly return the success probability, the output state and correspondi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.18808","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/2606.18808/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":"2606.18808","created_at":"2026-06-19T16:11:48.112000+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.18808v1","created_at":"2026-06-19T16:11:48.112000+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.18808","created_at":"2026-06-19T16:11:48.112000+00:00"},{"alias_kind":"pith_short_12","alias_value":"5KC3PP6K4V7U","created_at":"2026-06-19T16:11:48.112000+00:00"},{"alias_kind":"pith_short_16","alias_value":"5KC3PP6K4V7UIVVL","created_at":"2026-06-19T16:11:48.112000+00:00"},{"alias_kind":"pith_short_8","alias_value":"5KC3PP6K","created_at":"2026-06-19T16:11:48.112000+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/5KC3PP6K4V7UIVVLACJA5CZ5Z7","json":"https://pith.science/pith/5KC3PP6K4V7UIVVLACJA5CZ5Z7.json","graph_json":"https://pith.science/api/pith-number/5KC3PP6K4V7UIVVLACJA5CZ5Z7/graph.json","events_json":"https://pith.science/api/pith-number/5KC3PP6K4V7UIVVLACJA5CZ5Z7/events.json","paper":"https://pith.science/paper/5KC3PP6K"},"agent_actions":{"view_html":"https://pith.science/pith/5KC3PP6K4V7UIVVLACJA5CZ5Z7","download_json":"https://pith.science/pith/5KC3PP6K4V7UIVVLACJA5CZ5Z7.json","view_paper":"https://pith.science/paper/5KC3PP6K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.18808&json=true","fetch_graph":"https://pith.science/api/pith-number/5KC3PP6K4V7UIVVLACJA5CZ5Z7/graph.json","fetch_events":"https://pith.science/api/pith-number/5KC3PP6K4V7UIVVLACJA5CZ5Z7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5KC3PP6K4V7UIVVLACJA5CZ5Z7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5KC3PP6K4V7UIVVLACJA5CZ5Z7/action/storage_attestation","attest_author":"https://pith.science/pith/5KC3PP6K4V7UIVVLACJA5CZ5Z7/action/author_attestation","sign_citation":"https://pith.science/pith/5KC3PP6K4V7UIVVLACJA5CZ5Z7/action/citation_signature","submit_replication":"https://pith.science/pith/5KC3PP6K4V7UIVVLACJA5CZ5Z7/action/replication_record"}},"created_at":"2026-06-19T16:11:48.112000+00:00","updated_at":"2026-06-19T16:11:48.112000+00:00"}