{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YXXJGWIDHQ7N5BAOI5BOQ7BPYT","short_pith_number":"pith:YXXJGWID","schema_version":"1.0","canonical_sha256":"c5ee9359033c3ede840e4742e87c2fc4eccd6247a95ba920cdc29c318d7f7a46","source":{"kind":"arxiv","id":"1707.06688","version":4},"attestation_state":"computed","paper":{"title":"AWGN-Goodness is Enough: Capacity-Achieving Lattice Codes based on Dithered Probabilistic Shaping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Antonio Campello, Cong Ling, Daniel Dadush","submitted_at":"2017-07-20T19:33:19Z","abstract_excerpt":"In this paper we show that any sequence of infinite lattice constellations which is good for the unconstrained Gaussian channel can be shaped into a capacity-achieving sequence of codes for the power-constrained Gaussian channel under lattice decoding and non-uniform signalling. Unlike previous results in the literature, our scheme holds with no extra condition on the lattices (e.g. quantization-goodness or vanishing flatness factor), thus establishing a direct implication between AWGN-goodness, in the sense of Poltyrev, and capacity-achieving codes. Our analysis uses properties of the discret"},"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":"1707.06688","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-20T19:33:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1ae001406a8c7913a4dcf3077235cfa9f61b9e5c96b1b58db983d0c0955aabf4","abstract_canon_sha256":"b5f0fc3f2d365310d02ba78d52bdd2a25460de9138107056ac1c61167612d1e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:35.184478Z","signature_b64":"SHHA4wqf2AlPMvNzVLUNdD9WZlaAYnBLlG7EXpBzjhtqAXaVhDGilFqeUDbzOE7wZaPThDsjrLZrZmTtk9UMDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5ee9359033c3ede840e4742e87c2fc4eccd6247a95ba920cdc29c318d7f7a46","last_reissued_at":"2026-05-18T00:12:35.183866Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:35.183866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"AWGN-Goodness is Enough: Capacity-Achieving Lattice Codes based on Dithered Probabilistic Shaping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Antonio Campello, Cong Ling, Daniel Dadush","submitted_at":"2017-07-20T19:33:19Z","abstract_excerpt":"In this paper we show that any sequence of infinite lattice constellations which is good for the unconstrained Gaussian channel can be shaped into a capacity-achieving sequence of codes for the power-constrained Gaussian channel under lattice decoding and non-uniform signalling. Unlike previous results in the literature, our scheme holds with no extra condition on the lattices (e.g. quantization-goodness or vanishing flatness factor), thus establishing a direct implication between AWGN-goodness, in the sense of Poltyrev, and capacity-achieving codes. Our analysis uses properties of the discret"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06688","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":"1707.06688","created_at":"2026-05-18T00:12:35.183939+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.06688v4","created_at":"2026-05-18T00:12:35.183939+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06688","created_at":"2026-05-18T00:12:35.183939+00:00"},{"alias_kind":"pith_short_12","alias_value":"YXXJGWIDHQ7N","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"YXXJGWIDHQ7N5BAO","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"YXXJGWID","created_at":"2026-05-18T12:31:59.375834+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/YXXJGWIDHQ7N5BAOI5BOQ7BPYT","json":"https://pith.science/pith/YXXJGWIDHQ7N5BAOI5BOQ7BPYT.json","graph_json":"https://pith.science/api/pith-number/YXXJGWIDHQ7N5BAOI5BOQ7BPYT/graph.json","events_json":"https://pith.science/api/pith-number/YXXJGWIDHQ7N5BAOI5BOQ7BPYT/events.json","paper":"https://pith.science/paper/YXXJGWID"},"agent_actions":{"view_html":"https://pith.science/pith/YXXJGWIDHQ7N5BAOI5BOQ7BPYT","download_json":"https://pith.science/pith/YXXJGWIDHQ7N5BAOI5BOQ7BPYT.json","view_paper":"https://pith.science/paper/YXXJGWID","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.06688&json=true","fetch_graph":"https://pith.science/api/pith-number/YXXJGWIDHQ7N5BAOI5BOQ7BPYT/graph.json","fetch_events":"https://pith.science/api/pith-number/YXXJGWIDHQ7N5BAOI5BOQ7BPYT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YXXJGWIDHQ7N5BAOI5BOQ7BPYT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YXXJGWIDHQ7N5BAOI5BOQ7BPYT/action/storage_attestation","attest_author":"https://pith.science/pith/YXXJGWIDHQ7N5BAOI5BOQ7BPYT/action/author_attestation","sign_citation":"https://pith.science/pith/YXXJGWIDHQ7N5BAOI5BOQ7BPYT/action/citation_signature","submit_replication":"https://pith.science/pith/YXXJGWIDHQ7N5BAOI5BOQ7BPYT/action/replication_record"}},"created_at":"2026-05-18T00:12:35.183939+00:00","updated_at":"2026-05-18T00:12:35.183939+00:00"}