{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XQNHFNKHM246GWGFONUG5F4BBM","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":"aa19bb7de6267aaee6ce3572c4ba6ab2d9b30ebb0f9eca2e396cc3369408f9f9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-14T05:21:55Z","title_canon_sha256":"b89b62643444e827dfc74e2b298b098303e5262cf6e1d6959e0be75970a10003"},"schema_version":"1.0","source":{"id":"1301.2860","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.2860","created_at":"2026-05-18T03:36:34Z"},{"alias_kind":"arxiv_version","alias_value":"1301.2860v1","created_at":"2026-05-18T03:36:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2860","created_at":"2026-05-18T03:36:34Z"},{"alias_kind":"pith_short_12","alias_value":"XQNHFNKHM246","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XQNHFNKHM246GWGF","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XQNHFNKH","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:32736951ceff80d0d6f5ca8819256c384b740776accf3e2b02f08fa263afaf42","target":"graph","created_at":"2026-05-18T03:36:34Z","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":"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 ","authors_text":"Hongyi Yao, Sidharth Jaggi, Tracey Ho, Wentao Huang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-14T05:21:55Z","title":"Rateless Resilient Network Coding Against Byzantine Adversaries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2860","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:f78c7fbcecd57d2d16f09db740f3c678d6d969ce487d6159cf6e9ce259ab69c1","target":"record","created_at":"2026-05-18T03:36:34Z","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":"aa19bb7de6267aaee6ce3572c4ba6ab2d9b30ebb0f9eca2e396cc3369408f9f9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-14T05:21:55Z","title_canon_sha256":"b89b62643444e827dfc74e2b298b098303e5262cf6e1d6959e0be75970a10003"},"schema_version":"1.0","source":{"id":"1301.2860","kind":"arxiv","version":1}},"canonical_sha256":"bc1a72b54766b9e358c573686e97810b2d6e95cad3ef224221f261686351910d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc1a72b54766b9e358c573686e97810b2d6e95cad3ef224221f261686351910d","first_computed_at":"2026-05-18T03:36:34.909777Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:34.909777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ES5oMrSNnQmSoLX3xvlmHQRiEjJjj7KmLMSg5NId/FI/hfm1v0QOhDRxFBgOVB6AweU9cclmEbDnOfVlBsHzBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:34.910350Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.2860","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f78c7fbcecd57d2d16f09db740f3c678d6d969ce487d6159cf6e9ce259ab69c1","sha256:32736951ceff80d0d6f5ca8819256c384b740776accf3e2b02f08fa263afaf42"],"state_sha256":"3db25e38dccb6f6672765fb8c42aab4c8fb32b72c61d93771d56b39b166cfb11"}