{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SWBXEYLNBHDLTK3RUMQFHQUMVI","short_pith_number":"pith:SWBXEYLN","canonical_record":{"source":{"id":"1801.02020","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-01-06T14:32:22Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"3ed08f1bc72f2456daf4391b84c009c7371bcd787229fcfa5511e3dd275a9de8","abstract_canon_sha256":"01f2573382f86579900e3e2f588e6610222fd95a45176b77e737687183699cc4"},"schema_version":"1.0"},"canonical_sha256":"958372616d09c6b9ab71a32053c28caa017b8af84c21b784db556cc38a4ff17c","source":{"kind":"arxiv","id":"1801.02020","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02020","created_at":"2026-05-18T00:07:28Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02020v3","created_at":"2026-05-18T00:07:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02020","created_at":"2026-05-18T00:07:28Z"},{"alias_kind":"pith_short_12","alias_value":"SWBXEYLNBHDL","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SWBXEYLNBHDLTK3R","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SWBXEYLN","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SWBXEYLNBHDLTK3RUMQFHQUMVI","target":"record","payload":{"canonical_record":{"source":{"id":"1801.02020","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-01-06T14:32:22Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"3ed08f1bc72f2456daf4391b84c009c7371bcd787229fcfa5511e3dd275a9de8","abstract_canon_sha256":"01f2573382f86579900e3e2f588e6610222fd95a45176b77e737687183699cc4"},"schema_version":"1.0"},"canonical_sha256":"958372616d09c6b9ab71a32053c28caa017b8af84c21b784db556cc38a4ff17c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:28.037977Z","signature_b64":"fjI0C+wm08osvxyqdgCA/jHlBSou3TJrzQPcn17y3CkuvzOzU+Z9J3dqS16jkhjfEodXsxvwhJlXI1OamVv9Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"958372616d09c6b9ab71a32053c28caa017b8af84c21b784db556cc38a4ff17c","last_reissued_at":"2026-05-18T00:07:28.037311Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:28.037311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.02020","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:07:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HJutfr9cQU1hCcyrIplgmO1fxtXHexkMABbSE92fDNWucgZj3CwFFsVXs7yPPWb17vh1s29kv93Z2mfxzg9WAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T20:45:29.698057Z"},"content_sha256":"d30db1f6475548dbc52033f8b6c0eeed0d80c9e79a34f9cc458e90e4583f8c88","schema_version":"1.0","event_id":"sha256:d30db1f6475548dbc52033f8b6c0eeed0d80c9e79a34f9cc458e90e4583f8c88"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SWBXEYLNBHDLTK3RUMQFHQUMVI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decentralized Base-Graph Routing for the Quantum Internet","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Laszlo Gyongyosi, Sandor Imre","submitted_at":"2018-01-06T14:32:22Z","abstract_excerpt":"Quantum repeater networks are a fundamental of any future quantum Internet and long-distance quantum communications. The entangled quantum nodes can communicate through several different levels of entanglement, leading to a heterogeneous, multi-level network structure. The level of entanglement between the quantum nodes determines the hop distance and the probability of the existence of an entangled link in the network. Here, we define a decentralized routing for entangled quantum networks. The proposed method allows an efficient routing to find the shortest paths in entangled quantum networks"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02020","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:07:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hvSLvCp+ydIcqv16OiYU6i3bW2uvuGi/3t4wwoKyteTCkMfln/t3Lgcu9KM6BwBYcXPrgW4S/nmVwPuJJ6RoDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T20:45:29.698453Z"},"content_sha256":"0f3e38b5d1fb87c74bc6be7fa4fa4781616054aad4c71a1116fedbbdcaa800cd","schema_version":"1.0","event_id":"sha256:0f3e38b5d1fb87c74bc6be7fa4fa4781616054aad4c71a1116fedbbdcaa800cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SWBXEYLNBHDLTK3RUMQFHQUMVI/bundle.json","state_url":"https://pith.science/pith/SWBXEYLNBHDLTK3RUMQFHQUMVI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SWBXEYLNBHDLTK3RUMQFHQUMVI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-24T20:45:29Z","links":{"resolver":"https://pith.science/pith/SWBXEYLNBHDLTK3RUMQFHQUMVI","bundle":"https://pith.science/pith/SWBXEYLNBHDLTK3RUMQFHQUMVI/bundle.json","state":"https://pith.science/pith/SWBXEYLNBHDLTK3RUMQFHQUMVI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SWBXEYLNBHDLTK3RUMQFHQUMVI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SWBXEYLNBHDLTK3RUMQFHQUMVI","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"01f2573382f86579900e3e2f588e6610222fd95a45176b77e737687183699cc4","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-01-06T14:32:22Z","title_canon_sha256":"3ed08f1bc72f2456daf4391b84c009c7371bcd787229fcfa5511e3dd275a9de8"},"schema_version":"1.0","source":{"id":"1801.02020","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02020","created_at":"2026-05-18T00:07:28Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02020v3","created_at":"2026-05-18T00:07:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02020","created_at":"2026-05-18T00:07:28Z"},{"alias_kind":"pith_short_12","alias_value":"SWBXEYLNBHDL","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SWBXEYLNBHDLTK3R","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SWBXEYLN","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:0f3e38b5d1fb87c74bc6be7fa4fa4781616054aad4c71a1116fedbbdcaa800cd","target":"graph","created_at":"2026-05-18T00:07:28Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Quantum repeater networks are a fundamental of any future quantum Internet and long-distance quantum communications. The entangled quantum nodes can communicate through several different levels of entanglement, leading to a heterogeneous, multi-level network structure. The level of entanglement between the quantum nodes determines the hop distance and the probability of the existence of an entangled link in the network. Here, we define a decentralized routing for entangled quantum networks. The proposed method allows an efficient routing to find the shortest paths in entangled quantum networks","authors_text":"Laszlo Gyongyosi, Sandor Imre","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-01-06T14:32:22Z","title":"Decentralized Base-Graph Routing for the Quantum Internet"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02020","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d30db1f6475548dbc52033f8b6c0eeed0d80c9e79a34f9cc458e90e4583f8c88","target":"record","created_at":"2026-05-18T00:07:28Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"01f2573382f86579900e3e2f588e6610222fd95a45176b77e737687183699cc4","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-01-06T14:32:22Z","title_canon_sha256":"3ed08f1bc72f2456daf4391b84c009c7371bcd787229fcfa5511e3dd275a9de8"},"schema_version":"1.0","source":{"id":"1801.02020","kind":"arxiv","version":3}},"canonical_sha256":"958372616d09c6b9ab71a32053c28caa017b8af84c21b784db556cc38a4ff17c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"958372616d09c6b9ab71a32053c28caa017b8af84c21b784db556cc38a4ff17c","first_computed_at":"2026-05-18T00:07:28.037311Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:28.037311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fjI0C+wm08osvxyqdgCA/jHlBSou3TJrzQPcn17y3CkuvzOzU+Z9J3dqS16jkhjfEodXsxvwhJlXI1OamVv9Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:28.037977Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.02020","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d30db1f6475548dbc52033f8b6c0eeed0d80c9e79a34f9cc458e90e4583f8c88","sha256:0f3e38b5d1fb87c74bc6be7fa4fa4781616054aad4c71a1116fedbbdcaa800cd"],"state_sha256":"712df5c1b8df32d23fff2e341fb3cccf9c07503927efeac368c8fff075e188d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kPtU5y/JksWRmORr9HQ7RTYsUY7uXRH3WDBkHddByZt3HhPhwFSBUSAOLx9YSoA9tvVa2UT5d1yE4XDRucOCAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T20:45:29.701098Z","bundle_sha256":"b9f68826462a6130b8bbf4bb4022eead0935c4e221c5c7801d5070532c3ddc14"}}