{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:E4PK74F2XMUH6N2SHTXZL73O7W","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":"fdf550447db01c47d1d59365f36df885ef36363dcd23fe4958ba3343ad4b99df","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-12-21T09:50:34Z","title_canon_sha256":"b8b66c0750319f273b5ab66e6095c5f7722c551fc4d07e142e0c130b93274741"},"schema_version":"1.0","source":{"id":"1012.4583","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.4583","created_at":"2026-05-18T01:13:31Z"},{"alias_kind":"arxiv_version","alias_value":"1012.4583v1","created_at":"2026-05-18T01:13:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.4583","created_at":"2026-05-18T01:13:31Z"},{"alias_kind":"pith_short_12","alias_value":"E4PK74F2XMUH","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"E4PK74F2XMUH6N2S","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"E4PK74F2","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:a9b4fba88e4cf29dd2b2ec1c5012dffe2b01da51f63eae7537ea8c600d3bc375","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":"The k-pair problem in network coding theory asks to send k messages simultaneously between k source-target pairs over a directed acyclic graph. In a previous paper [ICALP 2009, Part I, pages 622--633] the present authors showed that if a classical k-pair problem is solvable by means of a linear coding scheme, then the quantum k-pair problem over the same graph is also solvable, provided that classical communication can be sent for free between any pair of nodes of the graph. Here we address the main case that remained open in our previous work, namely whether nonlinear classical network coding","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":"2010-12-21T09:50:34Z","title":"Constructing Quantum Network Coding Schemes from Classical Nonlinear Protocols"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.4583","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:369a7c69bfb4041a8a97032df09346e5c30fb036290d81688426acaa50c6c187","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":"fdf550447db01c47d1d59365f36df885ef36363dcd23fe4958ba3343ad4b99df","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-12-21T09:50:34Z","title_canon_sha256":"b8b66c0750319f273b5ab66e6095c5f7722c551fc4d07e142e0c130b93274741"},"schema_version":"1.0","source":{"id":"1012.4583","kind":"arxiv","version":1}},"canonical_sha256":"271eaff0babb287f37523cef95ff6efd89ffb096f34f5cd63c8264af39bbb33b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"271eaff0babb287f37523cef95ff6efd89ffb096f34f5cd63c8264af39bbb33b","first_computed_at":"2026-05-18T01:13:31.453543Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:31.453543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XlLrnr5Dnzfgf5BEYGIibDvBSjmE9o9bmDcYZpUa518YpE/rdK6o4vaKtIf1k7emXrH0yIPwX1QJ4VZ60CiDDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:31.454236Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.4583","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:369a7c69bfb4041a8a97032df09346e5c30fb036290d81688426acaa50c6c187","sha256:a9b4fba88e4cf29dd2b2ec1c5012dffe2b01da51f63eae7537ea8c600d3bc375"],"state_sha256":"04d9783377ba07bb21c1e84a1320a1bc4389e540468abf97e24f3532be8dea56"}