{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:2YUXKR6XVCW6E7XXXADIABVIED","short_pith_number":"pith:2YUXKR6X","schema_version":"1.0","canonical_sha256":"d6297547d7a8ade27ef7b8068006a820d0b1b0d9f50ab9372887bb22eeec586f","source":{"kind":"arxiv","id":"2501.04307","version":1},"attestation_state":"computed","paper":{"title":"Finite Dimensional Lattice Codes with Self Error-Detection and Retry Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Brian M. Kurkoski, Jiajie Xue","submitted_at":"2025-01-08T06:51:30Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2501.04307","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-01-08T06:51:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d26c5d0cff6ece1999247be86a19a9c106fec1ddbca1dd83438d78a7cdc0b00f","abstract_canon_sha256":"5ae95333d52dee6c8a1b7fff2161eb80944843af26cf9b3d71c2042664494e52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:58:33.095148Z","signature_b64":"LQgZKz6fqex7lOcMKCTGDS3VV/Oin/49zZr3+eh+O+pCAmvgwAYhWb6jG9uXrUqNbkBkmndN690R5QPofYLxCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6297547d7a8ade27ef7b8068006a820d0b1b0d9f50ab9372887bb22eeec586f","last_reissued_at":"2026-07-05T09:58:33.094729Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:58:33.094729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finite Dimensional Lattice Codes with Self Error-Detection and Retry Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Brian M. Kurkoski, Jiajie Xue","submitted_at":"2025-01-08T06:51:30Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.04307","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.04307/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2501.04307","created_at":"2026-07-05T09:58:33.094785+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.04307v1","created_at":"2026-07-05T09:58:33.094785+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.04307","created_at":"2026-07-05T09:58:33.094785+00:00"},{"alias_kind":"pith_short_12","alias_value":"2YUXKR6XVCW6","created_at":"2026-07-05T09:58:33.094785+00:00"},{"alias_kind":"pith_short_16","alias_value":"2YUXKR6XVCW6E7XX","created_at":"2026-07-05T09:58:33.094785+00:00"},{"alias_kind":"pith_short_8","alias_value":"2YUXKR6X","created_at":"2026-07-05T09:58:33.094785+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2YUXKR6XVCW6E7XXXADIABVIED","json":"https://pith.science/pith/2YUXKR6XVCW6E7XXXADIABVIED.json","graph_json":"https://pith.science/api/pith-number/2YUXKR6XVCW6E7XXXADIABVIED/graph.json","events_json":"https://pith.science/api/pith-number/2YUXKR6XVCW6E7XXXADIABVIED/events.json","paper":"https://pith.science/paper/2YUXKR6X"},"agent_actions":{"view_html":"https://pith.science/pith/2YUXKR6XVCW6E7XXXADIABVIED","download_json":"https://pith.science/pith/2YUXKR6XVCW6E7XXXADIABVIED.json","view_paper":"https://pith.science/paper/2YUXKR6X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.04307&json=true","fetch_graph":"https://pith.science/api/pith-number/2YUXKR6XVCW6E7XXXADIABVIED/graph.json","fetch_events":"https://pith.science/api/pith-number/2YUXKR6XVCW6E7XXXADIABVIED/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2YUXKR6XVCW6E7XXXADIABVIED/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2YUXKR6XVCW6E7XXXADIABVIED/action/storage_attestation","attest_author":"https://pith.science/pith/2YUXKR6XVCW6E7XXXADIABVIED/action/author_attestation","sign_citation":"https://pith.science/pith/2YUXKR6XVCW6E7XXXADIABVIED/action/citation_signature","submit_replication":"https://pith.science/pith/2YUXKR6XVCW6E7XXXADIABVIED/action/replication_record"}},"created_at":"2026-07-05T09:58:33.094785+00:00","updated_at":"2026-07-05T09:58:33.094785+00:00"}