{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:JED5UHJ4NEM2PNKMETDLZ5E7TC","short_pith_number":"pith:JED5UHJ4","schema_version":"1.0","canonical_sha256":"4907da1d3c6919a7b54c24c6bcf49f98b0be73e8a9a5e6da59c5d1d91222be75","source":{"kind":"arxiv","id":"1111.6244","version":1},"attestation_state":"computed","paper":{"title":"Efficient and Universal Corruption Resilient Fountain Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Asaf Cohen, Nir Tzachar, Shlomi Dolev","submitted_at":"2011-11-27T10:19:10Z","abstract_excerpt":"In this paper, we present a new family of fountain codes which overcome adversarial errors. That is, we consider the possibility that some portion of the arriving packets of a rateless erasure code are corrupted in an undetectable fashion. In practice, the corrupted packets may be attributed to a portion of the communication paths which are controlled by an adversary or to a portion of the sources that are malicious.\n  The presented codes resemble and extend LT and Raptor codes. Yet, their benefits over existing coding schemes are manifold. First, to overcome the corrupted packets, our codes u"},"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":"1111.6244","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-27T10:19:10Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"68b8c3cf1fdd8378e149d1c07ff975f674d8799045e659851c2288500313264e","abstract_canon_sha256":"cdc7bca2f49d2ff1742bc26534986d5d8c2157d3cf116ff30837d79f70bcb265"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:31.433136Z","signature_b64":"Dg1hpHB4QDqMQsKETj1nz4F0IXMwSqqDvEcz9iQbzYdUZpm+vEf3CBlyC29iOuFfI1+qyTsyGaEsYEj5ZzLaCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4907da1d3c6919a7b54c24c6bcf49f98b0be73e8a9a5e6da59c5d1d91222be75","last_reissued_at":"2026-05-18T04:07:31.432559Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:31.432559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient and Universal Corruption Resilient Fountain Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Asaf Cohen, Nir Tzachar, Shlomi Dolev","submitted_at":"2011-11-27T10:19:10Z","abstract_excerpt":"In this paper, we present a new family of fountain codes which overcome adversarial errors. That is, we consider the possibility that some portion of the arriving packets of a rateless erasure code are corrupted in an undetectable fashion. In practice, the corrupted packets may be attributed to a portion of the communication paths which are controlled by an adversary or to a portion of the sources that are malicious.\n  The presented codes resemble and extend LT and Raptor codes. Yet, their benefits over existing coding schemes are manifold. First, to overcome the corrupted packets, our codes u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.6244","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":"1111.6244","created_at":"2026-05-18T04:07:31.432638+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.6244v1","created_at":"2026-05-18T04:07:31.432638+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.6244","created_at":"2026-05-18T04:07:31.432638+00:00"},{"alias_kind":"pith_short_12","alias_value":"JED5UHJ4NEM2","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"JED5UHJ4NEM2PNKM","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"JED5UHJ4","created_at":"2026-05-18T12:26:32.869790+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/JED5UHJ4NEM2PNKMETDLZ5E7TC","json":"https://pith.science/pith/JED5UHJ4NEM2PNKMETDLZ5E7TC.json","graph_json":"https://pith.science/api/pith-number/JED5UHJ4NEM2PNKMETDLZ5E7TC/graph.json","events_json":"https://pith.science/api/pith-number/JED5UHJ4NEM2PNKMETDLZ5E7TC/events.json","paper":"https://pith.science/paper/JED5UHJ4"},"agent_actions":{"view_html":"https://pith.science/pith/JED5UHJ4NEM2PNKMETDLZ5E7TC","download_json":"https://pith.science/pith/JED5UHJ4NEM2PNKMETDLZ5E7TC.json","view_paper":"https://pith.science/paper/JED5UHJ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.6244&json=true","fetch_graph":"https://pith.science/api/pith-number/JED5UHJ4NEM2PNKMETDLZ5E7TC/graph.json","fetch_events":"https://pith.science/api/pith-number/JED5UHJ4NEM2PNKMETDLZ5E7TC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JED5UHJ4NEM2PNKMETDLZ5E7TC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JED5UHJ4NEM2PNKMETDLZ5E7TC/action/storage_attestation","attest_author":"https://pith.science/pith/JED5UHJ4NEM2PNKMETDLZ5E7TC/action/author_attestation","sign_citation":"https://pith.science/pith/JED5UHJ4NEM2PNKMETDLZ5E7TC/action/citation_signature","submit_replication":"https://pith.science/pith/JED5UHJ4NEM2PNKMETDLZ5E7TC/action/replication_record"}},"created_at":"2026-05-18T04:07:31.432638+00:00","updated_at":"2026-05-18T04:07:31.432638+00:00"}