{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:ZXDALXKFF6G4OLUMN66P7ZCUD4","short_pith_number":"pith:ZXDALXKF","canonical_record":{"source":{"id":"2103.08263","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-03-15T10:27:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"dd839909a3b145d5fe334e1594cf38bf12aefef9bc745ca19238616c62b08a89","abstract_canon_sha256":"3e24332d5ea845dd3a8c52bb8f0e0ca6120aee8787f09c1d97e9068112bb6f2d"},"schema_version":"1.0"},"canonical_sha256":"cdc605dd452f8dc72e8c6fbcffe4541f3cf1f031676b2a5b8b9f8929460c08df","source":{"kind":"arxiv","id":"2103.08263","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.08263","created_at":"2026-07-05T03:44:28Z"},{"alias_kind":"arxiv_version","alias_value":"2103.08263v2","created_at":"2026-07-05T03:44:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.08263","created_at":"2026-07-05T03:44:28Z"},{"alias_kind":"pith_short_12","alias_value":"ZXDALXKFF6G4","created_at":"2026-07-05T03:44:28Z"},{"alias_kind":"pith_short_16","alias_value":"ZXDALXKFF6G4OLUM","created_at":"2026-07-05T03:44:28Z"},{"alias_kind":"pith_short_8","alias_value":"ZXDALXKF","created_at":"2026-07-05T03:44:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:ZXDALXKFF6G4OLUMN66P7ZCUD4","target":"record","payload":{"canonical_record":{"source":{"id":"2103.08263","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-03-15T10:27:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"dd839909a3b145d5fe334e1594cf38bf12aefef9bc745ca19238616c62b08a89","abstract_canon_sha256":"3e24332d5ea845dd3a8c52bb8f0e0ca6120aee8787f09c1d97e9068112bb6f2d"},"schema_version":"1.0"},"canonical_sha256":"cdc605dd452f8dc72e8c6fbcffe4541f3cf1f031676b2a5b8b9f8929460c08df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:44:28.878275Z","signature_b64":"C2eEgxRJG9AksqCSRZaS/u465qbyX9pnV1SgGPqGgSDgvRm05bqg+4+UfxLBA4sZnUNX1EOR/GgLdVuk6VZMBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdc605dd452f8dc72e8c6fbcffe4541f3cf1f031676b2a5b8b9f8929460c08df","last_reissued_at":"2026-07-05T03:44:28.877801Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:44:28.877801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2103.08263","source_version":2,"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-07-05T03:44:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KM1zD5d94bfjoemekx+ASf2v0ZukspINv+ZHmOskTAL+nvWt9Ludl8fUVYqcZngf4JkCjcvhcwGS9AyaB9z7Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T11:05:57.386209Z"},"content_sha256":"e750a7cea7573c022b46144f13af8aa9279efea4b9c665f1699576e415f57031","schema_version":"1.0","event_id":"sha256:e750a7cea7573c022b46144f13af8aa9279efea4b9c665f1699576e415f57031"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:ZXDALXKFF6G4OLUMN66P7ZCUD4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Construction D' Lattices for Power-Constrained Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Brian M. Kurkoski, Fan Zhou","submitted_at":"2021-03-15T10:27:27Z","abstract_excerpt":"Designs and methods for nested lattice codes using Construction D' lattices for coding and convolutional code lattices for shaping are described. Two encoding methods and a decoding algorithm for Construction D' coding lattices that can be used with shaping lattices for power-constrained channels are given. We construct nested lattice codes with good coding properties, a high shaping gain, and low-complexity encoding and decoding. Convolutional code generator polynomials for Construction A lattices with the greatest shaping gain are given, as a result of an extensive search. It is shown that r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.08263","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2103.08263/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:44:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vFMDFZYXBlklwqZuu15E4q0P3vucxDRJfGrG5zha8NO/hLMhlH6t7XPxbaWrUdv8bRSCjeCyllMjraYPRxhhDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T11:05:57.386714Z"},"content_sha256":"8874c921439a05439c0d30cd886e4f1ea835fb4ae2c28f845e4caa22a59f7e0e","schema_version":"1.0","event_id":"sha256:8874c921439a05439c0d30cd886e4f1ea835fb4ae2c28f845e4caa22a59f7e0e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZXDALXKFF6G4OLUMN66P7ZCUD4/bundle.json","state_url":"https://pith.science/pith/ZXDALXKFF6G4OLUMN66P7ZCUD4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZXDALXKFF6G4OLUMN66P7ZCUD4/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-08-14T11:05:57Z","links":{"resolver":"https://pith.science/pith/ZXDALXKFF6G4OLUMN66P7ZCUD4","bundle":"https://pith.science/pith/ZXDALXKFF6G4OLUMN66P7ZCUD4/bundle.json","state":"https://pith.science/pith/ZXDALXKFF6G4OLUMN66P7ZCUD4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZXDALXKFF6G4OLUMN66P7ZCUD4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:ZXDALXKFF6G4OLUMN66P7ZCUD4","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":"3e24332d5ea845dd3a8c52bb8f0e0ca6120aee8787f09c1d97e9068112bb6f2d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-03-15T10:27:27Z","title_canon_sha256":"dd839909a3b145d5fe334e1594cf38bf12aefef9bc745ca19238616c62b08a89"},"schema_version":"1.0","source":{"id":"2103.08263","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.08263","created_at":"2026-07-05T03:44:28Z"},{"alias_kind":"arxiv_version","alias_value":"2103.08263v2","created_at":"2026-07-05T03:44:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.08263","created_at":"2026-07-05T03:44:28Z"},{"alias_kind":"pith_short_12","alias_value":"ZXDALXKFF6G4","created_at":"2026-07-05T03:44:28Z"},{"alias_kind":"pith_short_16","alias_value":"ZXDALXKFF6G4OLUM","created_at":"2026-07-05T03:44:28Z"},{"alias_kind":"pith_short_8","alias_value":"ZXDALXKF","created_at":"2026-07-05T03:44:28Z"}],"graph_snapshots":[{"event_id":"sha256:8874c921439a05439c0d30cd886e4f1ea835fb4ae2c28f845e4caa22a59f7e0e","target":"graph","created_at":"2026-07-05T03:44:28Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2103.08263/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Designs and methods for nested lattice codes using Construction D' lattices for coding and convolutional code lattices for shaping are described. Two encoding methods and a decoding algorithm for Construction D' coding lattices that can be used with shaping lattices for power-constrained channels are given. We construct nested lattice codes with good coding properties, a high shaping gain, and low-complexity encoding and decoding. Convolutional code generator polynomials for Construction A lattices with the greatest shaping gain are given, as a result of an extensive search. It is shown that r","authors_text":"Brian M. Kurkoski, Fan Zhou","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-03-15T10:27:27Z","title":"Construction D' Lattices for Power-Constrained Communications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.08263","kind":"arxiv","version":2},"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:e750a7cea7573c022b46144f13af8aa9279efea4b9c665f1699576e415f57031","target":"record","created_at":"2026-07-05T03:44:28Z","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":"3e24332d5ea845dd3a8c52bb8f0e0ca6120aee8787f09c1d97e9068112bb6f2d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-03-15T10:27:27Z","title_canon_sha256":"dd839909a3b145d5fe334e1594cf38bf12aefef9bc745ca19238616c62b08a89"},"schema_version":"1.0","source":{"id":"2103.08263","kind":"arxiv","version":2}},"canonical_sha256":"cdc605dd452f8dc72e8c6fbcffe4541f3cf1f031676b2a5b8b9f8929460c08df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cdc605dd452f8dc72e8c6fbcffe4541f3cf1f031676b2a5b8b9f8929460c08df","first_computed_at":"2026-07-05T03:44:28.877801Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:44:28.877801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C2eEgxRJG9AksqCSRZaS/u465qbyX9pnV1SgGPqGgSDgvRm05bqg+4+UfxLBA4sZnUNX1EOR/GgLdVuk6VZMBw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:44:28.878275Z","signed_message":"canonical_sha256_bytes"},"source_id":"2103.08263","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e750a7cea7573c022b46144f13af8aa9279efea4b9c665f1699576e415f57031","sha256:8874c921439a05439c0d30cd886e4f1ea835fb4ae2c28f845e4caa22a59f7e0e"],"state_sha256":"52cb79778a9bb8426fd64702bc432f59643e7c954cd92d2fefb948040e067fc3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VX7jpoONS7W3GG+V1EKnJwj9I7TJLYkliCSWYoFnkTJKRB7fKt/TigjC5FGQaJpXv4I/t/rktcj5QBHaOONdAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T11:05:57.390530Z","bundle_sha256":"e2b2124f8040b4d0c07601286167ca42750473a463a32abfe5dfc1e92bfd185b"}}