{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:K2W3CVTSRONDLJSNO4Z4NEP37T","short_pith_number":"pith:K2W3CVTS","schema_version":"1.0","canonical_sha256":"56adb156728b9a35a64d7733c691fbfcd6c53f382a4ac17b87ea2d4d1195af57","source":{"kind":"arxiv","id":"1110.0252","version":1},"attestation_state":"computed","paper":{"title":"Universal Codes for the Gaussian MAC via Spatial Coupling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Arvind Yedla, Henry D. Pfister, Krishna R. Narayanan, Phong S. Nguyen","submitted_at":"2011-10-03T01:00:46Z","abstract_excerpt":"We consider transmission of two independent and separately encoded sources over a two-user binary-input Gaussian multiple-access channel. The channel gains are assumed to be unknown at the transmitter and the goal is to design an encoder-decoder pair that achieves reliable communication for all channel gains where this is theoretically possible. We call such a system \\emph{universal} with respect to the channel gains.\n  Kudekar et al. recently showed that terminated low-density parity-check convolutional codes (a.k.a. spatially-coupled low-density parity-check ensembles) have belief-propagatio"},"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":"1110.0252","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-10-03T01:00:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4e22c53519683669520a038ad4fac4585920dddbe20b96dbaa77261296bf301f","abstract_canon_sha256":"438c32671022af3811f930e9246e8dafed86a419f6eb2106634666400ecb7d52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:50.399978Z","signature_b64":"MJ//tI6NlHL29scDvEMvZ4jd868JTlMoVCkvTRlky3PiWVrtk4uul9qX7PrbM4U2SUJwgeM2vQZndeOV6XDKAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56adb156728b9a35a64d7733c691fbfcd6c53f382a4ac17b87ea2d4d1195af57","last_reissued_at":"2026-05-18T04:11:50.399301Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:50.399301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal Codes for the Gaussian MAC via Spatial Coupling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Arvind Yedla, Henry D. Pfister, Krishna R. Narayanan, Phong S. Nguyen","submitted_at":"2011-10-03T01:00:46Z","abstract_excerpt":"We consider transmission of two independent and separately encoded sources over a two-user binary-input Gaussian multiple-access channel. The channel gains are assumed to be unknown at the transmitter and the goal is to design an encoder-decoder pair that achieves reliable communication for all channel gains where this is theoretically possible. We call such a system \\emph{universal} with respect to the channel gains.\n  Kudekar et al. recently showed that terminated low-density parity-check convolutional codes (a.k.a. spatially-coupled low-density parity-check ensembles) have belief-propagatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.0252","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":"1110.0252","created_at":"2026-05-18T04:11:50.399425+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.0252v1","created_at":"2026-05-18T04:11:50.399425+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0252","created_at":"2026-05-18T04:11:50.399425+00:00"},{"alias_kind":"pith_short_12","alias_value":"K2W3CVTSROND","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"K2W3CVTSRONDLJSN","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"K2W3CVTS","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/K2W3CVTSRONDLJSNO4Z4NEP37T","json":"https://pith.science/pith/K2W3CVTSRONDLJSNO4Z4NEP37T.json","graph_json":"https://pith.science/api/pith-number/K2W3CVTSRONDLJSNO4Z4NEP37T/graph.json","events_json":"https://pith.science/api/pith-number/K2W3CVTSRONDLJSNO4Z4NEP37T/events.json","paper":"https://pith.science/paper/K2W3CVTS"},"agent_actions":{"view_html":"https://pith.science/pith/K2W3CVTSRONDLJSNO4Z4NEP37T","download_json":"https://pith.science/pith/K2W3CVTSRONDLJSNO4Z4NEP37T.json","view_paper":"https://pith.science/paper/K2W3CVTS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.0252&json=true","fetch_graph":"https://pith.science/api/pith-number/K2W3CVTSRONDLJSNO4Z4NEP37T/graph.json","fetch_events":"https://pith.science/api/pith-number/K2W3CVTSRONDLJSNO4Z4NEP37T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K2W3CVTSRONDLJSNO4Z4NEP37T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K2W3CVTSRONDLJSNO4Z4NEP37T/action/storage_attestation","attest_author":"https://pith.science/pith/K2W3CVTSRONDLJSNO4Z4NEP37T/action/author_attestation","sign_citation":"https://pith.science/pith/K2W3CVTSRONDLJSNO4Z4NEP37T/action/citation_signature","submit_replication":"https://pith.science/pith/K2W3CVTSRONDLJSNO4Z4NEP37T/action/replication_record"}},"created_at":"2026-05-18T04:11:50.399425+00:00","updated_at":"2026-05-18T04:11:50.399425+00:00"}