{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4PFBDSPQWBPJZW6CZ4KWGPIRQV","short_pith_number":"pith:4PFBDSPQ","canonical_record":{"source":{"id":"1809.02928","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-09-09T06:15:59Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"9b4cf09655094bf60c1bc476a8e41e3b9b50349aeaf32f8ef31f3b4e2563f162","abstract_canon_sha256":"b930860dad14c471fe1c075efab6f2841304cd1fdaee577d31c6ae4cfa4b5c3b"},"schema_version":"1.0"},"canonical_sha256":"e3ca11c9f0b05e9cdbc2cf15633d1185599dd6d6303529024db5156c33a2e983","source":{"kind":"arxiv","id":"1809.02928","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.02928","created_at":"2026-05-18T00:04:35Z"},{"alias_kind":"arxiv_version","alias_value":"1809.02928v1","created_at":"2026-05-18T00:04:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02928","created_at":"2026-05-18T00:04:35Z"},{"alias_kind":"pith_short_12","alias_value":"4PFBDSPQWBPJ","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4PFBDSPQWBPJZW6C","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4PFBDSPQ","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4PFBDSPQWBPJZW6CZ4KWGPIRQV","target":"record","payload":{"canonical_record":{"source":{"id":"1809.02928","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-09-09T06:15:59Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"9b4cf09655094bf60c1bc476a8e41e3b9b50349aeaf32f8ef31f3b4e2563f162","abstract_canon_sha256":"b930860dad14c471fe1c075efab6f2841304cd1fdaee577d31c6ae4cfa4b5c3b"},"schema_version":"1.0"},"canonical_sha256":"e3ca11c9f0b05e9cdbc2cf15633d1185599dd6d6303529024db5156c33a2e983","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:35.396012Z","signature_b64":"d1xTB2J8vilOZFBABKqJmC3xXAE3Jo9j378VaL6TRXmJbB6PAoQy67t78T3QBmI1mn6fh0zeyhuNbhKgrpJfCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3ca11c9f0b05e9cdbc2cf15633d1185599dd6d6303529024db5156c33a2e983","last_reissued_at":"2026-05-18T00:04:35.395581Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:35.395581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.02928","source_version":1,"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:04:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7c9+d3gsCgvncS7LzQnmaumi712+iYykRJJG28VJv2gczeAWa3ulY/649KEGcGZcyiKVlR7tdrgz8amdV/OnDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T18:16:22.278583Z"},"content_sha256":"62759a70a59ee085ebc91550df30c98d58956764bd37244e9f99ed170c1523c9","schema_version":"1.0","event_id":"sha256:62759a70a59ee085ebc91550df30c98d58956764bd37244e9f99ed170c1523c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4PFBDSPQWBPJZW6CZ4KWGPIRQV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Topology Adaption 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-09-09T06:15:59Z","abstract_excerpt":"In the quantum repeater networks of the quantum Internet, the varying stability of entangled quantum links makes dynamic topology adaption an emerging issue. Here we define an efficient topology adaption method for quantum repeater networks. The model assumes the random failures of entangled links and several parallel demands from legal users. The shortest path defines a set of entangled links for which the probability of stability is above a critical threshold. The scheme is utilized in a base-graph of the overlay quantum network to provide an efficient shortest path selection for the demands"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02928","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":""},"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:04:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Fe9fR+dxoEUlD3honFkRr0vHLQwMJiQ6PxEB8QNbV0vk4DiRdsazmUa8xUAfeH6OPmvzxcrae9fYMxTpwlJDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T18:16:22.279284Z"},"content_sha256":"ff450345481e7266fbd1fcafed7ce655e94ab6a89b3a02823b0314f2cc565b54","schema_version":"1.0","event_id":"sha256:ff450345481e7266fbd1fcafed7ce655e94ab6a89b3a02823b0314f2cc565b54"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4PFBDSPQWBPJZW6CZ4KWGPIRQV/bundle.json","state_url":"https://pith.science/pith/4PFBDSPQWBPJZW6CZ4KWGPIRQV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4PFBDSPQWBPJZW6CZ4KWGPIRQV/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-24T18:16:22Z","links":{"resolver":"https://pith.science/pith/4PFBDSPQWBPJZW6CZ4KWGPIRQV","bundle":"https://pith.science/pith/4PFBDSPQWBPJZW6CZ4KWGPIRQV/bundle.json","state":"https://pith.science/pith/4PFBDSPQWBPJZW6CZ4KWGPIRQV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4PFBDSPQWBPJZW6CZ4KWGPIRQV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4PFBDSPQWBPJZW6CZ4KWGPIRQV","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":"b930860dad14c471fe1c075efab6f2841304cd1fdaee577d31c6ae4cfa4b5c3b","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-09-09T06:15:59Z","title_canon_sha256":"9b4cf09655094bf60c1bc476a8e41e3b9b50349aeaf32f8ef31f3b4e2563f162"},"schema_version":"1.0","source":{"id":"1809.02928","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.02928","created_at":"2026-05-18T00:04:35Z"},{"alias_kind":"arxiv_version","alias_value":"1809.02928v1","created_at":"2026-05-18T00:04:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02928","created_at":"2026-05-18T00:04:35Z"},{"alias_kind":"pith_short_12","alias_value":"4PFBDSPQWBPJ","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4PFBDSPQWBPJZW6C","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4PFBDSPQ","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:ff450345481e7266fbd1fcafed7ce655e94ab6a89b3a02823b0314f2cc565b54","target":"graph","created_at":"2026-05-18T00:04:35Z","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":"In the quantum repeater networks of the quantum Internet, the varying stability of entangled quantum links makes dynamic topology adaption an emerging issue. Here we define an efficient topology adaption method for quantum repeater networks. The model assumes the random failures of entangled links and several parallel demands from legal users. The shortest path defines a set of entangled links for which the probability of stability is above a critical threshold. The scheme is utilized in a base-graph of the overlay quantum network to provide an efficient shortest path selection for the demands","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-09-09T06:15:59Z","title":"Topology Adaption for the Quantum Internet"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02928","kind":"arxiv","version":1},"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:62759a70a59ee085ebc91550df30c98d58956764bd37244e9f99ed170c1523c9","target":"record","created_at":"2026-05-18T00:04:35Z","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":"b930860dad14c471fe1c075efab6f2841304cd1fdaee577d31c6ae4cfa4b5c3b","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-09-09T06:15:59Z","title_canon_sha256":"9b4cf09655094bf60c1bc476a8e41e3b9b50349aeaf32f8ef31f3b4e2563f162"},"schema_version":"1.0","source":{"id":"1809.02928","kind":"arxiv","version":1}},"canonical_sha256":"e3ca11c9f0b05e9cdbc2cf15633d1185599dd6d6303529024db5156c33a2e983","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3ca11c9f0b05e9cdbc2cf15633d1185599dd6d6303529024db5156c33a2e983","first_computed_at":"2026-05-18T00:04:35.395581Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:35.395581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d1xTB2J8vilOZFBABKqJmC3xXAE3Jo9j378VaL6TRXmJbB6PAoQy67t78T3QBmI1mn6fh0zeyhuNbhKgrpJfCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:35.396012Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.02928","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:62759a70a59ee085ebc91550df30c98d58956764bd37244e9f99ed170c1523c9","sha256:ff450345481e7266fbd1fcafed7ce655e94ab6a89b3a02823b0314f2cc565b54"],"state_sha256":"7ff91f49437679d722804d0b01a48db9a2a39457437df5b950b8102a175c3ec5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pc6eugZiO1RS6Mai3NtQEB+1DUrrFW2/NI0U+r7Qmo4KgKuffExISxdEpHXa1hy5wnILR+5w83rken2NFHHVAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T18:16:22.283180Z","bundle_sha256":"898f49ae7df9bb84212c202c669a37b0531e2fd6384c27ad3bf68694c72b9517"}}