{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:2YUXKR6XVCW6E7XXXADIABVIED","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":"5ae95333d52dee6c8a1b7fff2161eb80944843af26cf9b3d71c2042664494e52","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-01-08T06:51:30Z","title_canon_sha256":"d26c5d0cff6ece1999247be86a19a9c106fec1ddbca1dd83438d78a7cdc0b00f"},"schema_version":"1.0","source":{"id":"2501.04307","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.04307","created_at":"2026-07-05T09:58:33Z"},{"alias_kind":"arxiv_version","alias_value":"2501.04307v1","created_at":"2026-07-05T09:58:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.04307","created_at":"2026-07-05T09:58:33Z"},{"alias_kind":"pith_short_12","alias_value":"2YUXKR6XVCW6","created_at":"2026-07-05T09:58:33Z"},{"alias_kind":"pith_short_16","alias_value":"2YUXKR6XVCW6E7XX","created_at":"2026-07-05T09:58:33Z"},{"alias_kind":"pith_short_8","alias_value":"2YUXKR6X","created_at":"2026-07-05T09:58:33Z"}],"graph_snapshots":[{"event_id":"sha256:030ea9ce0ed75803e42501f763e19f2176f636352d6aca7422fc76b3da3fbe1a","target":"graph","created_at":"2026-07-05T09:58:33Z","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/2501.04307/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Lattice codes with optimal decoding coefficient are capacity-achieving when dimension $N \\rightarrow \\infty$. In communications systems, finite dimensional lattice codes are considered, where the optimal decoding coefficients may still fail decoding even when $R< C$. This paper presents a new retry decoding scheme for finite dimensional lattice-based transmissions. When decoding errors are detected, the receiver is allowed to adjust the value of decoding coefficients and retry decoding, instead of requesting a re-transmission immediately which causes high latency. This scheme is considered for","authors_text":"Brian M. Kurkoski, Jiajie Xue","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-01-08T06:51:30Z","title":"Finite Dimensional Lattice Codes with Self Error-Detection and Retry Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.04307","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:ba068d06510da2057e014fb260d7d9e80218269de0fb25b9070afa54cb21e758","target":"record","created_at":"2026-07-05T09:58:33Z","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":"5ae95333d52dee6c8a1b7fff2161eb80944843af26cf9b3d71c2042664494e52","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-01-08T06:51:30Z","title_canon_sha256":"d26c5d0cff6ece1999247be86a19a9c106fec1ddbca1dd83438d78a7cdc0b00f"},"schema_version":"1.0","source":{"id":"2501.04307","kind":"arxiv","version":1}},"canonical_sha256":"d6297547d7a8ade27ef7b8068006a820d0b1b0d9f50ab9372887bb22eeec586f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d6297547d7a8ade27ef7b8068006a820d0b1b0d9f50ab9372887bb22eeec586f","first_computed_at":"2026-07-05T09:58:33.094729Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:58:33.094729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LQgZKz6fqex7lOcMKCTGDS3VV/Oin/49zZr3+eh+O+pCAmvgwAYhWb6jG9uXrUqNbkBkmndN690R5QPofYLxCw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:58:33.095148Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.04307","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba068d06510da2057e014fb260d7d9e80218269de0fb25b9070afa54cb21e758","sha256:030ea9ce0ed75803e42501f763e19f2176f636352d6aca7422fc76b3da3fbe1a"],"state_sha256":"37cc4898ed3ba33edc15f962b6efc2fde3fa8e5b5c015d372df306485a2ed582"}