{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:R3YVECNIHV2XT6BW3BYTNCLMGG","short_pith_number":"pith:R3YVECNI","schema_version":"1.0","canonical_sha256":"8ef15209a83d7579f836d87136896c319ab573f4e0372889da7d25af2dd144a3","source":{"kind":"arxiv","id":"2605.15950","version":1},"attestation_state":"computed","paper":{"title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","license":"http://creativecommons.org/licenses/by/4.0/","headline":"For in-block memory channels the optimal vectorized generalized nearest neighbor decoder admits an analytical characterization when Gaussian codebooks are employed.","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hao Wu, Shuqin Pang, Wenyi Zhang, Xinwei Li, Yuhao Liu","submitted_at":"2026-05-15T13:41:19Z","abstract_excerpt":"This work extends the generalized nearest neighbor decoding (GNND), originally developed as a receiver architecture for memoryless channels, to a vectorized GNND (Vec-GNND) suitable for in-block memory (IBM) channels. Leveraging the generalized mutual information (GMI) as an operational lower bound on the mismatch capacity, an analytical characterization of the optimal Vec-GNND is obtained for general IBM channels with Gaussian codebooks. The formalism further provides closed-form optimality conditions and achievable GMIs for restricted variants of the receiver architecture. Furthermore, we fo"},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.15950","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-15T13:41:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"520f5a959f6f0a75bc918b30c963dc4235b844a14b9a71d967403606e3818b56","abstract_canon_sha256":"15c7b8dce39ff727871642bf95e700bfd3f45e2d999c13c2bd7582ea5dabe180"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:46.299330Z","signature_b64":"rOhRg35cZ/iXRqGX3HAXkhYKmXDJv7muQmT6/dnGfNFvxoBdT3lNFCgIwIk9RY0HrLoxD+HwvJ643i9F8iE+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ef15209a83d7579f836d87136896c319ab573f4e0372889da7d25af2dd144a3","last_reissued_at":"2026-05-20T00:01:46.298684Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:46.298684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","license":"http://creativecommons.org/licenses/by/4.0/","headline":"For in-block memory channels the optimal vectorized generalized nearest neighbor decoder admits an analytical characterization when Gaussian codebooks are employed.","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hao Wu, Shuqin Pang, Wenyi Zhang, Xinwei Li, Yuhao Liu","submitted_at":"2026-05-15T13:41:19Z","abstract_excerpt":"This work extends the generalized nearest neighbor decoding (GNND), originally developed as a receiver architecture for memoryless channels, to a vectorized GNND (Vec-GNND) suitable for in-block memory (IBM) channels. Leveraging the generalized mutual information (GMI) as an operational lower bound on the mismatch capacity, an analytical characterization of the optimal Vec-GNND is obtained for general IBM channels with Gaussian codebooks. The formalism further provides closed-form optimality conditions and achievable GMIs for restricted variants of the receiver architecture. Furthermore, we fo"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Leveraging the generalized mutual information (GMI) as an operational lower bound on the mismatch capacity, an analytical characterization of the optimal Vec-GNND is obtained for general IBM channels with Gaussian codebooks. The formalism further provides closed-form optimality conditions and achievable GMIs for restricted variants of the receiver architecture.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That Gaussian codebooks are employed and that the GMI lower bound remains sufficiently tight to characterize optimality for the vectorized receiver on general IBM channels (abstract, paragraph 2).","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Vec-GNND yields closed-form optimality conditions and achievable GMIs for IBM channels with Gaussian codebooks, plus a GMI-based joint covariance-metric design that reduces to covariance optimization.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"For in-block memory channels the optimal vectorized generalized nearest neighbor decoder admits an analytical characterization when Gaussian codebooks are employed.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"3c892b6767c2f73bbd466379fdc205857a207f0d1f081b3daf7e5836bdca0f73"},"source":{"id":"2605.15950","kind":"arxiv","version":1},"verdict":{"id":"83a0c232-bb9a-4b66-bdd3-3bd810cd1d6c","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T19:28:17.182306Z","strongest_claim":"Leveraging the generalized mutual information (GMI) as an operational lower bound on the mismatch capacity, an analytical characterization of the optimal Vec-GNND is obtained for general IBM channels with Gaussian codebooks. The formalism further provides closed-form optimality conditions and achievable GMIs for restricted variants of the receiver architecture.","one_line_summary":"Vec-GNND yields closed-form optimality conditions and achievable GMIs for IBM channels with Gaussian codebooks, plus a GMI-based joint covariance-metric design that reduces to covariance optimization.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That Gaussian codebooks are employed and that the GMI lower bound remains sufficiently tight to characterize optimality for the vectorized receiver on general IBM channels (abstract, paragraph 2).","pith_extraction_headline":"For in-block memory channels the optimal vectorized generalized nearest neighbor decoder admits an analytical characterization when Gaussian codebooks are employed."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15950/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T20:01:19.110769Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T19:40:54.467657Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:44.881486Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T17:01:55.714709Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"a4b8d24bb96f97b859a2ac002385e90284eaee3680c0d08855403edc2dc87859"},"references":{"count":49,"sample":[{"doi":"","year":1948,"title":"A mathematical theory of communication,","work_id":"59e0a64d-9f40-470e-81bc-784fdf0fe462","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1965,"title":"I. M. Jacobs and J. Wozencraft,Principles of communication engineering.New York, NY , USA: Wiley, 1965","work_id":"669d7fcc-3141-4855-8ec4-2ca5dca70308","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2014,"title":"Massive MIMO systems with non-ideal hardware: Energy efficiency, estimation, and capacity limits,","work_id":"e71323e6-e8dc-43ac-ba5a-cfe483fe3b28","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2002,"title":"Reliable communication under channel uncertainty,","work_id":"59c82639-c0f0-4994-b5be-28f0af82f524","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2014,"title":"Mismatched decoding: Error exponents, second-order rates and saddlepoint approximations,","work_id":"c414331d-a491-4d0b-afb5-b32e0956fafd","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":49,"snapshot_sha256":"50b1afdbe8fddeee578d6b19000677c81868dd6883c629fe320dfc2bd67383eb","internal_anchors":0},"formal_canon":{"evidence_count":1,"snapshot_sha256":"72d59c91d5d2aba4b2dd66d4d558d7cbe218013eaebdf699fd89e6db8c117bcc"},"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":"2605.15950","created_at":"2026-05-20T00:01:46.298773+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.15950v1","created_at":"2026-05-20T00:01:46.298773+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15950","created_at":"2026-05-20T00:01:46.298773+00:00"},{"alias_kind":"pith_short_12","alias_value":"R3YVECNIHV2X","created_at":"2026-05-20T00:01:46.298773+00:00"},{"alias_kind":"pith_short_16","alias_value":"R3YVECNIHV2XT6BW","created_at":"2026-05-20T00:01:46.298773+00:00"},{"alias_kind":"pith_short_8","alias_value":"R3YVECNI","created_at":"2026-05-20T00:01:46.298773+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":1,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R3YVECNIHV2XT6BW3BYTNCLMGG","json":"https://pith.science/pith/R3YVECNIHV2XT6BW3BYTNCLMGG.json","graph_json":"https://pith.science/api/pith-number/R3YVECNIHV2XT6BW3BYTNCLMGG/graph.json","events_json":"https://pith.science/api/pith-number/R3YVECNIHV2XT6BW3BYTNCLMGG/events.json","paper":"https://pith.science/paper/R3YVECNI"},"agent_actions":{"view_html":"https://pith.science/pith/R3YVECNIHV2XT6BW3BYTNCLMGG","download_json":"https://pith.science/pith/R3YVECNIHV2XT6BW3BYTNCLMGG.json","view_paper":"https://pith.science/paper/R3YVECNI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.15950&json=true","fetch_graph":"https://pith.science/api/pith-number/R3YVECNIHV2XT6BW3BYTNCLMGG/graph.json","fetch_events":"https://pith.science/api/pith-number/R3YVECNIHV2XT6BW3BYTNCLMGG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R3YVECNIHV2XT6BW3BYTNCLMGG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R3YVECNIHV2XT6BW3BYTNCLMGG/action/storage_attestation","attest_author":"https://pith.science/pith/R3YVECNIHV2XT6BW3BYTNCLMGG/action/author_attestation","sign_citation":"https://pith.science/pith/R3YVECNIHV2XT6BW3BYTNCLMGG/action/citation_signature","submit_replication":"https://pith.science/pith/R3YVECNIHV2XT6BW3BYTNCLMGG/action/replication_record"}},"created_at":"2026-05-20T00:01:46.298773+00:00","updated_at":"2026-05-20T00:01:46.298773+00:00"}