{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:36ORLQMBFRA7JPSJHZ67WFFUG6","short_pith_number":"pith:36ORLQMB","schema_version":"1.0","canonical_sha256":"df9d15c1812c41f4be493e7dfb14b437a8a2160cc8d21b752071d23910bca82c","source":{"kind":"arxiv","id":"2501.04328","version":1},"attestation_state":"computed","paper":{"title":"Lower Bound on the Error Rate of Genie-Aided Lattice 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-08T08:01:44Z","abstract_excerpt":"A genie-aided decoder for finite dimensional lattice codes is considered. The decoder may exhaustively search through all possible scaling factors $\\alpha \\in \\mathbb{R}$. We show that this decoder can achieve lower word error rate (WER) than the one-shot decoder using $\\alpha_{MMSE}$ as a scaling factor. A lower bound on the WER for the decoder is found by considering the covering sphere of the lattice Voronoi region. The proposed decoder and the bound are valid for both power-constrained lattice codes and lattices. If the genie is applied at the decoder, E8 lattice code has 0.5 dB gain and B"},"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.04328","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-01-08T08:01:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"786c6d644fbe6e139b09fe72f37c335ce7ddb7a163d2a869ec71bb8607a44288","abstract_canon_sha256":"4cc61b16a92e84a6db4bcc38c05170063b2206c76180cdea47e2e0fbdea785cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:58:33.418024Z","signature_b64":"9tY5zGz25VX1kt6ohc0VoxUPcu4/LHlZiJO59/Ix6MmvN3kV6ZYm2vYNr8np2cyGiFMeY5DvidyhLT/Fe9qiAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df9d15c1812c41f4be493e7dfb14b437a8a2160cc8d21b752071d23910bca82c","last_reissued_at":"2026-07-05T09:58:33.417620Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:58:33.417620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bound on the Error Rate of Genie-Aided Lattice 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-08T08:01:44Z","abstract_excerpt":"A genie-aided decoder for finite dimensional lattice codes is considered. The decoder may exhaustively search through all possible scaling factors $\\alpha \\in \\mathbb{R}$. We show that this decoder can achieve lower word error rate (WER) than the one-shot decoder using $\\alpha_{MMSE}$ as a scaling factor. A lower bound on the WER for the decoder is found by considering the covering sphere of the lattice Voronoi region. The proposed decoder and the bound are valid for both power-constrained lattice codes and lattices. If the genie is applied at the decoder, E8 lattice code has 0.5 dB gain and B"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.04328","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.04328/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.04328","created_at":"2026-07-05T09:58:33.417676+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.04328v1","created_at":"2026-07-05T09:58:33.417676+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.04328","created_at":"2026-07-05T09:58:33.417676+00:00"},{"alias_kind":"pith_short_12","alias_value":"36ORLQMBFRA7","created_at":"2026-07-05T09:58:33.417676+00:00"},{"alias_kind":"pith_short_16","alias_value":"36ORLQMBFRA7JPSJ","created_at":"2026-07-05T09:58:33.417676+00:00"},{"alias_kind":"pith_short_8","alias_value":"36ORLQMB","created_at":"2026-07-05T09:58:33.417676+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20971","citing_title":"UNITY: Attention Flow Networks for Adaptive Conditioning in Diffusion","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/36ORLQMBFRA7JPSJHZ67WFFUG6","json":"https://pith.science/pith/36ORLQMBFRA7JPSJHZ67WFFUG6.json","graph_json":"https://pith.science/api/pith-number/36ORLQMBFRA7JPSJHZ67WFFUG6/graph.json","events_json":"https://pith.science/api/pith-number/36ORLQMBFRA7JPSJHZ67WFFUG6/events.json","paper":"https://pith.science/paper/36ORLQMB"},"agent_actions":{"view_html":"https://pith.science/pith/36ORLQMBFRA7JPSJHZ67WFFUG6","download_json":"https://pith.science/pith/36ORLQMBFRA7JPSJHZ67WFFUG6.json","view_paper":"https://pith.science/paper/36ORLQMB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.04328&json=true","fetch_graph":"https://pith.science/api/pith-number/36ORLQMBFRA7JPSJHZ67WFFUG6/graph.json","fetch_events":"https://pith.science/api/pith-number/36ORLQMBFRA7JPSJHZ67WFFUG6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/36ORLQMBFRA7JPSJHZ67WFFUG6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/36ORLQMBFRA7JPSJHZ67WFFUG6/action/storage_attestation","attest_author":"https://pith.science/pith/36ORLQMBFRA7JPSJHZ67WFFUG6/action/author_attestation","sign_citation":"https://pith.science/pith/36ORLQMBFRA7JPSJHZ67WFFUG6/action/citation_signature","submit_replication":"https://pith.science/pith/36ORLQMBFRA7JPSJHZ67WFFUG6/action/replication_record"}},"created_at":"2026-07-05T09:58:33.417676+00:00","updated_at":"2026-07-05T09:58:33.417676+00:00"}