{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:XQNHFNKHM246GWGFONUG5F4BBM","short_pith_number":"pith:XQNHFNKH","schema_version":"1.0","canonical_sha256":"bc1a72b54766b9e358c573686e97810b2d6e95cad3ef224221f261686351910d","source":{"kind":"arxiv","id":"1301.2860","version":1},"attestation_state":"computed","paper":{"title":"Rateless Resilient Network Coding Against Byzantine Adversaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hongyi Yao, Sidharth Jaggi, Tracey Ho, Wentao Huang","submitted_at":"2013-01-14T05:21:55Z","abstract_excerpt":"This paper considers rateless network error correction codes for reliable multicast in the presence of adversarial errors. Most existing network error correction codes are designed for a given network capacity and maximum number of errors known a priori to the encoder and decoder. However, in certain practical settings it may be necessary to operate without such a priori knowledge. We present rateless coding schemes for two adversarial models, where the source sends more redundancy over time, until decoding succeeds. The first model assumes there is a secret channel between the source and the "},"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":"1301.2860","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-14T05:21:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b89b62643444e827dfc74e2b298b098303e5262cf6e1d6959e0be75970a10003","abstract_canon_sha256":"aa19bb7de6267aaee6ce3572c4ba6ab2d9b30ebb0f9eca2e396cc3369408f9f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:34.910350Z","signature_b64":"ES5oMrSNnQmSoLX3xvlmHQRiEjJjj7KmLMSg5NId/FI/hfm1v0QOhDRxFBgOVB6AweU9cclmEbDnOfVlBsHzBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc1a72b54766b9e358c573686e97810b2d6e95cad3ef224221f261686351910d","last_reissued_at":"2026-05-18T03:36:34.909777Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:34.909777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rateless Resilient Network Coding Against Byzantine Adversaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hongyi Yao, Sidharth Jaggi, Tracey Ho, Wentao Huang","submitted_at":"2013-01-14T05:21:55Z","abstract_excerpt":"This paper considers rateless network error correction codes for reliable multicast in the presence of adversarial errors. Most existing network error correction codes are designed for a given network capacity and maximum number of errors known a priori to the encoder and decoder. However, in certain practical settings it may be necessary to operate without such a priori knowledge. We present rateless coding schemes for two adversarial models, where the source sends more redundancy over time, until decoding succeeds. The first model assumes there is a secret channel between the source and the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2860","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":"1301.2860","created_at":"2026-05-18T03:36:34.909887+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.2860v1","created_at":"2026-05-18T03:36:34.909887+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2860","created_at":"2026-05-18T03:36:34.909887+00:00"},{"alias_kind":"pith_short_12","alias_value":"XQNHFNKHM246","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"XQNHFNKHM246GWGF","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"XQNHFNKH","created_at":"2026-05-18T12:28:06.772260+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/XQNHFNKHM246GWGFONUG5F4BBM","json":"https://pith.science/pith/XQNHFNKHM246GWGFONUG5F4BBM.json","graph_json":"https://pith.science/api/pith-number/XQNHFNKHM246GWGFONUG5F4BBM/graph.json","events_json":"https://pith.science/api/pith-number/XQNHFNKHM246GWGFONUG5F4BBM/events.json","paper":"https://pith.science/paper/XQNHFNKH"},"agent_actions":{"view_html":"https://pith.science/pith/XQNHFNKHM246GWGFONUG5F4BBM","download_json":"https://pith.science/pith/XQNHFNKHM246GWGFONUG5F4BBM.json","view_paper":"https://pith.science/paper/XQNHFNKH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.2860&json=true","fetch_graph":"https://pith.science/api/pith-number/XQNHFNKHM246GWGFONUG5F4BBM/graph.json","fetch_events":"https://pith.science/api/pith-number/XQNHFNKHM246GWGFONUG5F4BBM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XQNHFNKHM246GWGFONUG5F4BBM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XQNHFNKHM246GWGFONUG5F4BBM/action/storage_attestation","attest_author":"https://pith.science/pith/XQNHFNKHM246GWGFONUG5F4BBM/action/author_attestation","sign_citation":"https://pith.science/pith/XQNHFNKHM246GWGFONUG5F4BBM/action/citation_signature","submit_replication":"https://pith.science/pith/XQNHFNKHM246GWGFONUG5F4BBM/action/replication_record"}},"created_at":"2026-05-18T03:36:34.909887+00:00","updated_at":"2026-05-18T03:36:34.909887+00:00"}