{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:PJTUVSXQBZU6FLTJA6HTVAIALN","short_pith_number":"pith:PJTUVSXQ","canonical_record":{"source":{"id":"1108.2393","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-11T13:28:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7e504e7409d771e7610739ab82065ef57191ec4a78b6c1a9ae01e22cda1bcbb9","abstract_canon_sha256":"f01cef4eea9d8ff6a198ded42bccf09c7c4ae21c64df3babc503711bf9dbbd33"},"schema_version":"1.0"},"canonical_sha256":"7a674acaf00e69e2ae69078f3a81005b58d5773be275c05b86b83c4fcbe5a04e","source":{"kind":"arxiv","id":"1108.2393","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.2393","created_at":"2026-05-18T04:15:35Z"},{"alias_kind":"arxiv_version","alias_value":"1108.2393v2","created_at":"2026-05-18T04:15:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.2393","created_at":"2026-05-18T04:15:35Z"},{"alias_kind":"pith_short_12","alias_value":"PJTUVSXQBZU6","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PJTUVSXQBZU6FLTJ","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PJTUVSXQ","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:PJTUVSXQBZU6FLTJA6HTVAIALN","target":"record","payload":{"canonical_record":{"source":{"id":"1108.2393","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-11T13:28:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7e504e7409d771e7610739ab82065ef57191ec4a78b6c1a9ae01e22cda1bcbb9","abstract_canon_sha256":"f01cef4eea9d8ff6a198ded42bccf09c7c4ae21c64df3babc503711bf9dbbd33"},"schema_version":"1.0"},"canonical_sha256":"7a674acaf00e69e2ae69078f3a81005b58d5773be275c05b86b83c4fcbe5a04e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:35.763620Z","signature_b64":"J/KOAWqOrVfP9zNRPT8CSvzZjv0tdMbCPRSDf/6J5Z0s048JsqSK7aFbf+Yg7jBx4007Qshnv8+/JRGaGhMgDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a674acaf00e69e2ae69078f3a81005b58d5773be275c05b86b83c4fcbe5a04e","last_reissued_at":"2026-05-18T04:15:35.763189Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:35.763189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.2393","source_version":2,"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:15:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AL40m329rUsjholaUjqSiqm+fYUSK8glng1MphXnVs6ngefQqQhXgpqU17L318kT8vqbdSO8+YY0mzxASgHnBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T22:17:31.258183Z"},"content_sha256":"df224e839e823b40864e366c449780d1d052fc4a2da599dd18df564a90ae8375","schema_version":"1.0","event_id":"sha256:df224e839e823b40864e366c449780d1d052fc4a2da599dd18df564a90ae8375"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:PJTUVSXQBZU6FLTJA6HTVAIALN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Binary Error Correcting Network Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Qiwen Wang, Shuo-Yen Robert Li, Sidharth Jaggi","submitted_at":"2011-08-11T13:28:31Z","abstract_excerpt":"We consider network coding for networks experiencing worst-case bit-flip errors, and argue that this is a reasonable model for highly dynamic wireless network transmissions. We demonstrate that in this setup prior network error-correcting schemes can be arbitrarily far from achieving the optimal network throughput. We propose a new metric for errors under this model. Using this metric, we prove a new Hamming-type upper bound on the network capacity. We also show a commensurate lower bound based on GV-type codes that can be used for error-correction. The codes used to attain the lower bound are"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.2393","kind":"arxiv","version":2},"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:15:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OZ32VEfJx3Y66uMOnlZMZYdze4xMoP0eHmBrGHw4Ds/rTJjYxQmR3BW6gXXGTIDqMY0DBfnFSCrCN9CCRPSzAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T22:17:31.258890Z"},"content_sha256":"b9bed585cfc259389beaba504bdf58f305374332f41e66348f015f645638bb7a","schema_version":"1.0","event_id":"sha256:b9bed585cfc259389beaba504bdf58f305374332f41e66348f015f645638bb7a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PJTUVSXQBZU6FLTJA6HTVAIALN/bundle.json","state_url":"https://pith.science/pith/PJTUVSXQBZU6FLTJA6HTVAIALN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PJTUVSXQBZU6FLTJA6HTVAIALN/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-05-22T22:17:31Z","links":{"resolver":"https://pith.science/pith/PJTUVSXQBZU6FLTJA6HTVAIALN","bundle":"https://pith.science/pith/PJTUVSXQBZU6FLTJA6HTVAIALN/bundle.json","state":"https://pith.science/pith/PJTUVSXQBZU6FLTJA6HTVAIALN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PJTUVSXQBZU6FLTJA6HTVAIALN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:PJTUVSXQBZU6FLTJA6HTVAIALN","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":"f01cef4eea9d8ff6a198ded42bccf09c7c4ae21c64df3babc503711bf9dbbd33","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-11T13:28:31Z","title_canon_sha256":"7e504e7409d771e7610739ab82065ef57191ec4a78b6c1a9ae01e22cda1bcbb9"},"schema_version":"1.0","source":{"id":"1108.2393","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.2393","created_at":"2026-05-18T04:15:35Z"},{"alias_kind":"arxiv_version","alias_value":"1108.2393v2","created_at":"2026-05-18T04:15:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.2393","created_at":"2026-05-18T04:15:35Z"},{"alias_kind":"pith_short_12","alias_value":"PJTUVSXQBZU6","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PJTUVSXQBZU6FLTJ","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PJTUVSXQ","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:b9bed585cfc259389beaba504bdf58f305374332f41e66348f015f645638bb7a","target":"graph","created_at":"2026-05-18T04:15:35Z","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":"We consider network coding for networks experiencing worst-case bit-flip errors, and argue that this is a reasonable model for highly dynamic wireless network transmissions. We demonstrate that in this setup prior network error-correcting schemes can be arbitrarily far from achieving the optimal network throughput. We propose a new metric for errors under this model. Using this metric, we prove a new Hamming-type upper bound on the network capacity. We also show a commensurate lower bound based on GV-type codes that can be used for error-correction. The codes used to attain the lower bound are","authors_text":"Qiwen Wang, Shuo-Yen Robert Li, Sidharth Jaggi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-11T13:28:31Z","title":"Binary Error Correcting Network Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.2393","kind":"arxiv","version":2},"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:df224e839e823b40864e366c449780d1d052fc4a2da599dd18df564a90ae8375","target":"record","created_at":"2026-05-18T04:15:35Z","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":"f01cef4eea9d8ff6a198ded42bccf09c7c4ae21c64df3babc503711bf9dbbd33","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-11T13:28:31Z","title_canon_sha256":"7e504e7409d771e7610739ab82065ef57191ec4a78b6c1a9ae01e22cda1bcbb9"},"schema_version":"1.0","source":{"id":"1108.2393","kind":"arxiv","version":2}},"canonical_sha256":"7a674acaf00e69e2ae69078f3a81005b58d5773be275c05b86b83c4fcbe5a04e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a674acaf00e69e2ae69078f3a81005b58d5773be275c05b86b83c4fcbe5a04e","first_computed_at":"2026-05-18T04:15:35.763189Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:15:35.763189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J/KOAWqOrVfP9zNRPT8CSvzZjv0tdMbCPRSDf/6J5Z0s048JsqSK7aFbf+Yg7jBx4007Qshnv8+/JRGaGhMgDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:15:35.763620Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.2393","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df224e839e823b40864e366c449780d1d052fc4a2da599dd18df564a90ae8375","sha256:b9bed585cfc259389beaba504bdf58f305374332f41e66348f015f645638bb7a"],"state_sha256":"8d35ba05a70ed00970660eb44f4cb0583fa63d5e588219fc84ed742c015ca5ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k2n4Qp3K1QE48yBB7z9aeL2o56gxOlyUGXayCXoaw3jfvt8p6Fa1RyX3d/N8tIvvJ/wKs7CAOR4X2VXWEqBVBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T22:17:31.262494Z","bundle_sha256":"bf367154b8817a95c382279777673bad10c074ee9357dd8ba5dd8b7d5d0c12a9"}}