{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:ZD7A5CPXHBXNHXSZVGT4X33SX3","short_pith_number":"pith:ZD7A5CPX","canonical_record":{"source":{"id":"0902.1299","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-02-08T09:10:41Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"0fb54d396264e197095b95f4b49ebaa1e70395b41feb98997722361fec77b663","abstract_canon_sha256":"39c2377d81b96fd5e1d3e8809e62630beb95067cb15943eda5ab1596dc2baa7b"},"schema_version":"1.0"},"canonical_sha256":"c8fe0e89f7386ed3de59a9a7cbef72beea36b8b2c9e0ce73139856cd0ce67069","source":{"kind":"arxiv","id":"0902.1299","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0902.1299","created_at":"2026-05-18T01:13:31Z"},{"alias_kind":"arxiv_version","alias_value":"0902.1299v1","created_at":"2026-05-18T01:13:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0902.1299","created_at":"2026-05-18T01:13:31Z"},{"alias_kind":"pith_short_12","alias_value":"ZD7A5CPXHBXN","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"ZD7A5CPXHBXNHXSZ","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"ZD7A5CPX","created_at":"2026-05-18T12:26:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:ZD7A5CPXHBXNHXSZVGT4X33SX3","target":"record","payload":{"canonical_record":{"source":{"id":"0902.1299","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-02-08T09:10:41Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"0fb54d396264e197095b95f4b49ebaa1e70395b41feb98997722361fec77b663","abstract_canon_sha256":"39c2377d81b96fd5e1d3e8809e62630beb95067cb15943eda5ab1596dc2baa7b"},"schema_version":"1.0"},"canonical_sha256":"c8fe0e89f7386ed3de59a9a7cbef72beea36b8b2c9e0ce73139856cd0ce67069","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:31.482922Z","signature_b64":"x8AIKGDIjjMHaGIgKUYpFq9gWPvDVrJAfeWNp4qwwnTttwfLKgzusS1WI6GcV8jrS4Ma7xK8TP0gbiGYjn00BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8fe0e89f7386ed3de59a9a7cbef72beea36b8b2c9e0ce73139856cd0ce67069","last_reissued_at":"2026-05-18T01:13:31.482203Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:31.482203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0902.1299","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-18T01:13:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dqTXUUXUGKABkXm/Qhtg8xfFQAEoz9tE5rZDEXlFVgmdLIc3Qe0t34KxPTezxH9KpbTJHrqoNAhlOfU76EuaBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T08:32:13.337292Z"},"content_sha256":"1b20935eaeaef65d2b3ad8be5c8b37cb5beacc33462a5c44eafb5caca8a9b833","schema_version":"1.0","event_id":"sha256:1b20935eaeaef65d2b3ad8be5c8b37cb5beacc33462a5c44eafb5caca8a9b833"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:ZD7A5CPXHBXNHXSZVGT4X33SX3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Perfect Quantum Network Communication Protocol Based on Classical Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Francois Le Gall, Harumichi Nishimura, Hirotada Kobayashi, Martin Roetteler","submitted_at":"2009-02-08T09:10:41Z","abstract_excerpt":"This paper considers a problem of quantum communication between parties that are connected through a network of quantum channels. The model in this paper assumes that there is no prior entanglement shared among any of the parties, but that classical communication is free. The task is to perfectly transfer an unknown quantum state from a source subsystem to a target subsystem, where both source and target are formed by ordered sets of some of the nodes. It is proved that a lower bound of the rate at which this quantum communication task is possible is given by the classical min-cut max-flow the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0902.1299","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-18T01:13:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mLFwQVUz15+Me40i3XBVEMro8hMcuCK53QL6azx0+oIADbOMfBRZA+7ysF0OFRY0Fi9AIcZeEXprYxqAAiDaBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T08:32:13.337671Z"},"content_sha256":"d9ba0b7d9134c11174f98c9da9a3b8201ceb5c103d24e5f1b464ec1e1f4e8825","schema_version":"1.0","event_id":"sha256:d9ba0b7d9134c11174f98c9da9a3b8201ceb5c103d24e5f1b464ec1e1f4e8825"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZD7A5CPXHBXNHXSZVGT4X33SX3/bundle.json","state_url":"https://pith.science/pith/ZD7A5CPXHBXNHXSZVGT4X33SX3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZD7A5CPXHBXNHXSZVGT4X33SX3/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-06-04T08:32:13Z","links":{"resolver":"https://pith.science/pith/ZD7A5CPXHBXNHXSZVGT4X33SX3","bundle":"https://pith.science/pith/ZD7A5CPXHBXNHXSZVGT4X33SX3/bundle.json","state":"https://pith.science/pith/ZD7A5CPXHBXNHXSZVGT4X33SX3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZD7A5CPXHBXNHXSZVGT4X33SX3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:ZD7A5CPXHBXNHXSZVGT4X33SX3","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":"39c2377d81b96fd5e1d3e8809e62630beb95067cb15943eda5ab1596dc2baa7b","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-02-08T09:10:41Z","title_canon_sha256":"0fb54d396264e197095b95f4b49ebaa1e70395b41feb98997722361fec77b663"},"schema_version":"1.0","source":{"id":"0902.1299","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0902.1299","created_at":"2026-05-18T01:13:31Z"},{"alias_kind":"arxiv_version","alias_value":"0902.1299v1","created_at":"2026-05-18T01:13:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0902.1299","created_at":"2026-05-18T01:13:31Z"},{"alias_kind":"pith_short_12","alias_value":"ZD7A5CPXHBXN","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"ZD7A5CPXHBXNHXSZ","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"ZD7A5CPX","created_at":"2026-05-18T12:26:02Z"}],"graph_snapshots":[{"event_id":"sha256:d9ba0b7d9134c11174f98c9da9a3b8201ceb5c103d24e5f1b464ec1e1f4e8825","target":"graph","created_at":"2026-05-18T01:13:31Z","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":"This paper considers a problem of quantum communication between parties that are connected through a network of quantum channels. The model in this paper assumes that there is no prior entanglement shared among any of the parties, but that classical communication is free. The task is to perfectly transfer an unknown quantum state from a source subsystem to a target subsystem, where both source and target are formed by ordered sets of some of the nodes. It is proved that a lower bound of the rate at which this quantum communication task is possible is given by the classical min-cut max-flow the","authors_text":"Francois Le Gall, Harumichi Nishimura, Hirotada Kobayashi, Martin Roetteler","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-02-08T09:10:41Z","title":"Perfect Quantum Network Communication Protocol Based on Classical Network Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0902.1299","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:1b20935eaeaef65d2b3ad8be5c8b37cb5beacc33462a5c44eafb5caca8a9b833","target":"record","created_at":"2026-05-18T01:13:31Z","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":"39c2377d81b96fd5e1d3e8809e62630beb95067cb15943eda5ab1596dc2baa7b","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-02-08T09:10:41Z","title_canon_sha256":"0fb54d396264e197095b95f4b49ebaa1e70395b41feb98997722361fec77b663"},"schema_version":"1.0","source":{"id":"0902.1299","kind":"arxiv","version":1}},"canonical_sha256":"c8fe0e89f7386ed3de59a9a7cbef72beea36b8b2c9e0ce73139856cd0ce67069","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c8fe0e89f7386ed3de59a9a7cbef72beea36b8b2c9e0ce73139856cd0ce67069","first_computed_at":"2026-05-18T01:13:31.482203Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:31.482203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x8AIKGDIjjMHaGIgKUYpFq9gWPvDVrJAfeWNp4qwwnTttwfLKgzusS1WI6GcV8jrS4Ma7xK8TP0gbiGYjn00BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:31.482922Z","signed_message":"canonical_sha256_bytes"},"source_id":"0902.1299","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b20935eaeaef65d2b3ad8be5c8b37cb5beacc33462a5c44eafb5caca8a9b833","sha256:d9ba0b7d9134c11174f98c9da9a3b8201ceb5c103d24e5f1b464ec1e1f4e8825"],"state_sha256":"795a94d2bd5b3e1aeb4eebce41d24d101f6e1e2c3c99a682ef7dc9fcc493162e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z44ObwlzmjZXwRoN2hl0/L7xoxNBU9yx/taJYH0g6Z1WmY66YTvYa4RwSiPYCglqPx0EySq71bD0hPtv+I+JDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T08:32:13.340622Z","bundle_sha256":"7ca830522a8257e56d57b64ae53a3102a153f6f2e8264c3e54080220f45e48a2"}}