{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:THW6XFFEN4FA3GYLAK77567WTP","short_pith_number":"pith:THW6XFFE","canonical_record":{"source":{"id":"1011.1377","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-05T12:16:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8e66766feeda4fd2291464fb1ce9e980fe45b301c28b9b4cf70d56671941a24d","abstract_canon_sha256":"1707c3a0c5e9023998609b1c45eca1b16e9db8d04d664e6ead36cfb8b3c49bc3"},"schema_version":"1.0"},"canonical_sha256":"99edeb94a46f0a0d9b0b02bffefbf69bdb18446380090bea90dc388d280d9de8","source":{"kind":"arxiv","id":"1011.1377","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.1377","created_at":"2026-05-18T04:36:58Z"},{"alias_kind":"arxiv_version","alias_value":"1011.1377v1","created_at":"2026-05-18T04:36:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.1377","created_at":"2026-05-18T04:36:58Z"},{"alias_kind":"pith_short_12","alias_value":"THW6XFFEN4FA","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"THW6XFFEN4FA3GYL","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"THW6XFFE","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:THW6XFFEN4FA3GYLAK77567WTP","target":"record","payload":{"canonical_record":{"source":{"id":"1011.1377","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-05T12:16:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8e66766feeda4fd2291464fb1ce9e980fe45b301c28b9b4cf70d56671941a24d","abstract_canon_sha256":"1707c3a0c5e9023998609b1c45eca1b16e9db8d04d664e6ead36cfb8b3c49bc3"},"schema_version":"1.0"},"canonical_sha256":"99edeb94a46f0a0d9b0b02bffefbf69bdb18446380090bea90dc388d280d9de8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:36:58.564447Z","signature_b64":"yhE03A5RIL41ImhRClwoYCREAIG2G+fMymzZkRwikZpdZsXbRTC/59o7lXSgCMUgvoTas4zdwDQlEVLXIRMbBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99edeb94a46f0a0d9b0b02bffefbf69bdb18446380090bea90dc388d280d9de8","last_reissued_at":"2026-05-18T04:36:58.563891Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:36:58.563891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.1377","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-18T04:36:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KSL+VFFTmeq3Fm4Dtd3Gb/n2LCxSm7RG954QbMkZVBsN7EY+12ehUswTFcaG6aVyLWdXB8T/TvAEcBIKB7MZCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:57:42.754117Z"},"content_sha256":"596fb9f5c6670ef5c79255d06b55538b0c33472e62772960db9bc1a944d500a9","schema_version":"1.0","event_id":"sha256:596fb9f5c6670ef5c79255d06b55538b0c33472e62772960db9bc1a944d500a9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:THW6XFFEN4FA3GYLAK77567WTP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Construction of Network Error Correction Codes in Packet Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fang-Wei Fu, Xuan Guang, Zhen Zhang","submitted_at":"2010-11-05T12:16:11Z","abstract_excerpt":"Recently, network error correction coding (NEC) has been studied extensively. Several bounds in classical coding theory have been extended to network error correction coding, especially the Singleton bound. In this paper, following the research line using the extended global encoding kernels proposed in \\cite{zhang-correction}, the refined Singleton bound of NEC can be proved more explicitly. Moreover, we give a constructive proof of the attainability of this bound and indicate that the required field size for the existence of network maximum distance separable (MDS) codes can become smaller f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.1377","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-18T04:36:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IUWOJctXXu5g6rX6+/0YrHPe51XWz9/ZoGuOkC5Oa8GE37zpDpr8+qI6Wd0PbmVQcCRAIDCTa06GeC1yvEt+DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:57:42.754720Z"},"content_sha256":"b195eb82dc742283addeee5f622f3002ea643e25a36bb6cd57ffa37cd33df662","schema_version":"1.0","event_id":"sha256:b195eb82dc742283addeee5f622f3002ea643e25a36bb6cd57ffa37cd33df662"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/THW6XFFEN4FA3GYLAK77567WTP/bundle.json","state_url":"https://pith.science/pith/THW6XFFEN4FA3GYLAK77567WTP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/THW6XFFEN4FA3GYLAK77567WTP/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-11T02:57:42Z","links":{"resolver":"https://pith.science/pith/THW6XFFEN4FA3GYLAK77567WTP","bundle":"https://pith.science/pith/THW6XFFEN4FA3GYLAK77567WTP/bundle.json","state":"https://pith.science/pith/THW6XFFEN4FA3GYLAK77567WTP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/THW6XFFEN4FA3GYLAK77567WTP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:THW6XFFEN4FA3GYLAK77567WTP","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":"1707c3a0c5e9023998609b1c45eca1b16e9db8d04d664e6ead36cfb8b3c49bc3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-05T12:16:11Z","title_canon_sha256":"8e66766feeda4fd2291464fb1ce9e980fe45b301c28b9b4cf70d56671941a24d"},"schema_version":"1.0","source":{"id":"1011.1377","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.1377","created_at":"2026-05-18T04:36:58Z"},{"alias_kind":"arxiv_version","alias_value":"1011.1377v1","created_at":"2026-05-18T04:36:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.1377","created_at":"2026-05-18T04:36:58Z"},{"alias_kind":"pith_short_12","alias_value":"THW6XFFEN4FA","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"THW6XFFEN4FA3GYL","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"THW6XFFE","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:b195eb82dc742283addeee5f622f3002ea643e25a36bb6cd57ffa37cd33df662","target":"graph","created_at":"2026-05-18T04:36:58Z","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":"Recently, network error correction coding (NEC) has been studied extensively. Several bounds in classical coding theory have been extended to network error correction coding, especially the Singleton bound. In this paper, following the research line using the extended global encoding kernels proposed in \\cite{zhang-correction}, the refined Singleton bound of NEC can be proved more explicitly. Moreover, we give a constructive proof of the attainability of this bound and indicate that the required field size for the existence of network maximum distance separable (MDS) codes can become smaller f","authors_text":"Fang-Wei Fu, Xuan Guang, Zhen Zhang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-05T12:16:11Z","title":"Construction of Network Error Correction Codes in Packet Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.1377","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:596fb9f5c6670ef5c79255d06b55538b0c33472e62772960db9bc1a944d500a9","target":"record","created_at":"2026-05-18T04:36:58Z","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":"1707c3a0c5e9023998609b1c45eca1b16e9db8d04d664e6ead36cfb8b3c49bc3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-05T12:16:11Z","title_canon_sha256":"8e66766feeda4fd2291464fb1ce9e980fe45b301c28b9b4cf70d56671941a24d"},"schema_version":"1.0","source":{"id":"1011.1377","kind":"arxiv","version":1}},"canonical_sha256":"99edeb94a46f0a0d9b0b02bffefbf69bdb18446380090bea90dc388d280d9de8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"99edeb94a46f0a0d9b0b02bffefbf69bdb18446380090bea90dc388d280d9de8","first_computed_at":"2026-05-18T04:36:58.563891Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:36:58.563891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yhE03A5RIL41ImhRClwoYCREAIG2G+fMymzZkRwikZpdZsXbRTC/59o7lXSgCMUgvoTas4zdwDQlEVLXIRMbBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:36:58.564447Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.1377","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:596fb9f5c6670ef5c79255d06b55538b0c33472e62772960db9bc1a944d500a9","sha256:b195eb82dc742283addeee5f622f3002ea643e25a36bb6cd57ffa37cd33df662"],"state_sha256":"d19c8693d7e0f3b932f29aafee567d4d24c9b7118c689f7afc9e50588c5299c5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GSi6YUBVoV6Su5ybuGJTDGPo36+PIV5Z/LB5DXlPKbtL+z5kv1FNiSrrn6ElCCl95OcgiU1ffBNPMZ7y+Is5Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T02:57:42.758608Z","bundle_sha256":"21f4f0418f7d58fa1cfbece3b2ba63b01ace6f8520a929e940ed2885392553b5"}}