{"as_of":"2026-08-12T12:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7cc6728f6b98553ba7493174bee5f2ddd3b68d61aff5c42e0c16aada78efc5a2","coverage":[{"denominator":43,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T12:32:22.407073Z","state":"measured"},{"denominator":46,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":46,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T00:33:07.104125Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T18:26:11.981276Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.02389","snapshot_observed_at":"2026-08-07T00:33:07.104125Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.14360","last_updated":"2025-06-17T10:00:31Z","snapshot_observed_at":"2026-08-08T19:46:55.074987Z","submitted_at":"2025-06-17T10:00:31Z","title":"Identification for Molecular Communication Based on Diffusion Channel with Poisson Reception Process","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T00:33:07.104125Z"},"links":{"cited_paper":"/paper/2502.02389","citing_paper":"/paper/2506.14360"},"observation_digest":"sha256:b202c13d7cce72c561e5fd042d2cb4a712c73d49a048e77a1f3542a8a737ee92","observation_id":"a225bc70-53f3-40fc-a318-bc3fb2f62ee5","resolution":{"observed_at":"2026-08-07T00:33:07.104125Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","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:ab471ebf609c639081ec648de6e8b7592e9376302f4edccf2594afc8dfa6abfc","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08-09T12:16:57.576884Z","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":"2605.05168","last_updated":"2026-05-06T17:36:39Z","snapshot_observed_at":"2026-07-06T23:17:48.161262Z","submitted_at":"2026-05-06T17:36:39Z","title":"Deterministic identification for Bernoulli channels and related channels with continuous input","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-08T15:57:20.704185Z"},"links":{"cited_paper":"/paper/2502.02389","citing_paper":"/paper/2605.05168"},"observation_digest":"sha256:0a57c1c95fdcfd093cf3e4fa34fac5547de3ab9e475b88b2e589b7d498ef42bb","observation_id":"084ba1b5-0d7a-4753-8614-cee80e216d2d","resolution":{"observed_at":"2026-05-11T18:26:11.985796Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.02389/citation-record","integrity":"/paper/2502.02389/integrity","json":"/paper/2502.02389/citation-record.json","paper":"/paper/2502.02389"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:32:24.496328Z","title":"Rate-reliability tradeoff for deterministic identification,","venue":null,"work_id":"512df674-74fd-4059-af97-8f53bdf00dd3","year":2025},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.240560Z"},"links":{"citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:74b5f69ab6ff874cf68449d94db5a3498d2e6e02f0fff1725ab0a6974270eafd","observation_id":"88a45df3-e23d-467e-b26d-2b6c1574e57f","resolution":{"observed_at":"2026-08-09T12:32:24.500323Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08-09T12:32:24.484840Z","title":"A mathematical theory of communication,","venue":null,"work_id":"98e2d0b7-80a3-41b7-8d1a-07d856877faa","year":null},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.245127Z"},"links":{"citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:faf8c657bca568427a3f2cb8ae73d673ca0d4f21b427b1ac87175ac64bf5dbed","observation_id":"1f859327-e352-4126-a165-2c05834bca6a","resolution":{"observed_at":"2026-08-09T12:32:24.488638Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:32:22.252325Z","title":"The coding of messages subject to chance errors,","venue":null,"work_id":null,"year":1957},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.252325Z"},"links":{"citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:d02078e4a17c781f342b1b6b0fbda755368cae2078506c218564001affaf5497","observation_id":"f9441c5a-cba6-49d0-bfab-93b6ad1ca67d","resolution":{"observed_at":"2026-08-09T12:32:22.252325Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/sfcs.1985.32","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Identification is easier than decoding,","venue":null,"work_id":"e0577cea-539b-4550-86ff-8e3e9e8c0f33","year":1985},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.255977Z"},"links":{"citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:9ba29dcbace0634beae7f99295f44c83752e8f64b59d38ee20b475f7420a006c","observation_id":"7a248355-8ba8-4535-844f-a7e20e1598fb","resolution":{"observed_at":"2026-08-09T12:32:22.629982Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08-09T12:32:24.472907Z","title":"Identification via channels,","venue":null,"work_id":"402df861-e1f1-42d2-ab21-c46a7fb9995a","year":null},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.259613Z"},"links":{"citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:788d21cb695c4cf213c904149552a2053c5c31e4c4ec25ae6932ade36fa6d6e4","observation_id":"9e07c21d-c4a7-4512-a07a-9f618d71284e","resolution":{"observed_at":"2026-08-09T12:32:24.476839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08-09T12:32:24.459657Z","title":"Berlin, Vladivostok: Springer Verlag, 1993","venue":null,"work_id":"6ff3f18b-dcb1-492a-b363-0e5125c39969","year":1993},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.267238Z"},"links":{"citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:713e8a0337541bccf0eabbf5e120127c08678405177c537a17820f381fc4b300","observation_id":"47bb659d-c30e-42d1-9624-48b2d11651fd","resolution":{"observed_at":"2026-08-09T12:32:24.464194Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.16507","last_updated":"2024-01-29T13:32:30Z","snapshot_observed_at":"2026-07-06T16:38:17.729495Z","submitted_at":"2023-10-25T09:49:12Z","title":"Identification Capacity of the Discrete-Time Poisson Channel","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.16507","snapshot_observed_at":"2026-08-09T12:32:22.270943Z","title":"Information- Theoretical Analysis of Event-Triggered Molecular Communication,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.270943Z"},"links":{"cited_paper":"/paper/2310.16507","citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:33d423f559ca7f071a3d7eb2d05f509ff97d54e5220a5d3c2607d948a3a6d714","observation_id":"f9d1cd36-06ee-4089-9616-0b302d95d4d4","resolution":{"observed_at":"2026-08-09T12:32:22.270943Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/18.796419","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Identification without randomiza- tion,","venue":"IEEE Transactions on Information Theory","work_id":"5f011077-ad5b-489b-a65d-a20ba8b653f7","year":1999},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.279229Z"},"links":{"citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:9700e000aee2fcb98934edb470111d76c9a079c4aa22a318cb23854e48df437a","observation_id":"7450c1bc-182b-4584-8bef-190eb033d1c6","resolution":{"observed_at":"2026-08-09T12:32:22.596279Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:32:22.283141Z","title":"Deterministic Identification Over Channels With Power Con- straints,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.283141Z"},"links":{"citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:8e99f5cb64b1a3d9a4934bdc5299126173196eafbe4a22b567e9386a35932f67","observation_id":"fdfb19d2-c655-440e-a831-99fbaeaed571","resolution":{"observed_at":"2026-08-09T12:32:22.283141Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:32:24.445082Z","title":"Parallel programming must be deterministic by default,","venue":null,"work_id":"845bbd05-60a0-47cb-8d40-d47afbb801ea","year":2009},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.287047Z"},"links":{"citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:b489bf60ef5bb9f2992856b0d7b1f23de6d9238667b7bcc726fd937ec89327c4","observation_id":"b5a1327c-2934-4b16-b942-9d4c9ac4a692","resolution":{"observed_at":"2026-08-09T12:32:24.449996Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2009.20213","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:32:24.111179Z","title":"Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels,","venue":null,"work_id":"8d6e19d9-f276-41af-bad9-791103078754","year":2009},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.290709Z"},"links":{"citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:28e20b1ee2253c9c4b995a3ec1671f2d48cd5198555965d316188074e2b861b0","observation_id":"8b670446-7532-48b0-bfd1-f0927b48ae87","resolution":{"observed_at":"2026-08-09T12:32:24.116877Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:32:23.786409Z","title":"Deterministic Identification Over Fading Channels,","venue":null,"work_id":"c1600030-3a8f-485d-aa2e-36e7c2e12dd1","year":2020},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.298741Z"},"links":{"citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:e5a4b430e1afe6b744d31c69b69128f53c08deab5d2472b7961d1536cbe02fc8","observation_id":"e740df03-0ec9-4d1d-b791-158bb02e5741","resolution":{"observed_at":"2026-08-09T12:32:23.790561Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.02723","last_updated":"2025-02-03T13:27:18Z","snapshot_observed_at":"2026-08-10T14:47:54.868751Z","submitted_at":"2024-04-03T13:23:32Z","title":"Deterministic Identification Codes for Fading Channels","version":3},"cited_work":{"arxiv_id":"2404.02723","doi":"10.48550/arxiv.2404.02723","metadata_source":"pith","pith_arxiv_id":"2404.02723","snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Deterministic Identification Codes for Fading Channels","venue":"cs.IT","work_id":"9117e7f0-a3ff-4102-b4db-041b30b1e241","year":2024},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.302440Z"},"links":{"cited_paper":"/paper/2404.02723","citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:45a98476f140556611e4fcfb667948c065ff059a3e9e00a49a2065a0bd6b3143","observation_id":"65085627-cb16-4446-96e5-cb11bdf8dd3b","resolution":{"observed_at":"2026-08-09T12:32:22.585047Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:32:23.636508Z","title":"Deterministic Identification Over Pois- son Channels,","venue":null,"work_id":"ce198bf5-269e-41d9-8555-9f0d0d9faadb","year":2021},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.306737Z"},"links":{"citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:547a0f79ad3fa72bbd394d71bd6c2a898780953622cd55800e0d56a75e341ffa","observation_id":"1f059657-3cd9-449c-8716-bfa7a9ab12d3","resolution":{"observed_at":"2026-08-09T12:32:23.640364Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:32:23.483243Z","title":"Deterministic Identification for Molecular Communications Over the Poisson Channel,","venue":null,"work_id":"c6811949-d52b-44a0-9cb7-04a9a8bf5f26","year":2023},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.310551Z"},"links":{"citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:ed3046ab84a08f9b1907e6c9751357b9d03f702c0a36fa15827b01abc2191d10","observation_id":"ca5e8855-2bc1-4eeb-bc3f-f35fb5733b2c","resolution":{"observed_at":"2026-08-09T12:32:23.487287Z","resolver_source":"arxiv_id_nonexistent","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:32:23.206253Z","title":"Deterministic identification over channels with finite output: A dimensional perspective on superlinear rates,","venue":null,"work_id":"28fe1d68-77d3-473f-89f1-069be417090e","year":2025},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.314469Z"},"links":{"citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:32f26367e17bc0c3041aeceeba825cf8e0aae2907059b15b67c55e8c532c4a13","observation_id":"ca4ef734-bc8f-40c4-b5b7-5db74f7f56f3","resolution":{"observed_at":"2026-08-09T12:32:23.210409Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:32:24.030865Z","title":"Deterministic Identification Over Channels with Finite Output: A Dimensional Perspective on Superlinear Rates,","venue":null,"work_id":"9910e75b-e265-447a-9e96-b8c57587d552","year":2024},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.318440Z"},"links":{"citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:4146fc62f287f5eea2e0a0730a7fb7a6b8b63b3b2b042c566ef61082fd56c081","observation_id":"43d46967-2d61-43b0-b613-908674dabebb","resolution":{"observed_at":"2026-08-09T12:32:24.034612Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08-09T12:32:24.431508Z","title":"Gallager, Information Theory and Reliable Communication (CIMS – International Centre for Mechanical Sciences, Courses and Lectures), 1st ed","venue":null,"work_id":"4a2befc2-ac95-4e2e-a567-3d42a5ddf542","year":1972},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.326582Z"},"links":{"citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:968a2cfe3d8f16d6851afef9d10df753b9353cce0dfe18cb64ff8baf76b4c094","observation_id":"2bed55c2-d0c8-494a-9e64-8959a076a253","resolution":{"observed_at":"2026-08-09T12:32:24.435755Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/9907077","last_updated":"1999-07-24T09:27:46Z","snapshot_observed_at":"2026-07-07T07:29:21.743276Z","submitted_at":"1999-07-24T09:27:46Z","title":"Coding Theorems of Quantum Information Theory","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/9907077","snapshot_observed_at":"2026-08-09T12:32:22.330552Z","title":"Coding Theorems of Quantum Information Theory,","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.330552Z"},"links":{"cited_paper":"/paper/quant-ph/9907077","citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:73276f4acd5dfef102c35a3a0dc0eb1b1d770d5e7f926002ed813043fb77bc70","observation_id":"73a7816a-807f-45fc-aee8-e0934c7f8d26","resolution":{"observed_at":"2026-08-09T12:32:22.330552Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:32:24.419496Z","title":"Falconer, Fractal Geometry: Mathematical Foundations and Applications (3rd ed.) Wiley & Sons, 2014","venue":null,"work_id":"87fc31c1-1d1c-4fb3-8ece-0dce72bb007b","year":2014},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.334673Z"},"links":{"citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:3728d0a04e14082bb5b165e5c17392b4b1cff15019a8d280521c1261df677859","observation_id":"dfe8e8d9-8710-4e9d-98b4-2b9349254e0c","resolution":{"observed_at":"2026-08-09T12:32:24.423837Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1017/cbo9780511933912","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Robinson, Dimensions, Embeddings, and Attractors","venue":"Cambridge University Press eBooks","work_id":"60ea3a42-228e-4667-b664-2ea035de3874","year":2010},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.338414Z"},"links":{"citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:d8eb68e30b3ef5b8868af10411d9294dc9f2ac162a5dca12f5af267b3e61268c","observation_id":"5be7b269-0bf3-48ea-aa2d-315ecb8422ef","resolution":{"observed_at":"2026-08-09T12:32:22.545474Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1017/9781108778459","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Fraser, Assouad Dimension and Fractal Geometry","venue":"Cambridge University Press eBooks","work_id":"fd0bd78e-9b05-4bda-858c-2ad63f30adfa","year":2020},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.342257Z"},"links":{"citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:9d4869a70ce50aaa35000e3a0e0a99fd2c387527304df0bced284ebbf54537d5","observation_id":"b224d894-9de3-49ec-abf0-9338eb5e67db","resolution":{"observed_at":"2026-08-09T12:32:22.533613Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:32:23.016649Z","title":"A comparison of signalling alphabets,","venue":null,"work_id":"468e0b76-f94d-4e97-b816-fc917a5f04e3","year":1952},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.346096Z"},"links":{"citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:f64a0f66405f20921ab13ccddde0d18273c96168c520401bfaff607ca2f57f88","observation_id":"3bd21dfb-7f3b-483b-a3cc-753bad8b0103","resolution":{"observed_at":"2026-08-09T12:32:23.020607Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08-09T12:32:24.407264Z","title":"Estimate of the number of signals in error correcting codes,","venue":null,"work_id":"071ffd09-f979-40eb-90ea-d2d5c6039949","year":1957},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.349605Z"},"links":{"citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:3de12673ccbde151d5b077a1ec64e698fb90063d61bf951f979719e703cbdc76","observation_id":"f33b5e3f-4bea-4778-88a7-f00ca49c15e7","resolution":{"observed_at":"2026-08-09T12:32:24.411534Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:32:22.352940Z","title":"Cambridge University Press, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.352940Z"},"links":{"citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:267450d4b708db23b80c78142a2241e066ab582314e274e28ec8f0a87e385e6e","observation_id":"5c445bee-8c54-4262-99b2-71d7a4e7c5be","resolution":{"observed_at":"2026-08-09T12:32:22.352940Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00220-016-2645-4","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Strong Con- verse Exponents for a Quantum Channel Discrimination Problem and Quantum-Feedback-Assisted Communication,","venue":"Communications in Mathematical Physics","work_id":"316f1b75-6de3-41ca-a0bc-54f1965da240","year":2016},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.356378Z"},"links":{"citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:e41b129dcae354feea46ec5d66a0bc98a176919c9b9a0975a9b89f822a65e702","observation_id":"d0888dbb-3be8-47be-8ee2-e67692ec000f","resolution":{"observed_at":"2026-08-09T12:32:22.515234Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:32:22.359999Z","title":"Wilde, Quantum Information Theory (2nd ed.) Cambridge University Press, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.359999Z"},"links":{"citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:e2561276c833fba0641b005162eea2275b4a59da9a24d650c0f9d0c314abe796","observation_id":"8bde74fe-1d18-444f-ae08-8df81c881a26","resolution":{"observed_at":"2026-08-09T12:32:22.359999Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:32:22.363500Z","title":"Holevo, Statistical Structure of Quantum Theory (Lec- ture Notes in Physics Monographs)","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.363500Z"},"links":{"citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:a6bb1f66196251f3f2e0ca49673c0e285ff0f873e403d9c84a92475340e5b3fd","observation_id":"3f55997c-23d1-4a3e-bba0-4bd932fded5e","resolution":{"observed_at":"2026-08-09T12:32:22.363500Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:32:24.393661Z","title":"Quantum Channels and Simultaneous ID Coding,","venue":null,"work_id":"524cd82b-3a48-43ab-b212-f2d4dfab38b9","year":1999},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.366875Z"},"links":{"citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:096ec865e9264e723bdc9715f502a8b00aa487a50bb112482a020c7eb7771d40","observation_id":"d74035c7-919a-47e1-b304-b9781c4a8d8a","resolution":{"observed_at":"2026-08-09T12:32:24.397965Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08-09T12:32:24.378183Z","title":"Strong converse for identi- fication via quantum channels,","venue":null,"work_id":"c615afc8-217d-446c-a661-9200334a9f8e","year":2002},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.370231Z"},"links":{"citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:9b01fdf1f4f44b6a69044a679e5517a163cc2ab39d48397c2a335918060b6f84","observation_id":"cd1243f2-4e17-4d3c-8e2e-4e4d62978d99","resolution":{"observed_at":"2026-08-09T12:32:24.382421Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.26421/qic4.6-7-14","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Quantum and Classical Message Identification via Quantum Channels,","venue":"Quantum Information and Computation","work_id":"df475ac6-d8ea-4dee-bce8-2da0466d7d86","year":2004},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.373738Z"},"links":{"citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:8efee494cd77afd5eac49b9a77b72b8a1dfccab4910424db51e1e14432250dfd","observation_id":"5a7fa868-cd77-42cb-9e3f-afe7d4aaf603","resolution":{"observed_at":"2026-08-09T12:32:22.488474Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/11889342","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Identification via Quantum Channels in the Presence of Prior Correlation and Feedback,","venue":"Lecture notes in computer science","work_id":"e687d66a-6221-442b-94f9-701c1a735042","year":2006},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.376885Z"},"links":{"citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:4c914b2d231a238ddbe7101621aa035a132413c8273942b94ee8400677701b56","observation_id":"d1cf4ab8-909e-4605-a238-dfe34dd43e4e","resolution":{"observed_at":"2026-08-09T12:32:22.568847Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-36899-8","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Identification via Quantum Channels,","venue":"Lecture notes in computer science","work_id":"ec31a6b6-bc06-44a0-8fa5-cb7010d4c289","year":2013},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.379779Z"},"links":{"citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:62efc6509878eeb8e1a768e54815bf28c295b5388773d6ecd70828e16c785431","observation_id":"1c37baee-1ce4-4db8-837f-db4af837f844","resolution":{"observed_at":"2026-08-09T12:32:22.475198Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09116","last_updated":"2024-09-29T22:06:31Z","snapshot_observed_at":"2026-08-07T05:13:26.637005Z","submitted_at":"2024-02-14T11:59:23Z","title":"Zero-entropy encoders and simultaneous decoders in identification via quantum channels","version":2},"cited_work":{"arxiv_id":"2402.09116","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.09116","snapshot_observed_at":"2026-08-09T12:32:22.824514Z","title":"Zero-entropy encoders and simultaneous decoders in identification via quantum channels","venue":"quant-ph","work_id":"a27b96bf-d5b4-4483-b202-a94faaf6633f","year":2024},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.383691Z"},"links":{"cited_paper":"/paper/2402.09116","citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:8a3c9a65cbfc92c2400efc5d27063ffccb4dba5903c83dcc7ca163c1565f11cd","observation_id":"309324d7-cb7b-41d5-bb52-efede453b561","resolution":{"observed_at":"2026-08-09T12:32:22.828567Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:32:22.807106Z","title":"Zero-entropy encoders and simultaneous decoders in identification via quantum channels,","venue":null,"work_id":"6e9f2575-cef6-4654-9ae0-6be5e4807982","year":2024},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.387722Z"},"links":{"citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:9cc8a700f472eac0f48e1105e038ae69ae5d43b55edfe0bd2cf215b82573afdb","observation_id":"8e33158d-f93a-4c19-bfdf-047ae7ed7cf7","resolution":{"observed_at":"2026-08-09T12:32:22.813048Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T15:58:07.019637Z","submitted_at":"2025-04-29T17:57:36Z","title":"Quantum Hypothesis Testing Lemma for Deterministic Identification over Quantum Channels","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.20991","snapshot_observed_at":"2026-08-09T12:32:22.391234Z","title":"Quantum Hypothesis Testing Lemma for Deterministic Identification over Quantum Channels,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.391234Z"},"links":{"cited_paper":"/paper/2504.20991","citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:c8ef5c5222a1cbcc062271b62617a15ee884ca23f6688e1941630e517f6298e1","observation_id":"e0f9046f-7885-4dc0-9f08-fc0a940fb447","resolution":{"observed_at":"2026-08-09T12:32:22.391234Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:32:22.395124Z","title":"Cryptographic distinguishability measures for quantum-mechanical states,","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.395124Z"},"links":{"citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:87b812fdea805e5e7b0e848091bd8547a8e38b888abdacb5ca8e547481ba65c1","observation_id":"f86ddebf-5baa-48dd-a18b-c661f4f34ac1","resolution":{"observed_at":"2026-08-09T12:32:22.395124Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:32:22.398805Z","title":"Uni- fied Framework for Continuity of Sandwiched R ´enyi Divergences,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.398805Z"},"links":{"citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:585eaf367ad623e0a64fd349aca4c286f1a4daa8caf9686759365ac2433ee6ac","observation_id":"573bd2b0-2f7a-45ad-8d64-2b9469af4adf","resolution":{"observed_at":"2026-08-09T12:32:22.398805Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12548","last_updated":"2025-01-22T00:01:16Z","snapshot_observed_at":"2026-08-10T17:01:45.180275Z","submitted_at":"2025-01-22T00:01:16Z","title":"Galaxy Codes: Advancing Achievability for Deterministic Identification via Gaussian Channels","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12548","snapshot_observed_at":"2026-08-09T12:32:22.402782Z","title":"Galaxy Codes: Advancing Achievability for Deterministic Identification via Gaussian Channels,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.402782Z"},"links":{"cited_paper":"/paper/2501.12548","citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:0dcd389b181c835f25c0e3b45f482c21afde0fa374e3c1295a1426fe119be05f","observation_id":"c1d34732-ba69-4994-9536-dbf64dbfbf81","resolution":{"observed_at":"2026-08-09T12:32:22.402782Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:32:22.248670Z","title":null,"venue":null,"work_id":null,"year":1948},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":1948,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.248670Z"},"links":{"citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:23df1a89757157ebd958b4f1f178eba8b3923bcf96fc41a7f5846182de2f3596","observation_id":"1fb9a164-e7b4-4de1-82c6-96d77cf1ce3e","resolution":{"observed_at":"2026-08-09T12:32:22.248670Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:32:22.263193Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":1989,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.263193Z"},"links":{"citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:c90cfd0f4965bf5c5e4fbb3ab1ee169b3591d5051f7f9fc6a33a46af59934718","observation_id":"8337257f-da27-4bab-b7fa-c9238c9eaf7b","resolution":{"observed_at":"2026-08-09T12:32:22.263193Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.16507","last_updated":"2024-01-29T13:32:30Z","snapshot_observed_at":"2026-07-06T16:38:17.729495Z","submitted_at":"2023-10-25T09:49:12Z","title":"Identification Capacity of the Discrete-Time Poisson Channel","version":3},"cited_work":{"arxiv_id":"2310.16507","doi":"10.48550/arxiv.2310.16507","metadata_source":"pith","pith_arxiv_id":"2310.16507","snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Identification Capacity of the Discrete-Time Poisson Channel","venue":"cs.IT","work_id":"a1170d0b-ce33-4e5f-ba1e-1436363b741e","year":2023},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.275276Z"},"links":{"cited_paper":"/paper/2310.16507","citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:896a177bacd1e006100c33074d9e0885e397795702f014c39e46fc208c4e55d2","observation_id":"42e8d3e0-dce6-4bb8-bc10-7dec7ea01723","resolution":{"observed_at":"2026-08-09T12:32:22.611089Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08-10T17:01:45.180275Z","submitted_at":"2025-01-22T00:01:16Z","title":"Galaxy Codes: Advancing Achievability for Deterministic Identification via Gaussian Channels","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12548","snapshot_observed_at":"2026-08-09T12:32:22.407073Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification","version":4},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-09T12:32:22.407073Z"},"links":{"cited_paper":"/paper/2501.12548","citing_paper":"/paper/2502.02389"},"observation_digest":"sha256:10c4e79e517e4acdec0c80b66bf04991e9cf1fd2e8741003ed693f9648ec4b73","observation_id":"8861482e-8939-49fb-80a0-ab3d3a072835","resolution":{"observed_at":"2026-08-09T12:32:22.407073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.02389","last_updated":"2025-07-26T18:16:39Z","latest_version":4,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-09T12:16:57.576884Z","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification"},"reference_resolution":{"displayed":43,"state_counts":{"malformed_identifier":2,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":14,"verified_exact":17,"verified_fuzzy":9},"total_outbound_references":43},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 43 of 43 outbound references and 3 inbound Pith citation observations for arXiv:2502.02389."}