{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IXBSWJYYLTTDENSSKTZEZ2RUCB","short_pith_number":"pith:IXBSWJYY","schema_version":"1.0","canonical_sha256":"45c32b27185ce632365254f24cea34107b0b47f914b03ad8575e287ac8134ef8","source":{"kind":"arxiv","id":"1510.03060","version":1},"attestation_state":"computed","paper":{"title":"End-to-End Error-Correcting Codes on Networks with Worst-Case Symbol Errors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Qiwen Wang, Sidharth Jaggi","submitted_at":"2015-10-11T15:19:39Z","abstract_excerpt":"The problem of coding for networks experiencing worst-case symbol errors is considered. We 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. A new transform metric for errors under the considered model is proposed. Using this metric, we replicate many of the classical results from coding theory. Specifically, we prove new Hamming-type, Plotkin-type, and Elias-Bassalygo-type upper bounds on the network capacity. A c"},"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":"1510.03060","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-11T15:19:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7f4a7c327b9daceb3a82b8dfd7eac1e85c50cb2822798c22e797ce13b0098f04","abstract_canon_sha256":"70cd59ca70d3a32d76e4fdbec33375de1521d9ef51300508e0a4fd906b4e0b39"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:32.825908Z","signature_b64":"ZglE6J6GsQS8l9l2Y9QyyRdfBEjXWaPq5pZmWerjPHeWSuMIbkZZ3faOwGgP8kpNivU6Bg01s2mN+QzpBnaKDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45c32b27185ce632365254f24cea34107b0b47f914b03ad8575e287ac8134ef8","last_reissued_at":"2026-05-18T01:30:32.825252Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:32.825252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"End-to-End Error-Correcting Codes on Networks with Worst-Case Symbol Errors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Qiwen Wang, Sidharth Jaggi","submitted_at":"2015-10-11T15:19:39Z","abstract_excerpt":"The problem of coding for networks experiencing worst-case symbol errors is considered. We 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. A new transform metric for errors under the considered model is proposed. Using this metric, we replicate many of the classical results from coding theory. Specifically, we prove new Hamming-type, Plotkin-type, and Elias-Bassalygo-type upper bounds on the network capacity. A c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03060","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1510.03060","created_at":"2026-05-18T01:30:32.825359+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.03060v1","created_at":"2026-05-18T01:30:32.825359+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03060","created_at":"2026-05-18T01:30:32.825359+00:00"},{"alias_kind":"pith_short_12","alias_value":"IXBSWJYYLTTD","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"IXBSWJYYLTTDENSS","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"IXBSWJYY","created_at":"2026-05-18T12:29:27.538025+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/IXBSWJYYLTTDENSSKTZEZ2RUCB","json":"https://pith.science/pith/IXBSWJYYLTTDENSSKTZEZ2RUCB.json","graph_json":"https://pith.science/api/pith-number/IXBSWJYYLTTDENSSKTZEZ2RUCB/graph.json","events_json":"https://pith.science/api/pith-number/IXBSWJYYLTTDENSSKTZEZ2RUCB/events.json","paper":"https://pith.science/paper/IXBSWJYY"},"agent_actions":{"view_html":"https://pith.science/pith/IXBSWJYYLTTDENSSKTZEZ2RUCB","download_json":"https://pith.science/pith/IXBSWJYYLTTDENSSKTZEZ2RUCB.json","view_paper":"https://pith.science/paper/IXBSWJYY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.03060&json=true","fetch_graph":"https://pith.science/api/pith-number/IXBSWJYYLTTDENSSKTZEZ2RUCB/graph.json","fetch_events":"https://pith.science/api/pith-number/IXBSWJYYLTTDENSSKTZEZ2RUCB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IXBSWJYYLTTDENSSKTZEZ2RUCB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IXBSWJYYLTTDENSSKTZEZ2RUCB/action/storage_attestation","attest_author":"https://pith.science/pith/IXBSWJYYLTTDENSSKTZEZ2RUCB/action/author_attestation","sign_citation":"https://pith.science/pith/IXBSWJYYLTTDENSSKTZEZ2RUCB/action/citation_signature","submit_replication":"https://pith.science/pith/IXBSWJYYLTTDENSSKTZEZ2RUCB/action/replication_record"}},"created_at":"2026-05-18T01:30:32.825359+00:00","updated_at":"2026-05-18T01:30:32.825359+00:00"}