{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KV6G4JVCLQ2RA2G5OQB67LOEBW","short_pith_number":"pith:KV6G4JVC","canonical_record":{"source":{"id":"1805.03789","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-10T02:27:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e84f7f58ecdba81b1f8950f58613aa9080f50ffe79fef09628c7d520cbfe6462","abstract_canon_sha256":"e8797889135f7bacfe81d9e8331cd6e3201139377f46b25472f21e06876d46a3"},"schema_version":"1.0"},"canonical_sha256":"557c6e26a25c351068dd7403efadc40d9f516a74962dfcecf1fd57a605f87abe","source":{"kind":"arxiv","id":"1805.03789","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03789","created_at":"2026-05-17T23:48:22Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03789v3","created_at":"2026-05-17T23:48:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03789","created_at":"2026-05-17T23:48:22Z"},{"alias_kind":"pith_short_12","alias_value":"KV6G4JVCLQ2R","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KV6G4JVCLQ2RA2G5","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KV6G4JVC","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KV6G4JVCLQ2RA2G5OQB67LOEBW","target":"record","payload":{"canonical_record":{"source":{"id":"1805.03789","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-10T02:27:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e84f7f58ecdba81b1f8950f58613aa9080f50ffe79fef09628c7d520cbfe6462","abstract_canon_sha256":"e8797889135f7bacfe81d9e8331cd6e3201139377f46b25472f21e06876d46a3"},"schema_version":"1.0"},"canonical_sha256":"557c6e26a25c351068dd7403efadc40d9f516a74962dfcecf1fd57a605f87abe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:22.714581Z","signature_b64":"r5b0cssGO7619RQAZqVAdicrSJDC41K6gp1lbfvotWDnPDuqAmicMKs3ttTgsv3DH+Cbj+8GlssLopEKXh8cAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"557c6e26a25c351068dd7403efadc40d9f516a74962dfcecf1fd57a605f87abe","last_reissued_at":"2026-05-17T23:48:22.713931Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:22.713931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.03789","source_version":3,"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-17T23:48:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xgm5nVnvu/thn7TcFdoE+bzMJYJOXvYMraSS5YhM/ClqCBL6sPjmwC8ptzco3cju18o4QTeQaiu3HJIDr6eRDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T11:11:45.170850Z"},"content_sha256":"d98f8848b09530b9f9be033b976457c245f5283e9cebe6a6308d15a37db2516b","schema_version":"1.0","event_id":"sha256:d98f8848b09530b9f9be033b976457c245f5283e9cebe6a6308d15a37db2516b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KV6G4JVCLQ2RA2G5OQB67LOEBW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reliable and Secure Multishot Network Coding using Linearized Reed-Solomon Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Frank R. Kschischang, Umberto Mart\\'inez-Pe\\~nas","submitted_at":"2018-05-10T02:27:10Z","abstract_excerpt":"Multishot network coding is considered in a worst-case adversarial setting in which an omniscient adversary with unbounded computational resources may inject erroneous packets in up to $t$ links, erase up to $\\rho$ packets, and wire-tap up to $\\mu$ links, all throughout $\\ell$ shots of a linearly-coded network. Assuming no knowledge of the underlying linear network code (in particular, the network topology and underlying linear code may be random and change with time), a coding scheme achieving zero-error communication and perfect secrecy is obtained based on linearized Reed-Solomon codes. The"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03789","kind":"arxiv","version":3},"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-17T23:48:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xQlpfxsfRw3nEe06CtdbuBmrda9onBI3aufYU/SBpJyDgSFHrIh6LfYa/iYTIcZZNs5Mcg2GvQSeYMwldBM6CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T11:11:45.171191Z"},"content_sha256":"15e301ae26549d6299517f04d2fc614544367eff02ccf193200e869ad9a05fc8","schema_version":"1.0","event_id":"sha256:15e301ae26549d6299517f04d2fc614544367eff02ccf193200e869ad9a05fc8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KV6G4JVCLQ2RA2G5OQB67LOEBW/bundle.json","state_url":"https://pith.science/pith/KV6G4JVCLQ2RA2G5OQB67LOEBW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KV6G4JVCLQ2RA2G5OQB67LOEBW/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-09T11:11:45Z","links":{"resolver":"https://pith.science/pith/KV6G4JVCLQ2RA2G5OQB67LOEBW","bundle":"https://pith.science/pith/KV6G4JVCLQ2RA2G5OQB67LOEBW/bundle.json","state":"https://pith.science/pith/KV6G4JVCLQ2RA2G5OQB67LOEBW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KV6G4JVCLQ2RA2G5OQB67LOEBW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KV6G4JVCLQ2RA2G5OQB67LOEBW","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":"e8797889135f7bacfe81d9e8331cd6e3201139377f46b25472f21e06876d46a3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-10T02:27:10Z","title_canon_sha256":"e84f7f58ecdba81b1f8950f58613aa9080f50ffe79fef09628c7d520cbfe6462"},"schema_version":"1.0","source":{"id":"1805.03789","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03789","created_at":"2026-05-17T23:48:22Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03789v3","created_at":"2026-05-17T23:48:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03789","created_at":"2026-05-17T23:48:22Z"},{"alias_kind":"pith_short_12","alias_value":"KV6G4JVCLQ2R","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KV6G4JVCLQ2RA2G5","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KV6G4JVC","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:15e301ae26549d6299517f04d2fc614544367eff02ccf193200e869ad9a05fc8","target":"graph","created_at":"2026-05-17T23:48:22Z","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":"Multishot network coding is considered in a worst-case adversarial setting in which an omniscient adversary with unbounded computational resources may inject erroneous packets in up to $t$ links, erase up to $\\rho$ packets, and wire-tap up to $\\mu$ links, all throughout $\\ell$ shots of a linearly-coded network. Assuming no knowledge of the underlying linear network code (in particular, the network topology and underlying linear code may be random and change with time), a coding scheme achieving zero-error communication and perfect secrecy is obtained based on linearized Reed-Solomon codes. The","authors_text":"Frank R. Kschischang, Umberto Mart\\'inez-Pe\\~nas","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-10T02:27:10Z","title":"Reliable and Secure Multishot Network Coding using Linearized Reed-Solomon Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03789","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:d98f8848b09530b9f9be033b976457c245f5283e9cebe6a6308d15a37db2516b","target":"record","created_at":"2026-05-17T23:48:22Z","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":"e8797889135f7bacfe81d9e8331cd6e3201139377f46b25472f21e06876d46a3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-10T02:27:10Z","title_canon_sha256":"e84f7f58ecdba81b1f8950f58613aa9080f50ffe79fef09628c7d520cbfe6462"},"schema_version":"1.0","source":{"id":"1805.03789","kind":"arxiv","version":3}},"canonical_sha256":"557c6e26a25c351068dd7403efadc40d9f516a74962dfcecf1fd57a605f87abe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"557c6e26a25c351068dd7403efadc40d9f516a74962dfcecf1fd57a605f87abe","first_computed_at":"2026-05-17T23:48:22.713931Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:22.713931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r5b0cssGO7619RQAZqVAdicrSJDC41K6gp1lbfvotWDnPDuqAmicMKs3ttTgsv3DH+Cbj+8GlssLopEKXh8cAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:22.714581Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.03789","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d98f8848b09530b9f9be033b976457c245f5283e9cebe6a6308d15a37db2516b","sha256:15e301ae26549d6299517f04d2fc614544367eff02ccf193200e869ad9a05fc8"],"state_sha256":"100bd89e3a1de36fbb4a469674301895f6f04b789585030fa4be613eb7bd89d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a1ULHAC0cgyn+kqRxlEMV1uXJTIuOPyEdNNPSpvlopeyXIzhnRgkSTLeRGd7Hnu08duIV83lVWYm8pBQHKl/DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T11:11:45.173035Z","bundle_sha256":"bbb1419be4e4d0eccd43075f249e7becd9062d1d7d406fc752560868730af3f8"}}