{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5BV5YCI4KRQSZSK2OECT46JIRF","short_pith_number":"pith:5BV5YCI4","canonical_record":{"source":{"id":"1810.02163","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-04T12:08:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f40d3fe944285995497972ed0e043e68e9d1e01aabcaeb55fba4066a876f38ad","abstract_canon_sha256":"243ebc3ce06de1e8c9b6a2985e6e42da438a59c10fc835cf59425739095a8b27"},"schema_version":"1.0"},"canonical_sha256":"e86bdc091c54612cc95a71053e7928895a787fd0ed541832039aa1ba834225da","source":{"kind":"arxiv","id":"1810.02163","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.02163","created_at":"2026-05-18T00:04:06Z"},{"alias_kind":"arxiv_version","alias_value":"1810.02163v1","created_at":"2026-05-18T00:04:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02163","created_at":"2026-05-18T00:04:06Z"},{"alias_kind":"pith_short_12","alias_value":"5BV5YCI4KRQS","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5BV5YCI4KRQSZSK2","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5BV5YCI4","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5BV5YCI4KRQSZSK2OECT46JIRF","target":"record","payload":{"canonical_record":{"source":{"id":"1810.02163","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-04T12:08:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f40d3fe944285995497972ed0e043e68e9d1e01aabcaeb55fba4066a876f38ad","abstract_canon_sha256":"243ebc3ce06de1e8c9b6a2985e6e42da438a59c10fc835cf59425739095a8b27"},"schema_version":"1.0"},"canonical_sha256":"e86bdc091c54612cc95a71053e7928895a787fd0ed541832039aa1ba834225da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:06.054198Z","signature_b64":"Zc8N1sskDOtjAD6ef1zJeddGVgiwgeTU/w4tLJVsRYcGlDQHqtHU2B3JxkPvdDS+C8NYi6Rlr74kmB8ghVmLAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e86bdc091c54612cc95a71053e7928895a787fd0ed541832039aa1ba834225da","last_reissued_at":"2026-05-18T00:04:06.053623Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:06.053623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.02163","source_version":1,"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:04:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5u87N8YrFksp/nDMFGtjldp0Hm/imCtsW7WK2MdIedSEI0gY6gPuiYxPuBUbmoNVZLP1KbNIJt945Ua/ZgxcDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:51:02.682357Z"},"content_sha256":"9ba5683243a1953bb53848618733a53b6d075042119d626218f09826b5dbb188","schema_version":"1.0","event_id":"sha256:9ba5683243a1953bb53848618733a53b6d075042119d626218f09826b5dbb188"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5BV5YCI4KRQSZSK2OECT46JIRF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Construction D$^\\prime$ Lattices from Quasi-Cyclic Low-Density Parity-Check Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Brian M. Kurkoski, Eirik Rosnes, Siyu Chen","submitted_at":"2018-10-04T12:08:44Z","abstract_excerpt":"Recently, Branco da Silva and Silva described an efficient encoding and decoding algorithm for Construction D$^\\prime$ lattices. Using their algorithm, we propose a Construction D$^\\prime$ lattice based on binary quasi-cyclic low-density parity-check (QC-LPDC) codes and single parity-check product codes. The underlying codes designed by the balanced-distances rule contribute in a balanced manner to the squared minimum distance of the constructed lattice, which results in a high lattice coding gain. The proposed lattice based on IEEE 802.16e QC-LDPC codes is shown to provide competitive error-r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02163","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"},"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:04:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TfibegAc8v4oyWeRqLwbLO4eMK3GnnycbhPSB+D8F31x0br7mgZhL3ySPtxfHfc0PNpK998fLdNCwn3VOF3qAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:51:02.682712Z"},"content_sha256":"138a1175357d26c9d7bfa712ba2b1db73e41dc09fb5d74648191eb14bed64546","schema_version":"1.0","event_id":"sha256:138a1175357d26c9d7bfa712ba2b1db73e41dc09fb5d74648191eb14bed64546"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5BV5YCI4KRQSZSK2OECT46JIRF/bundle.json","state_url":"https://pith.science/pith/5BV5YCI4KRQSZSK2OECT46JIRF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5BV5YCI4KRQSZSK2OECT46JIRF/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-01T06:51:02Z","links":{"resolver":"https://pith.science/pith/5BV5YCI4KRQSZSK2OECT46JIRF","bundle":"https://pith.science/pith/5BV5YCI4KRQSZSK2OECT46JIRF/bundle.json","state":"https://pith.science/pith/5BV5YCI4KRQSZSK2OECT46JIRF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5BV5YCI4KRQSZSK2OECT46JIRF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5BV5YCI4KRQSZSK2OECT46JIRF","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":"243ebc3ce06de1e8c9b6a2985e6e42da438a59c10fc835cf59425739095a8b27","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-04T12:08:44Z","title_canon_sha256":"f40d3fe944285995497972ed0e043e68e9d1e01aabcaeb55fba4066a876f38ad"},"schema_version":"1.0","source":{"id":"1810.02163","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.02163","created_at":"2026-05-18T00:04:06Z"},{"alias_kind":"arxiv_version","alias_value":"1810.02163v1","created_at":"2026-05-18T00:04:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02163","created_at":"2026-05-18T00:04:06Z"},{"alias_kind":"pith_short_12","alias_value":"5BV5YCI4KRQS","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5BV5YCI4KRQSZSK2","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5BV5YCI4","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:138a1175357d26c9d7bfa712ba2b1db73e41dc09fb5d74648191eb14bed64546","target":"graph","created_at":"2026-05-18T00:04:06Z","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":"Recently, Branco da Silva and Silva described an efficient encoding and decoding algorithm for Construction D$^\\prime$ lattices. Using their algorithm, we propose a Construction D$^\\prime$ lattice based on binary quasi-cyclic low-density parity-check (QC-LPDC) codes and single parity-check product codes. The underlying codes designed by the balanced-distances rule contribute in a balanced manner to the squared minimum distance of the constructed lattice, which results in a high lattice coding gain. The proposed lattice based on IEEE 802.16e QC-LDPC codes is shown to provide competitive error-r","authors_text":"Brian M. Kurkoski, Eirik Rosnes, Siyu Chen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-04T12:08:44Z","title":"Construction D$^\\prime$ Lattices from Quasi-Cyclic Low-Density Parity-Check Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02163","kind":"arxiv","version":1},"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:9ba5683243a1953bb53848618733a53b6d075042119d626218f09826b5dbb188","target":"record","created_at":"2026-05-18T00:04:06Z","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":"243ebc3ce06de1e8c9b6a2985e6e42da438a59c10fc835cf59425739095a8b27","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-04T12:08:44Z","title_canon_sha256":"f40d3fe944285995497972ed0e043e68e9d1e01aabcaeb55fba4066a876f38ad"},"schema_version":"1.0","source":{"id":"1810.02163","kind":"arxiv","version":1}},"canonical_sha256":"e86bdc091c54612cc95a71053e7928895a787fd0ed541832039aa1ba834225da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e86bdc091c54612cc95a71053e7928895a787fd0ed541832039aa1ba834225da","first_computed_at":"2026-05-18T00:04:06.053623Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:06.053623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Zc8N1sskDOtjAD6ef1zJeddGVgiwgeTU/w4tLJVsRYcGlDQHqtHU2B3JxkPvdDS+C8NYi6Rlr74kmB8ghVmLAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:06.054198Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.02163","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ba5683243a1953bb53848618733a53b6d075042119d626218f09826b5dbb188","sha256:138a1175357d26c9d7bfa712ba2b1db73e41dc09fb5d74648191eb14bed64546"],"state_sha256":"dc1d8d5be94c746a54560e99a27ca35cfa140fe8615a17e00c650e32160d88f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gsQm+O+6B/rfDOjutZSeadSNbaKZkdacJ4I+W1YmgF9GREy+kcOy7zdBsrcx0VspsT9+z4FAzt3gdrqyUCAtAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T06:51:02.684908Z","bundle_sha256":"08e1cf69ac0d41b1aa0d9b62f89107b743a745f19e3b0940471aad31511aab74"}}