{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:HNYIUUX3TBXJ6RMFULBJPDBWFB","short_pith_number":"pith:HNYIUUX3","canonical_record":{"source":{"id":"2205.15501","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2022-05-31T01:52:44Z","cross_cats_sorted":[],"title_canon_sha256":"e66f12af881827c18c9c889349f1e6413372440d8beea025a661c903447fbd67","abstract_canon_sha256":"9d70ba3f4b79c37900692a9ab34d1a14ff721b3ee6b9c2336b4f293164ed976f"},"schema_version":"1.0"},"canonical_sha256":"3b708a52fb986e9f4585a2c2978c36284d3ffc023c549cc2c9f90ebbbefd2102","source":{"kind":"arxiv","id":"2205.15501","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.15501","created_at":"2026-07-05T04:27:33Z"},{"alias_kind":"arxiv_version","alias_value":"2205.15501v1","created_at":"2026-07-05T04:27:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.15501","created_at":"2026-07-05T04:27:33Z"},{"alias_kind":"pith_short_12","alias_value":"HNYIUUX3TBXJ","created_at":"2026-07-05T04:27:33Z"},{"alias_kind":"pith_short_16","alias_value":"HNYIUUX3TBXJ6RMF","created_at":"2026-07-05T04:27:33Z"},{"alias_kind":"pith_short_8","alias_value":"HNYIUUX3","created_at":"2026-07-05T04:27:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:HNYIUUX3TBXJ6RMFULBJPDBWFB","target":"record","payload":{"canonical_record":{"source":{"id":"2205.15501","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2022-05-31T01:52:44Z","cross_cats_sorted":[],"title_canon_sha256":"e66f12af881827c18c9c889349f1e6413372440d8beea025a661c903447fbd67","abstract_canon_sha256":"9d70ba3f4b79c37900692a9ab34d1a14ff721b3ee6b9c2336b4f293164ed976f"},"schema_version":"1.0"},"canonical_sha256":"3b708a52fb986e9f4585a2c2978c36284d3ffc023c549cc2c9f90ebbbefd2102","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:27:33.499204Z","signature_b64":"CE8H/oLLpZpgM1cT0QDBRf2sxU2abZ2dPdw6TgkxVmCUc5SMpE5hVeCYWvzTCjJLMKaVA+pDw3cahaozEEH6Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b708a52fb986e9f4585a2c2978c36284d3ffc023c549cc2c9f90ebbbefd2102","last_reissued_at":"2026-07-05T04:27:33.498612Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:27:33.498612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2205.15501","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-07-05T04:27:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+gifm27cGxKKXWUm6PQOWfnPWrQ9Gj52LeDoSxht4dsbz31VIx9lJqfEalzQK9HV3ttMlTsb0tS1wiWJzkhJAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T14:27:41.531538Z"},"content_sha256":"31b07cc6dbe2991a158e4e57b90217a417b7056a26178a7971c88866a8cad321","schema_version":"1.0","event_id":"sha256:31b07cc6dbe2991a158e4e57b90217a417b7056a26178a7971c88866a8cad321"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:HNYIUUX3TBXJ6RMFULBJPDBWFB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Entanglement Routing Design over Quantum Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Jiarui Zhang, Ji Liu, Yiming Zeng, Yuanyuan Yang, Zhenhua Liu","submitted_at":"2022-05-31T01:52:44Z","abstract_excerpt":"Quantum networks are considered as a promising future platform for quantum information exchange and quantum applications, which have capabilities far beyond the traditional communication networks. Remote quantum entanglement is an essential component of a quantum network. How to efficiently design a multi-routing entanglement protocol is a fundamental yet challenging problem. In this paper, we study a quantum entanglement routing problem to simultaneously maximize the number of quantum-user pairs and their expected throughput. Our approach is to formulate the problem as two sequential integer "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.15501","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/2205.15501/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"},"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-07-05T04:27:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dA/gBniSOR44+0TdnNsiLxQOj9KWP+zO4d4MN/xim7KTe/ON2yU2Ijpc3OgDV25/cMKonWf6YkSVj4icl+AJAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T14:27:41.531909Z"},"content_sha256":"feff1572b5cf579686b153fc3dbd2e1b2e9e08815bba6aa58308a831a81f1d32","schema_version":"1.0","event_id":"sha256:feff1572b5cf579686b153fc3dbd2e1b2e9e08815bba6aa58308a831a81f1d32"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HNYIUUX3TBXJ6RMFULBJPDBWFB/bundle.json","state_url":"https://pith.science/pith/HNYIUUX3TBXJ6RMFULBJPDBWFB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HNYIUUX3TBXJ6RMFULBJPDBWFB/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-07-07T14:27:41Z","links":{"resolver":"https://pith.science/pith/HNYIUUX3TBXJ6RMFULBJPDBWFB","bundle":"https://pith.science/pith/HNYIUUX3TBXJ6RMFULBJPDBWFB/bundle.json","state":"https://pith.science/pith/HNYIUUX3TBXJ6RMFULBJPDBWFB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HNYIUUX3TBXJ6RMFULBJPDBWFB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:HNYIUUX3TBXJ6RMFULBJPDBWFB","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":"9d70ba3f4b79c37900692a9ab34d1a14ff721b3ee6b9c2336b4f293164ed976f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2022-05-31T01:52:44Z","title_canon_sha256":"e66f12af881827c18c9c889349f1e6413372440d8beea025a661c903447fbd67"},"schema_version":"1.0","source":{"id":"2205.15501","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.15501","created_at":"2026-07-05T04:27:33Z"},{"alias_kind":"arxiv_version","alias_value":"2205.15501v1","created_at":"2026-07-05T04:27:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.15501","created_at":"2026-07-05T04:27:33Z"},{"alias_kind":"pith_short_12","alias_value":"HNYIUUX3TBXJ","created_at":"2026-07-05T04:27:33Z"},{"alias_kind":"pith_short_16","alias_value":"HNYIUUX3TBXJ6RMF","created_at":"2026-07-05T04:27:33Z"},{"alias_kind":"pith_short_8","alias_value":"HNYIUUX3","created_at":"2026-07-05T04:27:33Z"}],"graph_snapshots":[{"event_id":"sha256:feff1572b5cf579686b153fc3dbd2e1b2e9e08815bba6aa58308a831a81f1d32","target":"graph","created_at":"2026-07-05T04:27:33Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2205.15501/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Quantum networks are considered as a promising future platform for quantum information exchange and quantum applications, which have capabilities far beyond the traditional communication networks. Remote quantum entanglement is an essential component of a quantum network. How to efficiently design a multi-routing entanglement protocol is a fundamental yet challenging problem. In this paper, we study a quantum entanglement routing problem to simultaneously maximize the number of quantum-user pairs and their expected throughput. Our approach is to formulate the problem as two sequential integer ","authors_text":"Jiarui Zhang, Ji Liu, Yiming Zeng, Yuanyuan Yang, Zhenhua Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2022-05-31T01:52:44Z","title":"Multi-Entanglement Routing Design over Quantum Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.15501","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:31b07cc6dbe2991a158e4e57b90217a417b7056a26178a7971c88866a8cad321","target":"record","created_at":"2026-07-05T04:27:33Z","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":"9d70ba3f4b79c37900692a9ab34d1a14ff721b3ee6b9c2336b4f293164ed976f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2022-05-31T01:52:44Z","title_canon_sha256":"e66f12af881827c18c9c889349f1e6413372440d8beea025a661c903447fbd67"},"schema_version":"1.0","source":{"id":"2205.15501","kind":"arxiv","version":1}},"canonical_sha256":"3b708a52fb986e9f4585a2c2978c36284d3ffc023c549cc2c9f90ebbbefd2102","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b708a52fb986e9f4585a2c2978c36284d3ffc023c549cc2c9f90ebbbefd2102","first_computed_at":"2026-07-05T04:27:33.498612Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:27:33.498612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CE8H/oLLpZpgM1cT0QDBRf2sxU2abZ2dPdw6TgkxVmCUc5SMpE5hVeCYWvzTCjJLMKaVA+pDw3cahaozEEH6Cw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:27:33.499204Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.15501","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31b07cc6dbe2991a158e4e57b90217a417b7056a26178a7971c88866a8cad321","sha256:feff1572b5cf579686b153fc3dbd2e1b2e9e08815bba6aa58308a831a81f1d32"],"state_sha256":"6553fc12992c77d943c2a962dcc2805c492fa54fc1b98b5ef184cdf9200e6bf9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8OM9hS1IMoW2EAbHqtSBiTZKu9fK19rrfoDLdT2tVi4myoQqRFN1DIe8eTzn119Dx4FOej1ayr4HleECKKnSAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T14:27:41.534003Z","bundle_sha256":"d394dce58d7e01c27a1da8074d1acc1290ee90d2a050b95ea0edd01690a54177"}}