{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:5X3QTZPD3CO6EUVGCAMIH3MAZJ","short_pith_number":"pith:5X3QTZPD","schema_version":"1.0","canonical_sha256":"edf709e5e3d89de252a6101883ed80ca6779156112b3d616869f6fb0a50296b6","source":{"kind":"arxiv","id":"0907.2984","version":4},"attestation_state":"computed","paper":{"title":"Fountain Communication using Concatenated Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jie Luo, Zheng Wang","submitted_at":"2009-07-17T06:08:18Z","abstract_excerpt":"This paper extends linear-complexity concatenated coding schemes to fountain communication over the discrete-time memoryless channel. Achievable fountain error exponents for one-level and multi-level concatenated fountain codes are derived. It is also shown that concatenated coding schemes possess interesting properties in several multi-user fountain communication scenarios."},"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":"0907.2984","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-07-17T06:08:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1d999eb6af5fa13b84f51c59c31ffa2f74860ffd90b0d2deba52c9f7fcf21691","abstract_canon_sha256":"890cf53fce22845bc294a06840188705f146bfa37a049dcd84ace2575f19a635"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:14.801684Z","signature_b64":"MHaQ4dYErBDn+m9zFFm/6M1lMObRXOORHylshH7+sttM204BtdPibfPdOEvVVhbxgt6hH/No0zRYnnc3yxkRCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edf709e5e3d89de252a6101883ed80ca6779156112b3d616869f6fb0a50296b6","last_reissued_at":"2026-05-18T04:20:14.801229Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:14.801229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fountain Communication using Concatenated Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jie Luo, Zheng Wang","submitted_at":"2009-07-17T06:08:18Z","abstract_excerpt":"This paper extends linear-complexity concatenated coding schemes to fountain communication over the discrete-time memoryless channel. Achievable fountain error exponents for one-level and multi-level concatenated fountain codes are derived. It is also shown that concatenated coding schemes possess interesting properties in several multi-user fountain communication scenarios."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0907.2984","kind":"arxiv","version":4},"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":"0907.2984","created_at":"2026-05-18T04:20:14.801294+00:00"},{"alias_kind":"arxiv_version","alias_value":"0907.2984v4","created_at":"2026-05-18T04:20:14.801294+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0907.2984","created_at":"2026-05-18T04:20:14.801294+00:00"},{"alias_kind":"pith_short_12","alias_value":"5X3QTZPD3CO6","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_16","alias_value":"5X3QTZPD3CO6EUVG","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_8","alias_value":"5X3QTZPD","created_at":"2026-05-18T12:25:58.837520+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/5X3QTZPD3CO6EUVGCAMIH3MAZJ","json":"https://pith.science/pith/5X3QTZPD3CO6EUVGCAMIH3MAZJ.json","graph_json":"https://pith.science/api/pith-number/5X3QTZPD3CO6EUVGCAMIH3MAZJ/graph.json","events_json":"https://pith.science/api/pith-number/5X3QTZPD3CO6EUVGCAMIH3MAZJ/events.json","paper":"https://pith.science/paper/5X3QTZPD"},"agent_actions":{"view_html":"https://pith.science/pith/5X3QTZPD3CO6EUVGCAMIH3MAZJ","download_json":"https://pith.science/pith/5X3QTZPD3CO6EUVGCAMIH3MAZJ.json","view_paper":"https://pith.science/paper/5X3QTZPD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0907.2984&json=true","fetch_graph":"https://pith.science/api/pith-number/5X3QTZPD3CO6EUVGCAMIH3MAZJ/graph.json","fetch_events":"https://pith.science/api/pith-number/5X3QTZPD3CO6EUVGCAMIH3MAZJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5X3QTZPD3CO6EUVGCAMIH3MAZJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5X3QTZPD3CO6EUVGCAMIH3MAZJ/action/storage_attestation","attest_author":"https://pith.science/pith/5X3QTZPD3CO6EUVGCAMIH3MAZJ/action/author_attestation","sign_citation":"https://pith.science/pith/5X3QTZPD3CO6EUVGCAMIH3MAZJ/action/citation_signature","submit_replication":"https://pith.science/pith/5X3QTZPD3CO6EUVGCAMIH3MAZJ/action/replication_record"}},"created_at":"2026-05-18T04:20:14.801294+00:00","updated_at":"2026-05-18T04:20:14.801294+00:00"}