{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:J5LYPZJVNYV43EYJP7PLVITTDJ","short_pith_number":"pith:J5LYPZJV","canonical_record":{"source":{"id":"0908.1457","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-08-11T05:55:43Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"902b4ebbb094988c0679196b92d12f20bf7ddb195c74b39108f040b84307c387","abstract_canon_sha256":"25c9bbf33ecfcdd525e45c103869849dc6f8226c538682632d7c10ff334e279d"},"schema_version":"1.0"},"canonical_sha256":"4f5787e5356e2bcd93097fdebaa2731a6a8402398bfa2a234919d854c2c069f9","source":{"kind":"arxiv","id":"0908.1457","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0908.1457","created_at":"2026-05-18T01:13:31Z"},{"alias_kind":"arxiv_version","alias_value":"0908.1457v1","created_at":"2026-05-18T01:13:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.1457","created_at":"2026-05-18T01:13:31Z"},{"alias_kind":"pith_short_12","alias_value":"J5LYPZJVNYV4","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"J5LYPZJVNYV43EYJ","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"J5LYPZJV","created_at":"2026-05-18T12:26:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:J5LYPZJVNYV43EYJP7PLVITTDJ","target":"record","payload":{"canonical_record":{"source":{"id":"0908.1457","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-08-11T05:55:43Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"902b4ebbb094988c0679196b92d12f20bf7ddb195c74b39108f040b84307c387","abstract_canon_sha256":"25c9bbf33ecfcdd525e45c103869849dc6f8226c538682632d7c10ff334e279d"},"schema_version":"1.0"},"canonical_sha256":"4f5787e5356e2bcd93097fdebaa2731a6a8402398bfa2a234919d854c2c069f9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:31.473990Z","signature_b64":"3tybcBxgW6Pz+RDby0ODNnuHtdc04aEjB9FLcNbgzDb36UD8xPi59c+eBJf0ObJ0QTZCYF95Lpz6SFYOiLHIDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f5787e5356e2bcd93097fdebaa2731a6a8402398bfa2a234919d854c2c069f9","last_reissued_at":"2026-05-18T01:13:31.473250Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:31.473250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0908.1457","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":"JZ/diCMM45n+Q3gj3VjbAHHMUBglYKMe1s6cKEk3T7p4hK8328CmXDsb1Dmncqz1V+/lPLMntJznlHsPf20wCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:15:19.331941Z"},"content_sha256":"6dc961605a560404b1410ceb88966b76c67193a785e03dc903a21786d4e83997","schema_version":"1.0","event_id":"sha256:6dc961605a560404b1410ceb88966b76c67193a785e03dc903a21786d4e83997"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:J5LYPZJVNYV43EYJP7PLVITTDJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"General Scheme for Perfect Quantum Network Coding with Free Classical Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Fran\\c{c}ois Le Gall, Harumichi Nishimura, Hirotada Kobayashi, Martin Roetteler","submitted_at":"2009-08-11T05:55:43Z","abstract_excerpt":"This paper considers the problem of efficiently transmitting quantum states through a network. It has been known for some time that without additional assumptions it is impossible to achieve this task perfectly in general -- indeed, it is impossible even for the simple butterfly network. As additional resource we allow free classical communication between any pair of network nodes. It is shown that perfect quantum network coding is achievable in this model whenever classical network coding is possible over the same network when replacing all quantum capacities by classical capacities. More pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.1457","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":"h8K1QiYQze6NCg+z8WmeZyBoL7VH0jbcwwbHN8KK4mpxqJaEpyTA4/Aiz+Ese2q3XIr2cb1sWZgwhDgBNlNIDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:15:19.332670Z"},"content_sha256":"eaf097579aaf76a1274af67e54445fcb529245e7637aa7ff919bfd308845058e","schema_version":"1.0","event_id":"sha256:eaf097579aaf76a1274af67e54445fcb529245e7637aa7ff919bfd308845058e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J5LYPZJVNYV43EYJP7PLVITTDJ/bundle.json","state_url":"https://pith.science/pith/J5LYPZJVNYV43EYJP7PLVITTDJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J5LYPZJVNYV43EYJP7PLVITTDJ/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-01T01:15:19Z","links":{"resolver":"https://pith.science/pith/J5LYPZJVNYV43EYJP7PLVITTDJ","bundle":"https://pith.science/pith/J5LYPZJVNYV43EYJP7PLVITTDJ/bundle.json","state":"https://pith.science/pith/J5LYPZJVNYV43EYJP7PLVITTDJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J5LYPZJVNYV43EYJP7PLVITTDJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:J5LYPZJVNYV43EYJP7PLVITTDJ","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":"25c9bbf33ecfcdd525e45c103869849dc6f8226c538682632d7c10ff334e279d","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-08-11T05:55:43Z","title_canon_sha256":"902b4ebbb094988c0679196b92d12f20bf7ddb195c74b39108f040b84307c387"},"schema_version":"1.0","source":{"id":"0908.1457","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0908.1457","created_at":"2026-05-18T01:13:31Z"},{"alias_kind":"arxiv_version","alias_value":"0908.1457v1","created_at":"2026-05-18T01:13:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.1457","created_at":"2026-05-18T01:13:31Z"},{"alias_kind":"pith_short_12","alias_value":"J5LYPZJVNYV4","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"J5LYPZJVNYV43EYJ","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"J5LYPZJV","created_at":"2026-05-18T12:26:00Z"}],"graph_snapshots":[{"event_id":"sha256:eaf097579aaf76a1274af67e54445fcb529245e7637aa7ff919bfd308845058e","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 the problem of efficiently transmitting quantum states through a network. It has been known for some time that without additional assumptions it is impossible to achieve this task perfectly in general -- indeed, it is impossible even for the simple butterfly network. As additional resource we allow free classical communication between any pair of network nodes. It is shown that perfect quantum network coding is achievable in this model whenever classical network coding is possible over the same network when replacing all quantum capacities by classical capacities. More pre","authors_text":"Fran\\c{c}ois 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-08-11T05:55:43Z","title":"General Scheme for Perfect Quantum Network Coding with Free Classical Communication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.1457","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:6dc961605a560404b1410ceb88966b76c67193a785e03dc903a21786d4e83997","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":"25c9bbf33ecfcdd525e45c103869849dc6f8226c538682632d7c10ff334e279d","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-08-11T05:55:43Z","title_canon_sha256":"902b4ebbb094988c0679196b92d12f20bf7ddb195c74b39108f040b84307c387"},"schema_version":"1.0","source":{"id":"0908.1457","kind":"arxiv","version":1}},"canonical_sha256":"4f5787e5356e2bcd93097fdebaa2731a6a8402398bfa2a234919d854c2c069f9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f5787e5356e2bcd93097fdebaa2731a6a8402398bfa2a234919d854c2c069f9","first_computed_at":"2026-05-18T01:13:31.473250Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:31.473250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3tybcBxgW6Pz+RDby0ODNnuHtdc04aEjB9FLcNbgzDb36UD8xPi59c+eBJf0ObJ0QTZCYF95Lpz6SFYOiLHIDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:31.473990Z","signed_message":"canonical_sha256_bytes"},"source_id":"0908.1457","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6dc961605a560404b1410ceb88966b76c67193a785e03dc903a21786d4e83997","sha256:eaf097579aaf76a1274af67e54445fcb529245e7637aa7ff919bfd308845058e"],"state_sha256":"feaf42d85e8c79104408ecb0b0e20fb4eb361c83dad1f46952555f567f825a7f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3CwXa++W9Tc/4h9NBlaoUWdngQiD7L4/xIfFhANLtjy6iMAc0DFlE4dQsxnWgJctz8Q18Z9YEd7yEAJhEibAAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T01:15:19.337091Z","bundle_sha256":"14ff873ae7ccd1aa692c22e20f870c0e7f878e7b3ed96b05a0fb0cad80222f13"}}