{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MWOIYXHBPAYZHCSUVPZ7ID7Q6P","short_pith_number":"pith:MWOIYXHB","canonical_record":{"source":{"id":"1302.0459","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-03T05:46:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f9e5bfca08bbd1daa48609180d2c585a80c668a639de328f88161e54aee6a72d","abstract_canon_sha256":"3171909274f3b4bed9e465c8acc0fe30c43b848d4459669ffcb99ad9892a960a"},"schema_version":"1.0"},"canonical_sha256":"659c8c5ce17831938a54abf3f40ff0f3ffe29ffe88b0d661d3dc563883c15190","source":{"kind":"arxiv","id":"1302.0459","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.0459","created_at":"2026-05-18T03:34:37Z"},{"alias_kind":"arxiv_version","alias_value":"1302.0459v1","created_at":"2026-05-18T03:34:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0459","created_at":"2026-05-18T03:34:37Z"},{"alias_kind":"pith_short_12","alias_value":"MWOIYXHBPAYZ","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MWOIYXHBPAYZHCSU","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MWOIYXHB","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MWOIYXHBPAYZHCSUVPZ7ID7Q6P","target":"record","payload":{"canonical_record":{"source":{"id":"1302.0459","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-03T05:46:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f9e5bfca08bbd1daa48609180d2c585a80c668a639de328f88161e54aee6a72d","abstract_canon_sha256":"3171909274f3b4bed9e465c8acc0fe30c43b848d4459669ffcb99ad9892a960a"},"schema_version":"1.0"},"canonical_sha256":"659c8c5ce17831938a54abf3f40ff0f3ffe29ffe88b0d661d3dc563883c15190","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:37.123545Z","signature_b64":"Z3ApKe5fPZGJiQ0CMHRWC0tBolyb65sqpQVHw9YCmCwRyIE97rGlUu0VbGhhgKQXaLbiSA/eX8pMsuZQ0qF7Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"659c8c5ce17831938a54abf3f40ff0f3ffe29ffe88b0d661d3dc563883c15190","last_reissued_at":"2026-05-18T03:34:37.122972Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:37.122972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.0459","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-18T03:34:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ytuEKSVsobd2QxynhYNXy9OaO0N5drO1M5giIxhIAuab4OrbXanH+aN3v7yFIkF6loLVbKpVmaOz87LZgK6gCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:45:32.040004Z"},"content_sha256":"cec059dc27d961c3d3cc1007fb215d8b0b79ca6dd4dff452ff5eac1af5b22934","schema_version":"1.0","event_id":"sha256:cec059dc27d961c3d3cc1007fb215d8b0b79ca6dd4dff452ff5eac1af5b22934"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MWOIYXHBPAYZHCSUVPZ7ID7Q6P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the performance of 1-level LDPC lattices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amin Sakzad, Mohammad-Reza Sadeghi","submitted_at":"2013-02-03T05:46:20Z","abstract_excerpt":"The low-density parity-check (LDPC) lattices perform very well in high dimensions under generalized min-sum iterative decoding algorithm. In this work we focus on 1-level LDPC lattices. We show that these lattices are the same as lattices constructed based on Construction A and low-density lattice-code (LDLC) lattices. In spite of having slightly lower coding gain, 1-level regular LDPC lattices have remarkable performances. The lower complexity nature of the decoding algorithm for these type of lattices allows us to run it for higher dimensions easily. Our simulation results show that a 1-leve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0459","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-18T03:34:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DCHWhYsbQomJFQXhPaLh+LnZis0G/b9aDcPwXGnWLm7jdEJyj67NNjp2P94WFmekILJGso+MP4KDTX4H85bwBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:45:32.040786Z"},"content_sha256":"84fb0889506d892155539daa4c6f44b6539524503e5f0392fa3e58a7f7843e85","schema_version":"1.0","event_id":"sha256:84fb0889506d892155539daa4c6f44b6539524503e5f0392fa3e58a7f7843e85"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MWOIYXHBPAYZHCSUVPZ7ID7Q6P/bundle.json","state_url":"https://pith.science/pith/MWOIYXHBPAYZHCSUVPZ7ID7Q6P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MWOIYXHBPAYZHCSUVPZ7ID7Q6P/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-05-31T08:45:32Z","links":{"resolver":"https://pith.science/pith/MWOIYXHBPAYZHCSUVPZ7ID7Q6P","bundle":"https://pith.science/pith/MWOIYXHBPAYZHCSUVPZ7ID7Q6P/bundle.json","state":"https://pith.science/pith/MWOIYXHBPAYZHCSUVPZ7ID7Q6P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MWOIYXHBPAYZHCSUVPZ7ID7Q6P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MWOIYXHBPAYZHCSUVPZ7ID7Q6P","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":"3171909274f3b4bed9e465c8acc0fe30c43b848d4459669ffcb99ad9892a960a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-03T05:46:20Z","title_canon_sha256":"f9e5bfca08bbd1daa48609180d2c585a80c668a639de328f88161e54aee6a72d"},"schema_version":"1.0","source":{"id":"1302.0459","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.0459","created_at":"2026-05-18T03:34:37Z"},{"alias_kind":"arxiv_version","alias_value":"1302.0459v1","created_at":"2026-05-18T03:34:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0459","created_at":"2026-05-18T03:34:37Z"},{"alias_kind":"pith_short_12","alias_value":"MWOIYXHBPAYZ","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MWOIYXHBPAYZHCSU","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MWOIYXHB","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:84fb0889506d892155539daa4c6f44b6539524503e5f0392fa3e58a7f7843e85","target":"graph","created_at":"2026-05-18T03:34:37Z","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":"The low-density parity-check (LDPC) lattices perform very well in high dimensions under generalized min-sum iterative decoding algorithm. In this work we focus on 1-level LDPC lattices. We show that these lattices are the same as lattices constructed based on Construction A and low-density lattice-code (LDLC) lattices. In spite of having slightly lower coding gain, 1-level regular LDPC lattices have remarkable performances. The lower complexity nature of the decoding algorithm for these type of lattices allows us to run it for higher dimensions easily. Our simulation results show that a 1-leve","authors_text":"Amin Sakzad, Mohammad-Reza Sadeghi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-03T05:46:20Z","title":"On the performance of 1-level LDPC lattices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0459","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:cec059dc27d961c3d3cc1007fb215d8b0b79ca6dd4dff452ff5eac1af5b22934","target":"record","created_at":"2026-05-18T03:34:37Z","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":"3171909274f3b4bed9e465c8acc0fe30c43b848d4459669ffcb99ad9892a960a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-03T05:46:20Z","title_canon_sha256":"f9e5bfca08bbd1daa48609180d2c585a80c668a639de328f88161e54aee6a72d"},"schema_version":"1.0","source":{"id":"1302.0459","kind":"arxiv","version":1}},"canonical_sha256":"659c8c5ce17831938a54abf3f40ff0f3ffe29ffe88b0d661d3dc563883c15190","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"659c8c5ce17831938a54abf3f40ff0f3ffe29ffe88b0d661d3dc563883c15190","first_computed_at":"2026-05-18T03:34:37.122972Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:37.122972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z3ApKe5fPZGJiQ0CMHRWC0tBolyb65sqpQVHw9YCmCwRyIE97rGlUu0VbGhhgKQXaLbiSA/eX8pMsuZQ0qF7Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:37.123545Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.0459","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cec059dc27d961c3d3cc1007fb215d8b0b79ca6dd4dff452ff5eac1af5b22934","sha256:84fb0889506d892155539daa4c6f44b6539524503e5f0392fa3e58a7f7843e85"],"state_sha256":"f00774d6fffdd053c990c1d9f4a1abde5c0fe814aadc38b8723831d236d129d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3q0jKB9r3+fly/ONKSo1tKioRBXOpvWT+bxR2n8J6DVfLev4JQkxguWWyvD+iOjd6Z+oDAkJUdyb9fwjB32vAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T08:45:32.044794Z","bundle_sha256":"ae4a4fe460491821ba683863bbd243c0ee900d3fde2b1a5a37b6803bce516924"}}