{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ZPKKDDE7IGHCTDHQ4FS472ROQ6","short_pith_number":"pith:ZPKKDDE7","schema_version":"1.0","canonical_sha256":"cbd4a18c9f418e298cf0e165cfea2e879ee5a6d8f102fb0a644267fe04cdea48","source":{"kind":"arxiv","id":"1202.1572","version":1},"attestation_state":"computed","paper":{"title":"Expansion coding: Achieving the capacity of an AEN channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hongbo Si, Kumar Appaiah, O. Ozan Koyluoglu, Sriram Vishwanath","submitted_at":"2012-02-08T01:27:09Z","abstract_excerpt":"A general method of coding over expansions is proposed, which allows one to reduce the highly non-trivial problem of coding over continuous channels to a much simpler discrete ones. More specifically, the focus is on the additive exponential noise (AEN) channel, for which the (binary) expansion of the (exponential) noise random variable is considered. It is shown that each of the random variables in the expansion corresponds to independent Bernoulli random variables. Thus, each of the expansion levels (of the underlying channel) corresponds to a binary symmetric channel (BSC), and the coding p"},"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":"1202.1572","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-08T01:27:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e9710be664f2903277654652ae46a76d6b003aea02cee29f338ce986f1393b82","abstract_canon_sha256":"30169974e476ff26b7b8c89e643fb4e606f0ebb92a44879f243f0bd893c268ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:51.993804Z","signature_b64":"Ceq9ELUDteTkBLRc7ic6ybDghaO6Hz8N7NnryljIhFdX+O4hWpLrlQqYhYHHPJS2aJ7n55o06exi51M3hFNBAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbd4a18c9f418e298cf0e165cfea2e879ee5a6d8f102fb0a644267fe04cdea48","last_reissued_at":"2026-05-18T04:02:51.992733Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:51.992733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Expansion coding: Achieving the capacity of an AEN channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hongbo Si, Kumar Appaiah, O. Ozan Koyluoglu, Sriram Vishwanath","submitted_at":"2012-02-08T01:27:09Z","abstract_excerpt":"A general method of coding over expansions is proposed, which allows one to reduce the highly non-trivial problem of coding over continuous channels to a much simpler discrete ones. More specifically, the focus is on the additive exponential noise (AEN) channel, for which the (binary) expansion of the (exponential) noise random variable is considered. It is shown that each of the random variables in the expansion corresponds to independent Bernoulli random variables. Thus, each of the expansion levels (of the underlying channel) corresponds to a binary symmetric channel (BSC), and the coding p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1572","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":"1202.1572","created_at":"2026-05-18T04:02:51.992963+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.1572v1","created_at":"2026-05-18T04:02:51.992963+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1572","created_at":"2026-05-18T04:02:51.992963+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZPKKDDE7IGHC","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZPKKDDE7IGHCTDHQ","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZPKKDDE7","created_at":"2026-05-18T12:27:30.460161+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/ZPKKDDE7IGHCTDHQ4FS472ROQ6","json":"https://pith.science/pith/ZPKKDDE7IGHCTDHQ4FS472ROQ6.json","graph_json":"https://pith.science/api/pith-number/ZPKKDDE7IGHCTDHQ4FS472ROQ6/graph.json","events_json":"https://pith.science/api/pith-number/ZPKKDDE7IGHCTDHQ4FS472ROQ6/events.json","paper":"https://pith.science/paper/ZPKKDDE7"},"agent_actions":{"view_html":"https://pith.science/pith/ZPKKDDE7IGHCTDHQ4FS472ROQ6","download_json":"https://pith.science/pith/ZPKKDDE7IGHCTDHQ4FS472ROQ6.json","view_paper":"https://pith.science/paper/ZPKKDDE7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.1572&json=true","fetch_graph":"https://pith.science/api/pith-number/ZPKKDDE7IGHCTDHQ4FS472ROQ6/graph.json","fetch_events":"https://pith.science/api/pith-number/ZPKKDDE7IGHCTDHQ4FS472ROQ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZPKKDDE7IGHCTDHQ4FS472ROQ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZPKKDDE7IGHCTDHQ4FS472ROQ6/action/storage_attestation","attest_author":"https://pith.science/pith/ZPKKDDE7IGHCTDHQ4FS472ROQ6/action/author_attestation","sign_citation":"https://pith.science/pith/ZPKKDDE7IGHCTDHQ4FS472ROQ6/action/citation_signature","submit_replication":"https://pith.science/pith/ZPKKDDE7IGHCTDHQ4FS472ROQ6/action/replication_record"}},"created_at":"2026-05-18T04:02:51.992963+00:00","updated_at":"2026-05-18T04:02:51.992963+00:00"}