{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZJFXTD5CMAPNBCLQBV75V3XSYL","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":"091994cb394577753460acf83522afce9cf6488eb62d3685da2ed290ec61dfb8","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2014-03-14T11:19:30Z","title_canon_sha256":"b54a4e9c5be460c97d2d9497b73fa1f51fa4fb4d995f4b0bebf2b8b2dec36614"},"schema_version":"1.0","source":{"id":"1403.3533","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.3533","created_at":"2026-05-18T01:32:08Z"},{"alias_kind":"arxiv_version","alias_value":"1403.3533v3","created_at":"2026-05-18T01:32:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.3533","created_at":"2026-05-18T01:32:08Z"},{"alias_kind":"pith_short_12","alias_value":"ZJFXTD5CMAPN","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZJFXTD5CMAPNBCLQ","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZJFXTD5C","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:f28da6fb57cb12081bb9ad9dd05b5ab0c569b77d0b1b92f11c95027916b7fe34","target":"graph","created_at":"2026-05-18T01:32:08Z","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":"Network coding is a technique to maximize communication rates within a network, in communication protocols for simultaneous multi-party transmission of information. Linear network codes are examples of such protocols in which the local computations performed at the nodes in the network are limited to linear transformations of their input data (represented as elements of a ring, such as the integers modulo 2). The quantum linear network coding protocols of Kobayashi et al [arXiv:0908.1457 and arXiv:1012.4583] coherently simulate classical linear network codes, using supplemental classical commu","authors_text":"Martin Roetteler, Niel de Beaudrap","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2014-03-14T11:19:30Z","title":"Quantum linear network coding as one-way quantum computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.3533","kind":"arxiv","version":3},"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:cb7a1819f4b28ce20165bb800948135dbf7effbc4153c4cced496cce6a8bfb7f","target":"record","created_at":"2026-05-18T01:32:08Z","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":"091994cb394577753460acf83522afce9cf6488eb62d3685da2ed290ec61dfb8","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2014-03-14T11:19:30Z","title_canon_sha256":"b54a4e9c5be460c97d2d9497b73fa1f51fa4fb4d995f4b0bebf2b8b2dec36614"},"schema_version":"1.0","source":{"id":"1403.3533","kind":"arxiv","version":3}},"canonical_sha256":"ca4b798fa2601ed089700d7fdaeef2c2f52d2e982acf3769d13b8a8a2c9447ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca4b798fa2601ed089700d7fdaeef2c2f52d2e982acf3769d13b8a8a2c9447ec","first_computed_at":"2026-05-18T01:32:08.522577Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:08.522577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MGNE5dRy+yNcAP8rXMqBDAjH+mYvaWmwrJRpcizWTIQTZWux0RlxKA8UN3dHqc5jA0Mhdd+06xSZEBphdaltBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:08.523248Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.3533","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb7a1819f4b28ce20165bb800948135dbf7effbc4153c4cced496cce6a8bfb7f","sha256:f28da6fb57cb12081bb9ad9dd05b5ab0c569b77d0b1b92f11c95027916b7fe34"],"state_sha256":"cb80fa752de2c938e39e988bbf119218d1969b8bfd1c36aa5c06726086a4bd98"}