{"as_of":"2026-08-07T10:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:23544a2306f15f4a909d91a4a834607763626376bd958860bd1d0229eeabde8c","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T14:51:37.931090Z","state":"measured"},{"denominator":32,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":32,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T21:59:02.962038Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-05-15T12:05:33.359957Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2604.11782","last_updated":"2026-04-13T17:48:08Z","snapshot_observed_at":"2026-07-06T23:00:08.171601Z","submitted_at":"2026-04-13T17:48:08Z","title":"Optimal Codes for Deterministic Identification over Gaussian Channels: Closing the Capacity Gap","version":1},"cited_work":{"arxiv_id":"2604.11782","doi":null,"metadata_source":"pith","pith_arxiv_id":"2604.11782","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Optimal Codes for Deterministic Identification over Gaussian Channels: Closing the Capacity Gap","venue":"cs.IT","work_id":"652e2571-76f5-4a3f-a892-934eb77eba5a","year":2026},"citing_paper":{"arxiv_id":"2603.14246","last_updated":"2026-05-01T01:06:00Z","snapshot_observed_at":"2026-07-06T22:49:06.164294Z","submitted_at":"2026-03-15T06:40:10Z","title":"Identification for ISI Gaussian Channels","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-15T12:04:36.641199Z"},"links":{"cited_paper":"/paper/2604.11782","citing_paper":"/paper/2603.14246"},"observation_digest":"sha256:e11ff3dbb3dee95376f53863a581172c766ebad151613b4fb235ea9e576d15ca","observation_id":"904dc45a-daf8-4595-b07b-e9837e6cfa9d","resolution":{"observed_at":"2026-05-15T12:05:33.361808Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2604.11782","last_updated":"2026-04-13T17:48:08Z","snapshot_observed_at":"2026-07-06T23:00:08.171601Z","submitted_at":"2026-04-13T17:48:08Z","title":"Optimal Codes for Deterministic Identification over Gaussian Channels: Closing the Capacity Gap","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.11782","snapshot_observed_at":"2026-08-05T21:59:02.962038Z","title":"Optimal codes for deterministic identification over Gaussian channels: Closing the capacity gap,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.03282","last_updated":"2026-08-04T07:57:53Z","snapshot_observed_at":"2026-08-07T10:15:57.044833Z","submitted_at":"2026-08-04T07:57:53Z","title":"Reliability-Dependent Scaling Laws of Deterministic Identification over Binary Symmetric Channels","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T21:59:02.962038Z"},"links":{"cited_paper":"/paper/2604.11782","citing_paper":"/paper/2608.03282"},"observation_digest":"sha256:eb345310e997edfabe1f5c421664898f1b470a66bb986a902e5212a8966c31a8","observation_id":"ba9450c9-67bb-49c9-bc20-5eff886d2dc7","resolution":{"observed_at":"2026-08-05T21:59:02.962038Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2604.11782/citation-record","integrity":"/paper/2604.11782/integrity","json":"/paper/2604.11782/citation-record.json","paper":"/paper/2604.11782"},"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":"1975c793-b65a-433a-80bb-907147738aae","year":1948},"citing_paper":{"arxiv_id":"2604.11782","last_updated":"2026-04-13T17:48:08Z","snapshot_observed_at":"2026-07-06T23:00:08.171601Z","submitted_at":"2026-04-13T17:48:08Z","title":"Optimal Codes for Deterministic Identification over Gaussian Channels: Closing the Capacity Gap","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-10T14:51:37.931090Z"},"links":{"citing_paper":"/paper/2604.11782"},"observation_digest":"sha256:71e1fa2cd4701d5e3a9330807e5031b437399520c980da30917c5d2c73b30efe","observation_id":"5848e843-6789-4791-a93e-d5fa1e423503","resolution":{"observed_at":"2026-05-18T11:31:20.539188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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 theory of goal-oriented communication","venue":null,"work_id":"f4f1a298-11fc-439a-9f3f-de7b7f4c4606","year":2012},"citing_paper":{"arxiv_id":"2604.11782","last_updated":"2026-04-13T17:48:08Z","snapshot_observed_at":"2026-07-06T23:00:08.171601Z","submitted_at":"2026-04-13T17:48:08Z","title":"Optimal Codes for Deterministic Identification over Gaussian Channels: Closing the Capacity Gap","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-10T14:51:37.931090Z"},"links":{"citing_paper":"/paper/2604.11782"},"observation_digest":"sha256:055da85316cd1748bcaffcaa394916a0fb31e01a926776f2512e856d23580a30","observation_id":"28325acc-6b4b-41a3-a2dc-485eab061406","resolution":{"observed_at":"2026-05-18T11:31:20.476311Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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":"Novel information theoretical approaches","venue":null,"work_id":"9d3a2065-1623-417f-a4c8-3202b822b86f","year":2026},"citing_paper":{"arxiv_id":"2604.11782","last_updated":"2026-04-13T17:48:08Z","snapshot_observed_at":"2026-07-06T23:00:08.171601Z","submitted_at":"2026-04-13T17:48:08Z","title":"Optimal Codes for Deterministic Identification over Gaussian Channels: Closing the Capacity Gap","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-10T14:51:37.931090Z"},"links":{"citing_paper":"/paper/2604.11782"},"observation_digest":"sha256:d7a423572696884802059640552a1267a8b2a7bcd618778ce83bff79054da363","observation_id":"91f30130-a639-4626-85b8-5dcb7e6b8f96","resolution":{"observed_at":"2026-05-18T11:31:20.466461Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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":"6g perspective of mobile network operators, manufactur- ers, and verticals","venue":null,"work_id":"e071ed45-2707-417e-a50e-bd7761028347","year":2026},"citing_paper":{"arxiv_id":"2604.11782","last_updated":"2026-04-13T17:48:08Z","snapshot_observed_at":"2026-07-06T23:00:08.171601Z","submitted_at":"2026-04-13T17:48:08Z","title":"Optimal Codes for Deterministic Identification over Gaussian Channels: Closing the Capacity Gap","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-10T14:51:37.931090Z"},"links":{"citing_paper":"/paper/2604.11782"},"observation_digest":"sha256:780da3100cf392df8c093d34b614efd9d057e5cd8963954cfd7a5a3b8fed3852","observation_id":"7f3ec2cd-25b8-43cc-920e-21324afc338f","resolution":{"observed_at":"2026-05-18T11:31:20.582437Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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":"Identification via channels","venue":null,"work_id":"066d91d5-54f5-463c-812c-9b3d65de6b66","year":1989},"citing_paper":{"arxiv_id":"2604.11782","last_updated":"2026-04-13T17:48:08Z","snapshot_observed_at":"2026-07-06T23:00:08.171601Z","submitted_at":"2026-04-13T17:48:08Z","title":"Optimal Codes for Deterministic Identification over Gaussian Channels: Closing the Capacity Gap","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-10T14:51:37.931090Z"},"links":{"citing_paper":"/paper/2604.11782"},"observation_digest":"sha256:3b9c87353f7e868fa07bfb3759f636fc424b9c2708c8b81d0e4778474cfd84da","observation_id":"bb77696a-6be2-4188-aad3-30790720cc87","resolution":{"observed_at":"2026-05-18T11:31:20.473170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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":"New results in the theory of identification via channels","venue":null,"work_id":"ce131c30-c21e-43e1-89ec-db97a5f7457b","year":1992},"citing_paper":{"arxiv_id":"2604.11782","last_updated":"2026-04-13T17:48:08Z","snapshot_observed_at":"2026-07-06T23:00:08.171601Z","submitted_at":"2026-04-13T17:48:08Z","title":"Optimal Codes for Deterministic Identification over Gaussian Channels: Closing the Capacity Gap","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-10T14:51:37.931090Z"},"links":{"citing_paper":"/paper/2604.11782"},"observation_digest":"sha256:a38dcdb6c6b71b6251de75c840504497ee4bf5636a8e4c560e0f3ef2a401b2fa","observation_id":"2aae5830-b000-402a-afc4-dca6d9152172","resolution":{"observed_at":"2026-05-18T11:31:20.456325Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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 identification capacity of infinite alphabets or continuous-time channels","venue":null,"work_id":"72d4be10-b307-4882-b374-4f1c0d1eb2c6","year":2000},"citing_paper":{"arxiv_id":"2604.11782","last_updated":"2026-04-13T17:48:08Z","snapshot_observed_at":"2026-07-06T23:00:08.171601Z","submitted_at":"2026-04-13T17:48:08Z","title":"Optimal Codes for Deterministic Identification over Gaussian Channels: Closing the Capacity Gap","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-10T14:51:37.931090Z"},"links":{"citing_paper":"/paper/2604.11782"},"observation_digest":"sha256:68c7133d4a75f13a1806c0df705522b032c84242e0114bada711b30e656f9f28","observation_id":"b77fb56f-a6fd-4c92-8f35-8510e3b83a69","resolution":{"observed_at":"2026-05-18T11:31:20.459793Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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":"Secure identification for wiretap channels; robustness, super-additivity and continuity","venue":null,"work_id":"a3521c76-a817-45ce-baf3-19bbb4f675a4","year":2018},"citing_paper":{"arxiv_id":"2604.11782","last_updated":"2026-04-13T17:48:08Z","snapshot_observed_at":"2026-07-06T23:00:08.171601Z","submitted_at":"2026-04-13T17:48:08Z","title":"Optimal Codes for Deterministic Identification over Gaussian Channels: Closing the Capacity Gap","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-10T14:51:37.931090Z"},"links":{"citing_paper":"/paper/2604.11782"},"observation_digest":"sha256:be722bf63286c1352d75139b63b7bdb344f8ee3ab86a0f902cd2180bb49a718c","observation_id":"1ad45242-9979-4d79-bbcf-29a37929c036","resolution":{"observed_at":"2026-05-18T11:31:20.586243Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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":"Identification via the broadcast chan- nel","venue":null,"work_id":"ce9e185d-7692-4e1e-b0f7-a04cd312cc7c","year":1942},"citing_paper":{"arxiv_id":"2604.11782","last_updated":"2026-04-13T17:48:08Z","snapshot_observed_at":"2026-07-06T23:00:08.171601Z","submitted_at":"2026-04-13T17:48:08Z","title":"Optimal Codes for Deterministic Identification over Gaussian Channels: Closing the Capacity Gap","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-10T14:51:37.931090Z"},"links":{"citing_paper":"/paper/2604.11782"},"observation_digest":"sha256:17f4da621de5c6066736e113089285286ff932e37e928487bc074b4c2e59b673","observation_id":"6ec175f3-82b7-40db-9cd0-593da8579136","resolution":{"observed_at":"2026-05-18T11:31:20.479689Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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":"Strongly universal hashing and identifi- cation codes via channels","venue":null,"work_id":"fea2ea57-35dd-45fc-9bd0-e4c71bfba315","year":2091},"citing_paper":{"arxiv_id":"2604.11782","last_updated":"2026-04-13T17:48:08Z","snapshot_observed_at":"2026-07-06T23:00:08.171601Z","submitted_at":"2026-04-13T17:48:08Z","title":"Optimal Codes for Deterministic Identification over Gaussian Channels: Closing the Capacity Gap","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-10T14:51:37.931090Z"},"links":{"citing_paper":"/paper/2604.11782"},"observation_digest":"sha256:65b63301ec14bdaabe27ea60929478caf38c78b882730df40ff192bff85bbca7","observation_id":"2ecb6215-fbe3-4eee-9945-8cfcf133705d","resolution":{"observed_at":"2026-05-18T11:31:20.442327Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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":"Common randomness generation and identification over gaussian channels","venue":null,"work_id":"ff95e903-8819-43fc-932d-a3bc2be47053","year":2020},"citing_paper":{"arxiv_id":"2604.11782","last_updated":"2026-04-13T17:48:08Z","snapshot_observed_at":"2026-07-06T23:00:08.171601Z","submitted_at":"2026-04-13T17:48:08Z","title":"Optimal Codes for Deterministic Identification over Gaussian Channels: Closing the Capacity Gap","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-10T14:51:37.931090Z"},"links":{"citing_paper":"/paper/2604.11782"},"observation_digest":"sha256:835fbb9b7ca6d97f2cb22bfa0a87ea44a0c03b124981a8f2dad52322e01e088c","observation_id":"db739970-7565-4fe6-82bf-24c57820d1db","resolution":{"observed_at":"2026-05-18T11:31:20.452800Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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":"Identification without randomization","venue":null,"work_id":"13ccadcf-4b2d-4e77-9b60-de3b6ff82f30","year":1999},"citing_paper":{"arxiv_id":"2604.11782","last_updated":"2026-04-13T17:48:08Z","snapshot_observed_at":"2026-07-06T23:00:08.171601Z","submitted_at":"2026-04-13T17:48:08Z","title":"Optimal Codes for Deterministic Identification over Gaussian Channels: Closing the Capacity Gap","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-10T14:51:37.931090Z"},"links":{"citing_paper":"/paper/2604.11782"},"observation_digest":"sha256:97a8395ddeb742843f18ec254507da96260d4c85219ecc9d82d034f52c11fbbd","observation_id":"4be66d9d-e9b2-4d99-9dc3-8d5b7281366a","resolution":{"observed_at":"2026-05-18T11:31:20.462928Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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":"Deterministic Identification Over Channels With Power Constraints","venue":null,"work_id":"654cfde0-de45-47e4-a57a-450c5316e5f8","year":2022},"citing_paper":{"arxiv_id":"2604.11782","last_updated":"2026-04-13T17:48:08Z","snapshot_observed_at":"2026-07-06T23:00:08.171601Z","submitted_at":"2026-04-13T17:48:08Z","title":"Optimal Codes for Deterministic Identification over Gaussian Channels: Closing the Capacity Gap","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-10T14:51:37.931090Z"},"links":{"citing_paper":"/paper/2604.11782"},"observation_digest":"sha256:ea0741c614fec19fd2a3ff19a494863250e71057ecb483bf7992dc04e6d3cc6c","observation_id":"ecc4e4aa-fe3b-45df-8a83-93eb9ab03eb2","resolution":{"observed_at":"2026-05-18T11:31:20.566270Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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":"Deterministic Identification for Molecular Communications Over the Poisson Channel","venue":null,"work_id":"6773c957-e5a8-47dc-9b90-49d23755ef83","year":2023},"citing_paper":{"arxiv_id":"2604.11782","last_updated":"2026-04-13T17:48:08Z","snapshot_observed_at":"2026-07-06T23:00:08.171601Z","submitted_at":"2026-04-13T17:48:08Z","title":"Optimal Codes for Deterministic Identification over Gaussian Channels: Closing the Capacity Gap","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-10T14:51:37.931090Z"},"links":{"citing_paper":"/paper/2604.11782"},"observation_digest":"sha256:73cd72a28ce7b8aad79f74f84cf9ace657b7643cbe28c62433a0d4079d785897","observation_id":"214264e1-ec6b-4a1e-88d4-3a38552e16e7","resolution":{"observed_at":"2026-05-18T11:31:20.446136Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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":"Deterministic Identification Over Fading Channels","venue":null,"work_id":"7f1e6d17-3e55-4215-92ef-3f74e36f1919","year":2020},"citing_paper":{"arxiv_id":"2604.11782","last_updated":"2026-04-13T17:48:08Z","snapshot_observed_at":"2026-07-06T23:00:08.171601Z","submitted_at":"2026-04-13T17:48:08Z","title":"Optimal Codes for Deterministic Identification over Gaussian Channels: Closing the Capacity Gap","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-10T14:51:37.931090Z"},"links":{"citing_paper":"/paper/2604.11782"},"observation_digest":"sha256:3a5588446330bd72021e73201a4c9c1f71bc03421a815dff4e467e438ee60462","observation_id":"774e8a12-bdd4-424a-89bd-054c13a8ae60","resolution":{"observed_at":"2026-05-18T11:31:20.569549Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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":"Deterministic identi- fication over channels with finite output: a dimensional perspective on superlinear rates","venue":null,"work_id":"82aca6d2-b303-41f7-9360-04a0ed38aa4d","year":2025},"citing_paper":{"arxiv_id":"2604.11782","last_updated":"2026-04-13T17:48:08Z","snapshot_observed_at":"2026-07-06T23:00:08.171601Z","submitted_at":"2026-04-13T17:48:08Z","title":"Optimal Codes for Deterministic Identification over Gaussian Channels: Closing the Capacity Gap","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-10T14:51:37.931090Z"},"links":{"citing_paper":"/paper/2604.11782"},"observation_digest":"sha256:2fa30281581dc5324f6b4c3cad50462de469041ef84a8f6f219a9ac56c1465f4","observation_id":"96be08ff-6ac2-49e5-8be3-776d3285659b","resolution":{"observed_at":"2026-05-18T11:31:20.579257Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12548","last_updated":"2025-01-22T00:01:16Z","snapshot_observed_at":"2026-07-06T20:24:07.726953Z","submitted_at":"2025-01-22T00:01:16Z","title":"Galaxy Codes: Advancing Achievability for Deterministic Identification via Gaussian Channels","version":1},"cited_work":{"arxiv_id":"2501.12548","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.12548","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Galaxy Codes: Advancing Achievability for Deterministic Identification via Gaussian Channels","venue":null,"work_id":"96211a15-081f-4bc6-8870-929c4fa53028","year":2025},"citing_paper":{"arxiv_id":"2604.11782","last_updated":"2026-04-13T17:48:08Z","snapshot_observed_at":"2026-07-06T23:00:08.171601Z","submitted_at":"2026-04-13T17:48:08Z","title":"Optimal Codes for Deterministic Identification over Gaussian Channels: Closing the Capacity Gap","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-10T14:51:37.931090Z"},"links":{"cited_paper":"/paper/2501.12548","citing_paper":"/paper/2604.11782"},"observation_digest":"sha256:58ae38fa5722d69cc421f5fe9dc1db1f92bd6e0c33363a20ea9b94354b1f5700","observation_id":"d087c718-8e5d-4c58-af9e-0490d3e87deb","resolution":{"observed_at":"2026-05-11T11:31:00.782680Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-07-06T20:30:59.454606Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"cited_work":{"arxiv_id":"2502.02389","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.02389","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Rate-Reliability Tradeoff for Deterministic Identification","venue":null,"work_id":"ee4b8108-27ea-4da3-abaf-4f84d6c49463","year":2025},"citing_paper":{"arxiv_id":"2604.11782","last_updated":"2026-04-13T17:48:08Z","snapshot_observed_at":"2026-07-06T23:00:08.171601Z","submitted_at":"2026-04-13T17:48:08Z","title":"Optimal Codes for Deterministic Identification over Gaussian Channels: Closing the Capacity Gap","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-10T14:51:37.931090Z"},"links":{"cited_paper":"/paper/2502.02389","citing_paper":"/paper/2604.11782"},"observation_digest":"sha256:9a82c8140c9347b926b2c33fe6d882c496932c0ec8daacd6c461398aa02b430d","observation_id":"80f07b51-f0ad-4b9e-b2f9-60b97cb6e9c4","resolution":{"observed_at":"2026-05-11T11:31:00.791659Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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":"Deterministic iden- tification in maximally asymmetric error regimes","venue":null,"work_id":"1b4d5ca0-909f-4c84-a5ba-3d5158b33414","year":2025},"citing_paper":{"arxiv_id":"2604.11782","last_updated":"2026-04-13T17:48:08Z","snapshot_observed_at":"2026-07-06T23:00:08.171601Z","submitted_at":"2026-04-13T17:48:08Z","title":"Optimal Codes for Deterministic Identification over Gaussian Channels: Closing the Capacity Gap","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-10T14:51:37.931090Z"},"links":{"citing_paper":"/paper/2604.11782"},"observation_digest":"sha256:3324839e3d6166ddbfd0aed21f2c1dc5ebbc7821203967f25308f88c97f96434","observation_id":"a7561eda-9b2b-4abe-81ca-1846a4dc05a1","resolution":{"observed_at":"2026-05-18T11:31:20.572626Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2602.12182","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Rate-Reliability Tradeoff for Deterministic Identification over Gaussian Channels","venue":null,"work_id":"2b793135-1a6c-4352-8c65-c94dd05d330e","year":2026},"citing_paper":{"arxiv_id":"2604.11782","last_updated":"2026-04-13T17:48:08Z","snapshot_observed_at":"2026-07-06T23:00:08.171601Z","submitted_at":"2026-04-13T17:48:08Z","title":"Optimal Codes for Deterministic Identification over Gaussian Channels: Closing the Capacity Gap","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-10T14:51:37.931090Z"},"links":{"citing_paper":"/paper/2604.11782"},"observation_digest":"sha256:5449976257575d48c6968dc78d16bcda38a5ec83cdbb7917141045fa7280b259","observation_id":"cbc2b060-3ba1-4521-848a-b40ace5bb076","resolution":{"observed_at":"2026-05-11T11:31:00.831159Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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":"9e6aa838-fcd5-42cc-a86e-3d7e75d632a6","year":1998},"citing_paper":{"arxiv_id":"2604.11782","last_updated":"2026-04-13T17:48:08Z","snapshot_observed_at":"2026-07-06T23:00:08.171601Z","submitted_at":"2026-04-13T17:48:08Z","title":"Optimal Codes for Deterministic Identification over Gaussian Channels: Closing the Capacity Gap","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-10T14:51:37.931090Z"},"links":{"citing_paper":"/paper/2604.11782"},"observation_digest":"sha256:ec8746c49c209ebf0e31ad72c00e51abe1e5c38e2c10f92f72c90423c216dded","observation_id":"e8a63594-dff2-45b4-973d-66f210301795","resolution":{"observed_at":"2026-05-18T11:31:20.575890Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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 consid- erations for cellular mobile radio","venue":null,"work_id":"4cf68288-d49b-48b0-8d1b-dbcd40d68f3f","year":1994},"citing_paper":{"arxiv_id":"2604.11782","last_updated":"2026-04-13T17:48:08Z","snapshot_observed_at":"2026-07-06T23:00:08.171601Z","submitted_at":"2026-04-13T17:48:08Z","title":"Optimal Codes for Deterministic Identification over Gaussian Channels: Closing the Capacity Gap","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-10T14:51:37.931090Z"},"links":{"citing_paper":"/paper/2604.11782"},"observation_digest":"sha256:e3df8a176e861aca77d333257160e1384d70ac3e8d4cb1033f2780ff3028b9a0","observation_id":"8af6769f-aec9-4d53-894c-cdce05e03ed1","resolution":{"observed_at":"2026-05-18T11:31:20.469835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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":"4d528326-53b0-49aa-9274-b081f74ba5b8","year":2005},"citing_paper":{"arxiv_id":"2604.11782","last_updated":"2026-04-13T17:48:08Z","snapshot_observed_at":"2026-07-06T23:00:08.171601Z","submitted_at":"2026-04-13T17:48:08Z","title":"Optimal Codes for Deterministic Identification over Gaussian Channels: Closing the Capacity Gap","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-10T14:51:37.931090Z"},"links":{"citing_paper":"/paper/2604.11782"},"observation_digest":"sha256:aff08c6c4067631af1c704aa35e5b7d38b8210ff1cd25733f15c70a73cc856ab","observation_id":"76df1024-db2c-4fb7-b047-e6a2a000939a","resolution":{"observed_at":"2026-05-18T11:31:20.553935Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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":"11bf8b5d-7dff-4daf-9ca6-f8eac41face4","year":1999},"citing_paper":{"arxiv_id":"2604.11782","last_updated":"2026-04-13T17:48:08Z","snapshot_observed_at":"2026-07-06T23:00:08.171601Z","submitted_at":"2026-04-13T17:48:08Z","title":"Optimal Codes for Deterministic Identification over Gaussian Channels: Closing the Capacity Gap","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-10T14:51:37.931090Z"},"links":{"citing_paper":"/paper/2604.11782"},"observation_digest":"sha256:2dd451264a378c6037e77c6f46b60c1a57639a3e5dab59e3787224512916be90","observation_id":"92952972-bd7a-498d-b67b-ac314771c38b","resolution":{"observed_at":"2026-05-18T11:31:20.563166Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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":"Csisz ´ar and J","venue":null,"work_id":"fc9dc1e9-4dd5-4aa4-a67e-17573e9ada95","year":2011},"citing_paper":{"arxiv_id":"2604.11782","last_updated":"2026-04-13T17:48:08Z","snapshot_observed_at":"2026-07-06T23:00:08.171601Z","submitted_at":"2026-04-13T17:48:08Z","title":"Optimal Codes for Deterministic Identification over Gaussian Channels: Closing the Capacity Gap","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-10T14:51:37.931090Z"},"links":{"citing_paper":"/paper/2604.11782"},"observation_digest":"sha256:59d29851b6b29312c4c168fd22cc6946b23535937927a4d97691ea74404f3070","observation_id":"cbd14daf-d231-42af-abae-445ab77d272f","resolution":{"observed_at":"2026-05-18T11:31:20.550476Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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":"Universal decoding for finite-state channels","venue":null,"work_id":"491321c9-f967-4114-b20a-49f17d0c83fc","year":1985},"citing_paper":{"arxiv_id":"2604.11782","last_updated":"2026-04-13T17:48:08Z","snapshot_observed_at":"2026-07-06T23:00:08.171601Z","submitted_at":"2026-04-13T17:48:08Z","title":"Optimal Codes for Deterministic Identification over Gaussian Channels: Closing the Capacity Gap","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-10T14:51:37.931090Z"},"links":{"citing_paper":"/paper/2604.11782"},"observation_digest":"sha256:0b532433832082b9304f96e524882815c4e3a2abd00fb078b96a5989a4a20fa2","observation_id":"bc092d0a-b3ee-41a1-a2d2-62bfa8d8c9be","resolution":{"observed_at":"2026-05-18T11:31:20.546850Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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":"fbc2d60c-26a1-4693-814a-f09d8938b851","year":1998},"citing_paper":{"arxiv_id":"2604.11782","last_updated":"2026-04-13T17:48:08Z","snapshot_observed_at":"2026-07-06T23:00:08.171601Z","submitted_at":"2026-04-13T17:48:08Z","title":"Optimal Codes for Deterministic Identification over Gaussian Channels: Closing the Capacity Gap","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-10T14:51:37.931090Z"},"links":{"citing_paper":"/paper/2604.11782"},"observation_digest":"sha256:e06517891c677935ed78c8b475e47f2944fc5b40ceffb45c47781775755f8a45","observation_id":"8083a09b-ac26-442c-a320-1fc3979041cd","resolution":{"observed_at":"2026-05-18T11:31:20.560069Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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":"Universal decoding for memoryless Gaussian channels with a deterministic interference","venue":null,"work_id":"7d31e12b-f5d8-47c4-93a6-831bb8cd2be8","year":1993},"citing_paper":{"arxiv_id":"2604.11782","last_updated":"2026-04-13T17:48:08Z","snapshot_observed_at":"2026-07-06T23:00:08.171601Z","submitted_at":"2026-04-13T17:48:08Z","title":"Optimal Codes for Deterministic Identification over Gaussian Channels: Closing the Capacity Gap","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-10T14:51:37.931090Z"},"links":{"citing_paper":"/paper/2604.11782"},"observation_digest":"sha256:84bee6dca684555600c5b597bf46e6095337ef529b9df9dbae776fba22ffa98f","observation_id":"7473551a-cdd6-46d2-970c-07926d85be14","resolution":{"observed_at":"2026-05-18T11:31:20.532357Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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":"Rateless coding for Gaussian channels","venue":null,"work_id":"9e37f5e8-518c-459e-924e-44a82f9f487b","year":2011},"citing_paper":{"arxiv_id":"2604.11782","last_updated":"2026-04-13T17:48:08Z","snapshot_observed_at":"2026-07-06T23:00:08.171601Z","submitted_at":"2026-04-13T17:48:08Z","title":"Optimal Codes for Deterministic Identification over Gaussian Channels: Closing the Capacity Gap","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-10T14:51:37.931090Z"},"links":{"citing_paper":"/paper/2604.11782"},"observation_digest":"sha256:9bc5d9d43792a167e985d337dcb99fe44aa7a578aee06573a601278bcd658079","observation_id":"30fc10db-c52e-4375-81d1-2ee1e66236b4","resolution":{"observed_at":"2026-05-18T11:31:20.543110Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.20991","last_updated":"2025-07-24T16:26:03Z","snapshot_observed_at":"2026-08-05T11:08:17.887836Z","submitted_at":"2025-04-29T17:57:36Z","title":"Quantum Hypothesis Testing Lemma for Deterministic Identification over Quantum Channels","version":2},"cited_work":{"arxiv_id":"2504.20991","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.20991","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Quantum Hypothesis Testing Lemma for Deterministic Identification over Quantum Chan- nels","venue":null,"work_id":"5003395d-9dbd-41e6-a921-2070be3b98ac","year":2025},"citing_paper":{"arxiv_id":"2604.11782","last_updated":"2026-04-13T17:48:08Z","snapshot_observed_at":"2026-07-06T23:00:08.171601Z","submitted_at":"2026-04-13T17:48:08Z","title":"Optimal Codes for Deterministic Identification over Gaussian Channels: Closing the Capacity Gap","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-10T14:51:37.931090Z"},"links":{"cited_paper":"/paper/2504.20991","citing_paper":"/paper/2604.11782"},"observation_digest":"sha256:6dce2d036f0fd67f5a84d42c910f5b8eb6e2d9745c0c707bd0e7cc4af9a9875f","observation_id":"a3bc22d4-0410-4091-bd82-68dd268be8c3","resolution":{"observed_at":"2026-05-11T11:31:00.787961Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2604.11782","last_updated":"2026-04-13T17:48:08Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-07-06T23:00:08.171601Z","submitted_at":"2026-04-13T17:48:08Z","title":"Optimal Codes for Deterministic Identification over Gaussian Channels: Closing the Capacity Gap"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":4,"verified_fuzzy":25},"total_outbound_references":30},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 2 inbound Pith citation observations for arXiv:2604.11782."}