{"as_of":"2026-08-05T21:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:626430c6e309f9cccc1698fd3f9db32d707d49abef5de53217132cc0f5a560c8","coverage":[{"denominator":49,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":49,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-19T19:32:17.111430Z","state":"measured"},{"denominator":49,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":49,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2605.15950/citation-record","integrity":"/paper/2605.15950/integrity","json":"/paper/2605.15950/citation-record.json","paper":"/paper/2605.15950"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A mathematical theory of communication","venue":null,"work_id":"59e0a64d-9f40-470e-81bc-784fdf0fe462","year":1948},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:9a9706caf979d9e4977fba89a55ead2f0cf40e7783530285e42c7cccdeabcb11","observation_id":"4e7a7905-9e58-4062-b5ae-3a24617408c9","resolution":{"observed_at":"2026-05-19T19:32:43.902524Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"669d7fcc-3141-4855-8ec4-2ca5dca70308","year":1965},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:b29e45790e295cc68be1ae585fbef52e769a37652bfa6e1ba22193f4451a68f3","observation_id":"230dd3f0-0d72-4010-9028-e5b98d3d5017","resolution":{"observed_at":"2026-05-19T19:32:43.915572Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Massive MIMO systems with non-ideal hardware: Energy efficiency, estimation, and capacity limits","venue":null,"work_id":"e71323e6-e8dc-43ac-ba5a-cfe483fe3b28","year":2014},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:d6c291eb6cc86fe56072403965dd597fed01388de38547df0ab8c0b1d2c2e51c","observation_id":"555c61bd-5330-4008-87de-aeba53d58dae","resolution":{"observed_at":"2026-05-19T19:32:43.825930Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Reliable communication under channel uncertainty","venue":null,"work_id":"59c82639-c0f0-4994-b5be-28f0af82f524","year":2002},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:3f4ad8cbce4d86b58bc1c234956b14f04b963a19c0b4d88296132ad543a2ad2a","observation_id":"2fce2bde-b218-47fe-9d28-ab8eaa920b07","resolution":{"observed_at":"2026-05-19T19:32:43.863386Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Mismatched decoding: Error exponents, second-order rates and saddlepoint approximations","venue":null,"work_id":"c414331d-a491-4d0b-afb5-b32e0956fafd","year":2014},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:1e568bc3182f9f85d079c28a33dc058c6a1758bff240f185445efc3efc125d45","observation_id":"d23474b3-ccac-43cd-a231-f0a02b0205c3","resolution":{"observed_at":"2026-05-19T19:32:43.881424Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On information rates for mismatched decoders","venue":null,"work_id":"8faeebf4-6ae8-4317-bdeb-3183cc0580f9","year":1953},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:999987d23d6b02c0b7af503925e90e53a01478128033e920ef88c702cdb19296","observation_id":"c68acbbe-68ef-474e-bb43-17b1a4f3a826","resolution":{"observed_at":"2026-05-19T19:32:43.911920Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Channel capacity for a given decoding metric","venue":null,"work_id":"31767cf4-e6b9-4014-9734-6f0805f7eecc","year":2002},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:cb6221a2a28708a0809541ded00076dafe7e3299961169f390ae668485770a06","observation_id":"9e3dd42e-6a05-4388-8e17-797aca609525","resolution":{"observed_at":"2026-05-19T19:32:43.871606Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Information-theoretic foundations of mismatched decoding","venue":null,"work_id":"5cdf7b6a-6fdb-42a0-8359-d1bf95185823","year":2020},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:617a58433ebe5c6c5cf22d48bd44a1802ef6ac73c3496fdb2e26283471b66d72","observation_id":"f6e44941-6d92-43ad-944b-cc2ed96c5e6f","resolution":{"observed_at":"2026-05-19T19:32:43.869796Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Some remarks on the role of inaccuracy in Shannon’s theory of information transmission","venue":null,"work_id":"2bf4860e-9254-416d-867e-6172b37b5ec5","year":1978},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:d9be5a0eca0652fdad9a4cbd60d05f21aa54a9177c717d828245e4598b89e04b","observation_id":"d4223d72-2b48-4f90-ac80-d3b5473ed085","resolution":{"observed_at":"2026-05-19T19:32:43.900586Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On information rates of compound channels","venue":null,"work_id":"4f7c3b3b-8948-4fd3-8f96-9f4483d5ff2d","year":1991},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:af753b3e2ad0e2a448b062799d18ac27229b4f6f68882b5036de0d70d86b125a","observation_id":"e14799a7-6931-41e5-a2b0-12f012eaa498","resolution":{"observed_at":"2026-05-19T19:32:43.873532Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Achievable information rates for fiber optics: Applications and computations","venue":null,"work_id":"5f66c56a-ee61-4f55-b6fb-567d0cfdc970","year":2018},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:bc39185182bdd52f8b32aee83cc378c2c80a470cb41d94bac281aaae7b9ec65d","observation_id":"7b46b51d-b3b7-428b-b069-b7260f3e23a6","resolution":{"observed_at":"2026-05-19T19:32:43.859360Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Constellation design with geometric and probabilistic shaping","venue":null,"work_id":"dd4e65cc-505c-459c-8e11-4f397fca91d7","year":2017},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:8584a759005cfd6ec8ab6bd6bbdc6b971fd4ed10378f4368d15c3bb74fa70cfb","observation_id":"2aa05374-0cca-48fb-862d-621b93c36273","resolution":{"observed_at":"2026-05-19T19:32:43.844884Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"End-to-end learning for GMI-optimized geometric constellation shape","venue":null,"work_id":"1c8e45ba-8f15-48c3-b01d-e3e64967a14b","year":2019},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:95fcfbd1b554282a568b9f5f81dbcecb53689fb4e8d41e4ede3d9dc5dbbdd46f","observation_id":"53491a95-df72-4a17-9900-e4c4ef779af6","resolution":{"observed_at":"2026-05-19T19:32:43.822022Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"GMI-maximizing constellation design with Grassmann projection for parametric shaping","venue":null,"work_id":"fbf828fa-ff75-4c8f-98fd-bd3a042d5577","year":2016},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:fe5b4ea674067ea41ab320f1137772c4b614cf6d3a1389514fae1aacedd131fc","observation_id":"2d9d1e07-ee18-4b01-97b5-8eb8680d608c","resolution":{"observed_at":"2026-05-19T19:32:43.855260Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A double maximization approach for optimizing the LM rate of mismatched decoding","venue":null,"work_id":"2901dc5c-b647-42c9-82c5-7619b1e464a2","year":2024},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:e1304c3cb3f0e0759030d2d64e0cc87b01fb5dc6c2f7503ffe497839c23e6bf1","observation_id":"c1848ea9-0b60-437f-ae20-3f3d1f1fe2f0","resolution":{"observed_at":"2026-05-19T19:32:43.829999Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A general framework for transmission with transceiver distortion and some applications","venue":null,"work_id":"7fbb36cd-c8e5-42a9-940e-e73267f56503","year":2011},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:b483dddfabbc119ff3fc71874a66b06cd62e312a976ede3f47f0c94e1a6e7fea","observation_id":"2bee890e-486c-48a0-aa19-89b3f2044154","resolution":{"observed_at":"2026-05-19T19:32:43.819321Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A remark on channels with transceiver distortion","venue":null,"work_id":"7a849622-a125-4863-ab30-aed26e8cfa70","year":2016},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:1e3b695c6b51313787008b1452bf773cccb00643730f72bcc33e91024ef5b1f3","observation_id":"99ea1a4e-f259-4262-9387-6fdc2454eca7","resolution":{"observed_at":"2026-05-19T19:32:43.867581Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A regression approach to certain information transmission problems","venue":null,"work_id":"b5061227-e74a-4f81-9c81-ac1b968251d0","year":2019},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:edb8a93190b36fa3ca8016854ff4c6326fb8c7d498dfc5b2c60f3dbfd2d1ef10","observation_id":"2e7956bb-d740-44ba-8621-2864632c155f","resolution":{"observed_at":"2026-05-19T19:32:43.836037Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Crosscorrelation functions of amplitude-distorted Gaussian signals","venue":null,"work_id":"735f0062-cad3-4879-9a20-5a895f459b5d","year":1952},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:a779a03fa4eef6d02e957eef16b8e1119613ec63d490c69099d56b2e26f6b48d","observation_id":"16d194ae-632b-4f79-9d43-c7a1215798a0","resolution":{"observed_at":"2026-05-19T19:32:43.913799Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Generalized nearest neighbor decoding","venue":null,"work_id":"4a079a36-0090-4e3d-a612-9be7a6dd3547","year":2022},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:88a2f2b39fe30f91f188c2753429c7a5a53a39fc0031f27967bd343c1f564e2e","observation_id":"b46e2158-010f-46ba-931a-0eed9d33754a","resolution":{"observed_at":"2026-05-19T19:32:43.827935Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Generalized nearest neighbor decoding: General input constellation and a case study of interference suppression","venue":null,"work_id":"c8b99497-1c82-4ff2-a10d-6a6b7b9c076e","year":2025},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:307e313c0eccc62f59259fecff39946f42fb103bfd2e89aae4da2fa03d259814","observation_id":"a559c134-360f-48e2-a919-2f76ea2a1798","resolution":{"observed_at":"2026-05-19T19:32:43.877656Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Generalized nearest neighbor decoding for MIMO channels with imperfect channel state information","venue":null,"work_id":"82050d12-b012-40a8-bf31-1446d368ea4b","year":2021},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:9f9dbc40067980b43cf5a2fa7f1c4241453c58f2fcbbbaaacbe63fb59409b5e4","observation_id":"340b0f0d-d945-4d09-824b-db88a622307e","resolution":{"observed_at":"2026-05-19T19:32:43.908170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Linear shrinkage receiver for slow fading channels under imperfect channel state information","venue":null,"work_id":"9ed80470-559a-4869-9a96-5f3577386ebd","year":2022},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:1684388e4e43732008f0a5df1d3f65ae5fafee9435a3dc8a5f4fab5718c06be8","observation_id":"7fe7b374-c648-483a-8ff9-849dfe3293e5","resolution":{"observed_at":"2026-05-19T19:32:43.848979Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"dbd64142-490b-4003-857b-8a846a430044","year":2001},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:4b73a05ecb45fd0e6693d56a04d07042d3e538be8708a46327c7ac55776976aa","observation_id":"087a19df-641b-4358-99da-abcf48b37e61","resolution":{"observed_at":"2026-05-19T19:32:43.896407Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fading channels: Information-theoretic and communications aspects","venue":null,"work_id":"ca60ee25-3e60-4fdf-aa75-e7a4062c90dd","year":2002},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:b239f8462edc68d4805794f821a26eec8e03457d39b86aa043992d0bd3d98b92","observation_id":"92cca7b1-b340-494a-9f43-cc7728f978f7","resolution":{"observed_at":"2026-05-19T19:32:43.898200Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Models and information rates for Wiener phase noise channels","venue":null,"work_id":"0cfd0e00-df77-40ed-80f9-931a1c1925b7","year":2017},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:24802b2f90bc916cec9d922be5989629c24f1a568a36ac258edd984ed38b7dce","observation_id":"b66c0e80-978b-495d-94e2-19a70a670bdb","resolution":{"observed_at":"2026-05-19T19:32:43.904417Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On the capacity of channels with block memory","venue":null,"work_id":"f4d73ed2-922c-47fd-960b-37475ab38aac","year":1988},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:6f0e11507d176cd17d202a3ef8ae6440f679ffcd00c4dcd5c9f97bce60c019fd","observation_id":"aa18630b-1da2-4314-ac7e-59ee8f3a220e","resolution":{"observed_at":"2026-05-19T19:32:43.846967Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Information networks with in-block memory","venue":null,"work_id":"97288a12-f4ee-4645-9760-a67c8fea1f95","year":2014},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:69d2f6e7e554a9c9ee78f387db678cf505b5bd6c01187cb49ba32e5408c7d1d9","observation_id":"d5435fdf-5d4c-4a57-b427-436cefbb7a08","resolution":{"observed_at":"2026-05-19T19:32:43.851117Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On phase noise channels at high SNR","venue":null,"work_id":"c9900a69-7bf8-431f-8e0a-19095a2ef417","year":2002},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:22d130b6773093c0a437cc0db4ad75f1d8e8e0990997d2ec66299d04f0591a86","observation_id":"7f56a14d-e45c-4bd0-b0f4-ce40377c0228","resolution":{"observed_at":"2026-05-19T19:32:43.883502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Capacity and coding for the block-independent noncoherent AWGN channel","venue":null,"work_id":"cd63837a-9a43-4a14-99e9-d9ed6cde2386","year":2005},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:502be4460f204b9575c0287dce6165c7a2429e85d8a009f94daef105de046381","observation_id":"473b44f7-df82-414b-80a4-6a101b87a3de","resolution":{"observed_at":"2026-05-19T19:32:43.890877Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Compensation of phase noise in OFDM wireless systems","venue":null,"work_id":"ae0fc8b2-b61e-4c4c-9035-e6e07b3ab986","year":2007},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:ede030046ddf0d6cb0e183cd1cea6ddcdd8710121057168fca7df6101e0749d1","observation_id":"40fae0a1-7143-4d84-8537-17600ce5dfca","resolution":{"observed_at":"2026-05-19T19:32:43.838063Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Achievable rates in Gaussian MISO channels with secrecy constraints","venue":null,"work_id":"2488e55e-b7ed-4416-bb3e-cb59cc898194","year":2007},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:87cd64224fd65168b4f17dcc1a37847bc08f3aae5ee31c743fceb8a69d4b6549","observation_id":"dedca4a7-d272-4a6e-be9b-d01c9851a171","resolution":{"observed_at":"2026-05-19T19:32:43.842627Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Secrecy capacity of SIMO and slow fading channels","venue":null,"work_id":"d1938bbb-8d42-4ae0-afe9-ba93ef64da94","year":2005},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:d3b945ff550ccbe098898af504ebaf543b3ee07e5d6a8321a8fdc9b1692d2954","observation_id":"4a020119-0de9-46f5-a3d0-39366be5d067","resolution":{"observed_at":"2026-05-19T19:32:43.910038Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On fractionally-spaced equalizer design for digital microwave radio channels","venue":null,"work_id":"3537d7e6-1fab-40af-a52d-906d0d290f9e","year":1995},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:d6c77f415ee645d0a45a71fb93fae06970eb5c118c768f7c3cee93b85d502492","observation_id":"1552677c-9073-420b-a4eb-1a1d9aa18aa3","resolution":{"observed_at":"2026-05-19T19:32:43.885398Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Data transmission by frequency-division multiplexing using the discrete Fourier transform","venue":null,"work_id":"a2cb2e24-1058-447f-af7b-e9aa138c3930","year":1971},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:1eb440bce11a0d60a6b10e24960a4e525a6f61a122b458971a4ffd096043f63a","observation_id":"dc84ef1c-ab76-4f1e-bdc2-9bbcda9bd805","resolution":{"observed_at":"2026-05-19T19:32:43.832114Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Wireless multicarrier communications","venue":null,"work_id":"8654ae11-763b-4d2b-8d87-208f8d5eaae0","year":2000},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:c7ddbe32f3d97b162dc34b55781d0d78801d82a5bdb64534ec62a6459e48e275","observation_id":"136e88c9-1392-4c08-9570-32a4efbdb5fb","resolution":{"observed_at":"2026-05-19T19:32:43.892789Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"a4149a27-5cc5-4ee5-8ce7-7c8759c2fb1c","year":1968},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:92af78e8e6bbeeddba66e2306daf974de72317dda515361b556366791ba53579","observation_id":"b7a9a2aa-b53a-4450-89f4-507e5c1fb072","resolution":{"observed_at":"2026-05-19T19:32:43.894586Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"6b6c662e-f937-40e1-98e0-a441e17834d3","year":1999},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:384f57082578f06c4dfb80b1d66809355a512fe504c9d522b695d97fb07b4e9d","observation_id":"ac4bd03f-57e2-4447-a424-3b85912d67da","resolution":{"observed_at":"2026-05-19T19:32:43.823830Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Tse and P","venue":null,"work_id":"66908b73-eab6-481a-906f-c336c8a192cd","year":2005},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:a463f66431639c497491f1b597046bf9fcf4448b248dc0a33d6a65e0ea51c993","observation_id":"7678d519-e7b6-47c6-bfd7-3b1643a45e41","resolution":{"observed_at":"2026-05-19T19:32:43.888981Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The bussgang decomposition of nonlinear systems: Basic theory and MIMO extensions [lecture notes]","venue":null,"work_id":"2662ddc5-b053-4fe2-a0a9-0f53dc68098c","year":2021},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:5acf378022979b70741ece30166ac5d8be1be5028b8cbb273926ffcc9393beac","observation_id":"33a5a2fd-c4ea-435a-8955-707305da3338","resolution":{"observed_at":"2026-05-19T19:32:43.875729Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"How much training is needed in multiple-antenna wireless links?","venue":null,"work_id":"93cf777b-313b-4d0d-ada4-f76da68cbfed","year":2003},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:b2bb248305df499a1d42c4d192ac0581c62fd5f8b172db132e444b640236b041","observation_id":"24e599a8-8812-41a0-8263-823759118b8e","resolution":{"observed_at":"2026-05-19T19:32:43.861363Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Worst-case additive noise in wireless networks","venue":null,"work_id":"90d8a3a7-0820-45b8-ac1f-47648662e031","year":2013},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:205dd0d74830ad91a5dc397c858c8a751a3c088471cf3d71c44f559aa51742c8","observation_id":"086f925f-6f50-4527-9d49-1536081a6474","resolution":{"observed_at":"2026-05-19T19:32:43.865326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"02f9ce46-ed74-4628-8fe9-7b8cd528dfce","year":2001},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:20bfd76b85bd07efd65cf14dd6e804ecdb1fcd6e0db22300ae095ad7f43e6be3","observation_id":"92ba0121-0a9a-48fa-9de1-2e04a651234a","resolution":{"observed_at":"2026-05-19T19:32:43.906199Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Durrett,Probability: Theory and examples, 5th ed","venue":null,"work_id":"443d005b-69ec-4742-b252-5d9405fde80f","year":2019},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:2dd49f433f97781e7c5f047cf561ee30a34b6605a545acd9426a72fef39a3f2e","observation_id":"6d66b16f-0444-4ae5-b1db-69df4dbefd46","resolution":{"observed_at":"2026-05-19T19:32:43.857307Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A law of large numbers for identically distributed martingale differences","venue":null,"work_id":"6947b80b-47bd-4c04-bc62-a610420e26a5","year":1981},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:03061a010924a44af1a56bf2e612bce817ab2250c6aa6a83922e796da9fda207","observation_id":"a29f0505-07d8-4f12-b112-e79c7cd282a9","resolution":{"observed_at":"2026-05-19T19:32:43.840237Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"d72da588-d6a7-4ed1-8b62-ee0bd8e00d3a","year":2012},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:1fdebe370910a858aef3f62117c02cbc6c4c0b413414a3ff7e6cfc3fadf58ed4","observation_id":"5094800b-9dce-4bd0-a55d-10fc161fd1de","resolution":{"observed_at":"2026-05-19T19:32:43.834022Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Cvetkovski,Inequalities: Theorems, techniques and selected problems","venue":null,"work_id":"622a2338-a73b-4042-bcb7-017d0c2a23fb","year":2012},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:f494b8ddf12d15309c4583ed835a167606c296782d1af6716f9d10fda7a89206","observation_id":"0efd07cf-5d7c-49ea-a732-8d23d6b97164","resolution":{"observed_at":"2026-05-19T19:32:43.879543Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Doubly stochastic matrices and the diagonal of a rotation matrix","venue":null,"work_id":"6d5319f0-ac71-4656-a9eb-8fda9b19a86e","year":1954},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:b68b088bc5a4c4ecbbfa5f9921c0c4a5b843330e912d3c1cf9141b735c5054b3","observation_id":"51f8edec-68d8-4719-b681-644a090a97e9","resolution":{"observed_at":"2026-05-19T19:32:43.887237Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"a38612bf-0dad-49d3-898e-0dcdb8eba1f4","year":2010},"citing_paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-19T19:32:17.111430Z"},"links":{"citing_paper":"/paper/2605.15950"},"observation_digest":"sha256:743490040eccad223dd93d08c7cdc8ac2c2dd74cb94c4abfb58503c8af473f55","observation_id":"03f94483-380e-4c72-8c59-063a97c427f5","resolution":{"observed_at":"2026-05-19T19:32:43.853137Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.15950","last_updated":"2026-05-15T13:41:19Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-01T08:40:37.615557Z","submitted_at":"2026-05-15T13:41:19Z","title":"Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel"},"reference_resolution":{"displayed":49,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":0,"verified_fuzzy":42},"total_outbound_references":49},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 49 of 49 outbound references and 0 inbound Pith citation observations for arXiv:2605.15950."}