{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YXXJGWIDHQ7N5BAOI5BOQ7BPYT","short_pith_number":"pith:YXXJGWID","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"},"canonical_sha256":"c5ee9359033c3ede840e4742e87c2fc4eccd6247a95ba920cdc29c318d7f7a46","source":{"kind":"arxiv","id":"1707.06688","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.06688","created_at":"2026-05-18T00:12:35Z"},{"alias_kind":"arxiv_version","alias_value":"1707.06688v4","created_at":"2026-05-18T00:12:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06688","created_at":"2026-05-18T00:12:35Z"},{"alias_kind":"pith_short_12","alias_value":"YXXJGWIDHQ7N","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"YXXJGWIDHQ7N5BAO","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"YXXJGWID","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YXXJGWIDHQ7N5BAOI5BOQ7BPYT","target":"record","payload":{"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"},"canonical_sha256":"c5ee9359033c3ede840e4742e87c2fc4eccd6247a95ba920cdc29c318d7f7a46","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"},"source_kind":"arxiv","source_id":"1707.06688","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:12:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uF5y+SIyx2E03hcjAdYAFfkfW7vEroTiE759HV/UgfMHcPPs//BYDfz8634vNVrqVeMgw1NdYN3isWcesW3yDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T22:30:36.401599Z"},"content_sha256":"b18a4c2a02a84cff2ae85dc6090ada1fb8552e3c12559d6b01f2dc06a2040118","schema_version":"1.0","event_id":"sha256:b18a4c2a02a84cff2ae85dc6090ada1fb8552e3c12559d6b01f2dc06a2040118"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YXXJGWIDHQ7N5BAOI5BOQ7BPYT","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:12:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eGGbFtCAwrhoYyRbzJrx5h8D/a2PWrkNsJd0DH2aZjZ17vTPAqoD+elqe5pvjLrzzjbUEmbLAsCdG3QaYwb0CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T22:30:36.401932Z"},"content_sha256":"4e06c465a57c0a74edf177f58e55d83a8696d6533da16e77a353e87c740e2d21","schema_version":"1.0","event_id":"sha256:4e06c465a57c0a74edf177f58e55d83a8696d6533da16e77a353e87c740e2d21"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YXXJGWIDHQ7N5BAOI5BOQ7BPYT/bundle.json","state_url":"https://pith.science/pith/YXXJGWIDHQ7N5BAOI5BOQ7BPYT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YXXJGWIDHQ7N5BAOI5BOQ7BPYT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-26T22:30:36Z","links":{"resolver":"https://pith.science/pith/YXXJGWIDHQ7N5BAOI5BOQ7BPYT","bundle":"https://pith.science/pith/YXXJGWIDHQ7N5BAOI5BOQ7BPYT/bundle.json","state":"https://pith.science/pith/YXXJGWIDHQ7N5BAOI5BOQ7BPYT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YXXJGWIDHQ7N5BAOI5BOQ7BPYT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YXXJGWIDHQ7N5BAOI5BOQ7BPYT","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b5f0fc3f2d365310d02ba78d52bdd2a25460de9138107056ac1c61167612d1e6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-20T19:33:19Z","title_canon_sha256":"1ae001406a8c7913a4dcf3077235cfa9f61b9e5c96b1b58db983d0c0955aabf4"},"schema_version":"1.0","source":{"id":"1707.06688","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.06688","created_at":"2026-05-18T00:12:35Z"},{"alias_kind":"arxiv_version","alias_value":"1707.06688v4","created_at":"2026-05-18T00:12:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06688","created_at":"2026-05-18T00:12:35Z"},{"alias_kind":"pith_short_12","alias_value":"YXXJGWIDHQ7N","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"YXXJGWIDHQ7N5BAO","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"YXXJGWID","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:4e06c465a57c0a74edf177f58e55d83a8696d6533da16e77a353e87c740e2d21","target":"graph","created_at":"2026-05-18T00:12:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Antonio Campello, Cong Ling, Daniel Dadush","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-20T19:33:19Z","title":"AWGN-Goodness is Enough: Capacity-Achieving Lattice Codes based on Dithered Probabilistic Shaping"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06688","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b18a4c2a02a84cff2ae85dc6090ada1fb8552e3c12559d6b01f2dc06a2040118","target":"record","created_at":"2026-05-18T00:12:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b5f0fc3f2d365310d02ba78d52bdd2a25460de9138107056ac1c61167612d1e6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-20T19:33:19Z","title_canon_sha256":"1ae001406a8c7913a4dcf3077235cfa9f61b9e5c96b1b58db983d0c0955aabf4"},"schema_version":"1.0","source":{"id":"1707.06688","kind":"arxiv","version":4}},"canonical_sha256":"c5ee9359033c3ede840e4742e87c2fc4eccd6247a95ba920cdc29c318d7f7a46","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c5ee9359033c3ede840e4742e87c2fc4eccd6247a95ba920cdc29c318d7f7a46","first_computed_at":"2026-05-18T00:12:35.183866Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:35.183866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SHHA4wqf2AlPMvNzVLUNdD9WZlaAYnBLlG7EXpBzjhtqAXaVhDGilFqeUDbzOE7wZaPThDsjrLZrZmTtk9UMDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:35.184478Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.06688","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b18a4c2a02a84cff2ae85dc6090ada1fb8552e3c12559d6b01f2dc06a2040118","sha256:4e06c465a57c0a74edf177f58e55d83a8696d6533da16e77a353e87c740e2d21"],"state_sha256":"c5bcd5921326d1d3aa488e5a5f8fb2de82b18ea3d03865546e8ba61ed73bef5a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kxGsrgBbzQHMnrynunBG7XRROswvaR2Trf2yDnQAlKQFNPmHLT9hyHUQEXfC2uvTeFVsURQ0kMTkJiyXUYKWAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T22:30:36.403849Z","bundle_sha256":"71b22be07fef309f246205803c4b60b3eb41fb72ac602ea6201608e6a3ea192a"}}