{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:STJ2KSIR6DUTTKEMFKOUNEDRTY","short_pith_number":"pith:STJ2KSIR","schema_version":"1.0","canonical_sha256":"94d3a54911f0e939a88c2a9d4690719e32c61c24deb2049a764bfaa8416d2c60","source":{"kind":"arxiv","id":"0708.2575","version":2},"attestation_state":"computed","paper":{"title":"Rateless Coding for Gaussian Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gregory W. Wornell, Mitchell D. Trott, Uri Erez","submitted_at":"2007-08-20T01:32:42Z","abstract_excerpt":"A rateless code-i.e., a rate-compatible family of codes-has the property that codewords of the higher rate codes are prefixes of those of the lower rate ones. A perfect family of such codes is one in which each of the codes in the family is capacity-achieving. We show by construction that perfect rateless codes with low-complexity decoding algorithms exist for additive white Gaussian noise channels. Our construction involves the use of layered encoding and successive decoding, together with repetition using time-varying layer weights. As an illustration of our framework, we design a practical "},"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":"0708.2575","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2007-08-20T01:32:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"87da3c34958bbe596facd719e6b2253c43c9b3e63809382f37884b9f1bd8dff4","abstract_canon_sha256":"51bf04dd7d817f4177096c27bc55e7b8419c9105ba73a10ece2d4116d2ba669c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:39.515678Z","signature_b64":"HiMegothb6jCBljSBZJMfApU0x1oAIMyFb+kWux92yD0b4WoJqZcs4BRV1KqqX/TjOTIOybI66XvU7oFthLoDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94d3a54911f0e939a88c2a9d4690719e32c61c24deb2049a764bfaa8416d2c60","last_reissued_at":"2026-05-18T04:20:39.514956Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:39.514956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rateless Coding for Gaussian Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gregory W. Wornell, Mitchell D. Trott, Uri Erez","submitted_at":"2007-08-20T01:32:42Z","abstract_excerpt":"A rateless code-i.e., a rate-compatible family of codes-has the property that codewords of the higher rate codes are prefixes of those of the lower rate ones. A perfect family of such codes is one in which each of the codes in the family is capacity-achieving. We show by construction that perfect rateless codes with low-complexity decoding algorithms exist for additive white Gaussian noise channels. Our construction involves the use of layered encoding and successive decoding, together with repetition using time-varying layer weights. As an illustration of our framework, we design a practical "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0708.2575","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":"0708.2575","created_at":"2026-05-18T04:20:39.515066+00:00"},{"alias_kind":"arxiv_version","alias_value":"0708.2575v2","created_at":"2026-05-18T04:20:39.515066+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0708.2575","created_at":"2026-05-18T04:20:39.515066+00:00"},{"alias_kind":"pith_short_12","alias_value":"STJ2KSIR6DUT","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"STJ2KSIR6DUTTKEM","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"STJ2KSIR","created_at":"2026-05-18T12:25:56.245647+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/STJ2KSIR6DUTTKEMFKOUNEDRTY","json":"https://pith.science/pith/STJ2KSIR6DUTTKEMFKOUNEDRTY.json","graph_json":"https://pith.science/api/pith-number/STJ2KSIR6DUTTKEMFKOUNEDRTY/graph.json","events_json":"https://pith.science/api/pith-number/STJ2KSIR6DUTTKEMFKOUNEDRTY/events.json","paper":"https://pith.science/paper/STJ2KSIR"},"agent_actions":{"view_html":"https://pith.science/pith/STJ2KSIR6DUTTKEMFKOUNEDRTY","download_json":"https://pith.science/pith/STJ2KSIR6DUTTKEMFKOUNEDRTY.json","view_paper":"https://pith.science/paper/STJ2KSIR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0708.2575&json=true","fetch_graph":"https://pith.science/api/pith-number/STJ2KSIR6DUTTKEMFKOUNEDRTY/graph.json","fetch_events":"https://pith.science/api/pith-number/STJ2KSIR6DUTTKEMFKOUNEDRTY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/STJ2KSIR6DUTTKEMFKOUNEDRTY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/STJ2KSIR6DUTTKEMFKOUNEDRTY/action/storage_attestation","attest_author":"https://pith.science/pith/STJ2KSIR6DUTTKEMFKOUNEDRTY/action/author_attestation","sign_citation":"https://pith.science/pith/STJ2KSIR6DUTTKEMFKOUNEDRTY/action/citation_signature","submit_replication":"https://pith.science/pith/STJ2KSIR6DUTTKEMFKOUNEDRTY/action/replication_record"}},"created_at":"2026-05-18T04:20:39.515066+00:00","updated_at":"2026-05-18T04:20:39.515066+00:00"}