{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:SVSJVDMGWR7JBZQMVODG4OHVQT","short_pith_number":"pith:SVSJVDMG","schema_version":"1.0","canonical_sha256":"95649a8d86b47e90e60cab866e38f584ce269f7b7fe7afc1c496cf12c7fb8c0d","source":{"kind":"arxiv","id":"2103.03266","version":1},"attestation_state":"computed","paper":{"title":"Robustness of Noisy Quantum Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Bruno C. Coutinho, Kae Nemoto, William J. Munro, Yasser Omar","submitted_at":"2021-03-04T19:01:49Z","abstract_excerpt":"Quantum networks are a new paradigm of complex networks, allowing us to harness networked quantum technologies and to develop a quantum internet. But how robust is a quantum network when its links and nodes start failing? We show that quantum networks based on typical noisy quantum-repeater nodes are prone to discontinuous phase transitions with respect to the random loss of operating links and nodes, abruptly compromising the connectivity of the network, and thus significantly limiting the reach of its operation. Furthermore, we determine the critical quantum-repeater efficiency necessary to "},"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":"2103.03266","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-03-04T19:01:49Z","cross_cats_sorted":["cond-mat.dis-nn","math-ph","math.MP"],"title_canon_sha256":"ab2bc1242b26df6d21df28cf97cbe22bc23faa0584fc3a00f054a48a99825f10","abstract_canon_sha256":"a93a81468f15b4206181f83225cd0ff609cf0fb3175ecc214bb8964618c4574d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:46:22.985627Z","signature_b64":"RdG1/4r/aWeeqTRZ/E2Nzlx5eC/IbGJNxSJ0WleZQapcejC92RT2PHVK8rg2uKyNqBl6UvQPtLwgkAvL88oNCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95649a8d86b47e90e60cab866e38f584ce269f7b7fe7afc1c496cf12c7fb8c0d","last_reissued_at":"2026-07-05T04:46:22.985136Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:46:22.985136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robustness of Noisy Quantum Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Bruno C. Coutinho, Kae Nemoto, William J. Munro, Yasser Omar","submitted_at":"2021-03-04T19:01:49Z","abstract_excerpt":"Quantum networks are a new paradigm of complex networks, allowing us to harness networked quantum technologies and to develop a quantum internet. But how robust is a quantum network when its links and nodes start failing? We show that quantum networks based on typical noisy quantum-repeater nodes are prone to discontinuous phase transitions with respect to the random loss of operating links and nodes, abruptly compromising the connectivity of the network, and thus significantly limiting the reach of its operation. Furthermore, we determine the critical quantum-repeater efficiency necessary to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.03266","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/2103.03266/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":"2103.03266","created_at":"2026-07-05T04:46:22.985186+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.03266v1","created_at":"2026-07-05T04:46:22.985186+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.03266","created_at":"2026-07-05T04:46:22.985186+00:00"},{"alias_kind":"pith_short_12","alias_value":"SVSJVDMGWR7J","created_at":"2026-07-05T04:46:22.985186+00:00"},{"alias_kind":"pith_short_16","alias_value":"SVSJVDMGWR7JBZQM","created_at":"2026-07-05T04:46:22.985186+00:00"},{"alias_kind":"pith_short_8","alias_value":"SVSJVDMG","created_at":"2026-07-05T04:46:22.985186+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.04252","citing_title":"A resource- and computationally-efficient protocol for multipartite entanglement distribution in Bell-pair networks","ref_index":82,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SVSJVDMGWR7JBZQMVODG4OHVQT","json":"https://pith.science/pith/SVSJVDMGWR7JBZQMVODG4OHVQT.json","graph_json":"https://pith.science/api/pith-number/SVSJVDMGWR7JBZQMVODG4OHVQT/graph.json","events_json":"https://pith.science/api/pith-number/SVSJVDMGWR7JBZQMVODG4OHVQT/events.json","paper":"https://pith.science/paper/SVSJVDMG"},"agent_actions":{"view_html":"https://pith.science/pith/SVSJVDMGWR7JBZQMVODG4OHVQT","download_json":"https://pith.science/pith/SVSJVDMGWR7JBZQMVODG4OHVQT.json","view_paper":"https://pith.science/paper/SVSJVDMG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.03266&json=true","fetch_graph":"https://pith.science/api/pith-number/SVSJVDMGWR7JBZQMVODG4OHVQT/graph.json","fetch_events":"https://pith.science/api/pith-number/SVSJVDMGWR7JBZQMVODG4OHVQT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SVSJVDMGWR7JBZQMVODG4OHVQT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SVSJVDMGWR7JBZQMVODG4OHVQT/action/storage_attestation","attest_author":"https://pith.science/pith/SVSJVDMGWR7JBZQMVODG4OHVQT/action/author_attestation","sign_citation":"https://pith.science/pith/SVSJVDMGWR7JBZQMVODG4OHVQT/action/citation_signature","submit_replication":"https://pith.science/pith/SVSJVDMGWR7JBZQMVODG4OHVQT/action/replication_record"}},"created_at":"2026-07-05T04:46:22.985186+00:00","updated_at":"2026-07-05T04:46:22.985186+00:00"}