{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:PJTUVSXQBZU6FLTJA6HTVAIALN","short_pith_number":"pith:PJTUVSXQ","schema_version":"1.0","canonical_sha256":"7a674acaf00e69e2ae69078f3a81005b58d5773be275c05b86b83c4fcbe5a04e","source":{"kind":"arxiv","id":"1108.2393","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1108.2393","created_at":"2026-05-18T04:15:35.763258+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.2393v2","created_at":"2026-05-18T04:15:35.763258+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.2393","created_at":"2026-05-18T04:15:35.763258+00:00"},{"alias_kind":"pith_short_12","alias_value":"PJTUVSXQBZU6","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"PJTUVSXQBZU6FLTJ","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"PJTUVSXQ","created_at":"2026-05-18T12:26:39.201973+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PJTUVSXQBZU6FLTJA6HTVAIALN","json":"https://pith.science/pith/PJTUVSXQBZU6FLTJA6HTVAIALN.json","graph_json":"https://pith.science/api/pith-number/PJTUVSXQBZU6FLTJA6HTVAIALN/graph.json","events_json":"https://pith.science/api/pith-number/PJTUVSXQBZU6FLTJA6HTVAIALN/events.json","paper":"https://pith.science/paper/PJTUVSXQ"},"agent_actions":{"view_html":"https://pith.science/pith/PJTUVSXQBZU6FLTJA6HTVAIALN","download_json":"https://pith.science/pith/PJTUVSXQBZU6FLTJA6HTVAIALN.json","view_paper":"https://pith.science/paper/PJTUVSXQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.2393&json=true","fetch_graph":"https://pith.science/api/pith-number/PJTUVSXQBZU6FLTJA6HTVAIALN/graph.json","fetch_events":"https://pith.science/api/pith-number/PJTUVSXQBZU6FLTJA6HTVAIALN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PJTUVSXQBZU6FLTJA6HTVAIALN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PJTUVSXQBZU6FLTJA6HTVAIALN/action/storage_attestation","attest_author":"https://pith.science/pith/PJTUVSXQBZU6FLTJA6HTVAIALN/action/author_attestation","sign_citation":"https://pith.science/pith/PJTUVSXQBZU6FLTJA6HTVAIALN/action/citation_signature","submit_replication":"https://pith.science/pith/PJTUVSXQBZU6FLTJA6HTVAIALN/action/replication_record"}},"created_at":"2026-05-18T04:15:35.763258+00:00","updated_at":"2026-05-18T04:15:35.763258+00:00"}