{"as_of":"2026-08-12T12:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:92076e3a41e66d0155979ec85bc528308fb08599c305cfd5fa5427623ed66dcf","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T17:25:15.085853Z","state":"measured"},{"denominator":38,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":38,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T16:45:17.054534Z","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-08-10T16:45:17.215699Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.05959","last_updated":"2025-08-08T06:48:08Z","snapshot_observed_at":"2026-08-11T10:26:16.073424Z","submitted_at":"2025-02-09T17:03:02Z","title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment","version":2},"cited_work":{"arxiv_id":"2502.05959","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.05959","snapshot_observed_at":"2026-08-10T16:45:17.215699Z","title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment","venue":"cs.IT","work_id":"9428fe8e-8ab2-46d2-8919-29dfb9622ae3","year":2025},"citing_paper":{"arxiv_id":"2501.12971","last_updated":"2025-07-23T14:43:44Z","snapshot_observed_at":"2026-08-11T02:34:57.345344Z","submitted_at":"2025-01-22T15:57:21Z","title":"Universal Decoding over Finite-State Additive Channels via Noise Guessing","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T16:45:17.054534Z"},"links":{"cited_paper":"/paper/2502.05959","citing_paper":"/paper/2501.12971"},"observation_digest":"sha256:70ce2104ea0d1e1c4c6bed102cc6cefe67d6e3813f020372d7819cd191cfabdc","observation_id":"bcd397fc-189a-4df6-8d2e-8768585fa5e7","resolution":{"observed_at":"2026-08-10T16:45:17.226224Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2502.05959/citation-record","integrity":"/paper/2502.05959/integrity","json":"/paper/2502.05959/citation-record.json","paper":"/paper/2502.05959"},"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-08T17:25:16.912885Z","title":null,"venue":null,"work_id":"5b618177-efcf-4c90-88e0-2e088bbbe860","year":1968},"citing_paper":{"arxiv_id":"2502.05959","last_updated":"2025-08-08T06:48:08Z","snapshot_observed_at":"2026-08-11T10:26:16.073424Z","submitted_at":"2025-02-09T17:03:02Z","title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-08T17:25:14.354734Z"},"links":{"citing_paper":"/paper/2502.05959"},"observation_digest":"sha256:0db897b995e57a8fe59925d56e6e117ea9d40a52783615795f14093a2c4c0ed5","observation_id":"a5163ff3-c624-4ae1-a5fd-a28d35283461","resolution":{"observed_at":"2026-08-08T17:25:16.918095Z","resolver_source":"raw_fallback","status":"unresolved"},"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-08T17:25:16.895074Z","title":"Nonprobabilistic mutual information without memory,","venue":null,"work_id":"ce3b71e8-2ba2-4c38-bd74-b97da9d41f12","year":1975},"citing_paper":{"arxiv_id":"2502.05959","last_updated":"2025-08-08T06:48:08Z","snapshot_observed_at":"2026-08-11T10:26:16.073424Z","submitted_at":"2025-02-09T17:03:02Z","title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-08T17:25:14.466888Z"},"links":{"citing_paper":"/paper/2502.05959"},"observation_digest":"sha256:de2b892f8ea96dd8340fa5646b6d5a2b43d3c17c028fa3b8ab76cbbfc0e060ac","observation_id":"3a71128f-d448-44a5-a031-846b424702a9","resolution":{"observed_at":"2026-08-08T17:25:16.900189Z","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-08T17:25:16.868592Z","title":"Guessing and entropy,","venue":null,"work_id":"1aa27487-2f6f-41be-afa3-7419ce48447b","year":1994},"citing_paper":{"arxiv_id":"2502.05959","last_updated":"2025-08-08T06:48:08Z","snapshot_observed_at":"2026-08-11T10:26:16.073424Z","submitted_at":"2025-02-09T17:03:02Z","title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-08T17:25:14.588768Z"},"links":{"citing_paper":"/paper/2502.05959"},"observation_digest":"sha256:7046f8f5be6eebc41e048e77919ded89009377dc0cb6de8191a2e21714c36a84","observation_id":"fa0ae6cc-6283-4c6f-977d-9505bbd4332b","resolution":{"observed_at":"2026-08-08T17:25:16.873372Z","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-08T17:25:16.851506Z","title":"An inequality on guessing and its application to sequential decoding,","venue":null,"work_id":"f8208863-0383-4e70-8a2b-0a92f5733448","year":1996},"citing_paper":{"arxiv_id":"2502.05959","last_updated":"2025-08-08T06:48:08Z","snapshot_observed_at":"2026-08-11T10:26:16.073424Z","submitted_at":"2025-02-09T17:03:02Z","title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-08T17:25:14.614627Z"},"links":{"citing_paper":"/paper/2502.05959"},"observation_digest":"sha256:792a6372d563400c6949646da96538a4cea191e57412eecf1c9e02bd78f15d56","observation_id":"79d74d24-7892-49b3-88b9-e3b31d652fe6","resolution":{"observed_at":"2026-08-08T17:25:16.857299Z","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-08T17:25:16.825449Z","title":null,"venue":null,"work_id":"724ea5d4-79c2-4aed-a57a-e1197fce032a","year":2014},"citing_paper":{"arxiv_id":"2502.05959","last_updated":"2025-08-08T06:48:08Z","snapshot_observed_at":"2026-08-11T10:26:16.073424Z","submitted_at":"2025-02-09T17:03:02Z","title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-08T17:25:14.619798Z"},"links":{"citing_paper":"/paper/2502.05959"},"observation_digest":"sha256:1918a91c391d382f38db948e319c92db256d393aeaf4bc4d48eb7f626d7229a7","observation_id":"6c505567-db81-4e9e-b8b7-fe22f274eca9","resolution":{"observed_at":"2026-08-08T17:25:16.830224Z","resolver_source":"raw_fallback","status":"unresolved"},"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-08T17:25:16.808574Z","title":"Information spectrum approach to second-order coding rate in channel coding,","venue":null,"work_id":"bf1ee343-6839-433e-9134-3c6022e02088","year":2009},"citing_paper":{"arxiv_id":"2502.05959","last_updated":"2025-08-08T06:48:08Z","snapshot_observed_at":"2026-08-11T10:26:16.073424Z","submitted_at":"2025-02-09T17:03:02Z","title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-08T17:25:14.624426Z"},"links":{"citing_paper":"/paper/2502.05959"},"observation_digest":"sha256:6b76341b52ad58d33cd56f82599e05734081eaaf74dfa20d4c21680f3f6cd84c","observation_id":"5d87328f-992d-43d8-9786-292ec5c4e2a9","resolution":{"observed_at":"2026-08-08T17:25:16.813875Z","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-08T17:25:14.631422Z","title":"Csiszár and J","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2502.05959","last_updated":"2025-08-08T06:48:08Z","snapshot_observed_at":"2026-08-11T10:26:16.073424Z","submitted_at":"2025-02-09T17:03:02Z","title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-08T17:25:14.631422Z"},"links":{"citing_paper":"/paper/2502.05959"},"observation_digest":"sha256:39cdb379dd83a6bec338f942a9930a6e6035946cfef21d44eb0e89d7dfd04af0","observation_id":"30e22f11-e8e9-45c2-8f9b-09888a26b399","resolution":{"observed_at":"2026-08-08T17:25:14.631422Z","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-08T17:25:16.779330Z","title":"On the converse to the coding theorem for discrete memoryless channels (corresp.),","venue":null,"work_id":"e35cc436-b670-4712-bc33-8dd128976d4e","year":1973},"citing_paper":{"arxiv_id":"2502.05959","last_updated":"2025-08-08T06:48:08Z","snapshot_observed_at":"2026-08-11T10:26:16.073424Z","submitted_at":"2025-02-09T17:03:02Z","title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-08T17:25:14.636310Z"},"links":{"citing_paper":"/paper/2502.05959"},"observation_digest":"sha256:222aa3fcb6920f32169dcbc5d40500121d519fe80ac6b824aa55102f37c46ff2","observation_id":"754c8491-4d77-4c73-969c-337a9c4ee2cd","resolution":{"observed_at":"2026-08-08T17:25:16.785309Z","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-08T17:25:16.703569Z","title":"Reliability function of a discrete memoryless channel at rates above capacity (corresp.),","venue":null,"work_id":"14591298-3c15-4b7f-b3df-56be8b2fcba6","year":1979},"citing_paper":{"arxiv_id":"2502.05959","last_updated":"2025-08-08T06:48:08Z","snapshot_observed_at":"2026-08-11T10:26:16.073424Z","submitted_at":"2025-02-09T17:03:02Z","title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-08T17:25:14.643114Z"},"links":{"citing_paper":"/paper/2502.05959"},"observation_digest":"sha256:fcc0d80a9e70c87da86a696038ec6b19c1177c5ac2d72f7adce39a7a1a445290","observation_id":"e899077c-3fb6-4989-a564-192ac03f9446","resolution":{"observed_at":"2026-08-08T17:25:16.730507Z","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-08T17:25:16.626597Z","title":"Capacity-achieving guessing random additive noise decoding,","venue":null,"work_id":"2bf4c6db-08ad-44d5-b30a-f302add6a963","year":2019},"citing_paper":{"arxiv_id":"2502.05959","last_updated":"2025-08-08T06:48:08Z","snapshot_observed_at":"2026-08-11T10:26:16.073424Z","submitted_at":"2025-02-09T17:03:02Z","title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-08T17:25:14.657459Z"},"links":{"citing_paper":"/paper/2502.05959"},"observation_digest":"sha256:3add2b4b254dbbcc38d1fdce46a99c72f9884d1eeb4a90c023139c665ff13ada","observation_id":"e50784b6-89bc-46f1-aac9-61570c8edd79","resolution":{"observed_at":"2026-08-08T17:25:16.673376Z","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-08T17:25:16.529662Z","title":"Soft maximum likelihood decoding using GRAND,","venue":null,"work_id":"7749305f-d0fc-46fb-83ff-74a24b5b59b5","year":2020},"citing_paper":{"arxiv_id":"2502.05959","last_updated":"2025-08-08T06:48:08Z","snapshot_observed_at":"2026-08-11T10:26:16.073424Z","submitted_at":"2025-02-09T17:03:02Z","title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-08T17:25:14.674808Z"},"links":{"citing_paper":"/paper/2502.05959"},"observation_digest":"sha256:bdc010f1815c930b9b3c59fad9b62bb608c9e7be9cdf109c6de193e3ba4a5afe","observation_id":"7ed948fa-4147-47bd-a38e-c4e1308e484d","resolution":{"observed_at":"2026-08-08T17:25:16.584408Z","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-08T17:25:16.487083Z","title":"Guessing random additive noise decoding with symbol reliability information (SRGRAND),","venue":null,"work_id":"aae4981e-1d17-42ff-85b9-b833191b68bf","year":2021},"citing_paper":{"arxiv_id":"2502.05959","last_updated":"2025-08-08T06:48:08Z","snapshot_observed_at":"2026-08-11T10:26:16.073424Z","submitted_at":"2025-02-09T17:03:02Z","title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-08T17:25:14.688147Z"},"links":{"citing_paper":"/paper/2502.05959"},"observation_digest":"sha256:a8e3fd12aa34ddfa5d3313c3c3b97be77cd5a90a472ba64ca34a514d1309467f","observation_id":"f9118e22-b9cd-4161-bd36-fd8fef053cc0","resolution":{"observed_at":"2026-08-08T17:25:16.491646Z","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-08T17:25:16.467828Z","title":"Ordered reliability bits guessing random additive noise decoding,","venue":null,"work_id":"1d65eabb-5561-45e1-80e0-9b6b91cab46f","year":2022},"citing_paper":{"arxiv_id":"2502.05959","last_updated":"2025-08-08T06:48:08Z","snapshot_observed_at":"2026-08-11T10:26:16.073424Z","submitted_at":"2025-02-09T17:03:02Z","title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-08T17:25:14.692729Z"},"links":{"citing_paper":"/paper/2502.05959"},"observation_digest":"sha256:0c6894b219486c84bc0e1fc78172d14a5a730efc84f354ec7df1201f91cb02bb","observation_id":"026d7b34-9eca-4639-9f2d-7492ed55956b","resolution":{"observed_at":"2026-08-08T17:25:16.475300Z","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-08T17:25:16.450329Z","title":"Keep the bursts and ditch the interleavers,","venue":null,"work_id":"9c452a8c-f810-4231-8a0c-5c906814566f","year":2022},"citing_paper":{"arxiv_id":"2502.05959","last_updated":"2025-08-08T06:48:08Z","snapshot_observed_at":"2026-08-11T10:26:16.073424Z","submitted_at":"2025-02-09T17:03:02Z","title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-08T17:25:14.697796Z"},"links":{"citing_paper":"/paper/2502.05959"},"observation_digest":"sha256:c4c23045a1151cd520031c4058783b3d21add4a72052e2fccc5ce5ec38404eed","observation_id":"f96c0615-2c06-4cc7-a359-d00dfaa61bf0","resolution":{"observed_at":"2026-08-08T17:25:16.454975Z","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-08T17:25:16.434441Z","title":"Soft decoding without soft demapping with ORBGRAND,","venue":null,"work_id":"ca24f8ab-c679-4f9a-a21d-4c3d3d16d1f3","year":2023},"citing_paper":{"arxiv_id":"2502.05959","last_updated":"2025-08-08T06:48:08Z","snapshot_observed_at":"2026-08-11T10:26:16.073424Z","submitted_at":"2025-02-09T17:03:02Z","title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-08T17:25:14.702703Z"},"links":{"citing_paper":"/paper/2502.05959"},"observation_digest":"sha256:265ef257f4fbd371f9457f24e18156cfeecab845829811fd23746b1cdf8ed998","observation_id":"16798aa1-07de-4cbc-971b-7be35985238a","resolution":{"observed_at":"2026-08-08T17:25:16.439612Z","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-08T17:25:16.403635Z","title":"On guessing random additive noise decoding,","venue":null,"work_id":"41a60296-65f0-4e96-b26f-385879dbccce","year":2024},"citing_paper":{"arxiv_id":"2502.05959","last_updated":"2025-08-08T06:48:08Z","snapshot_observed_at":"2026-08-11T10:26:16.073424Z","submitted_at":"2025-02-09T17:03:02Z","title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-08T17:25:14.707686Z"},"links":{"citing_paper":"/paper/2502.05959"},"observation_digest":"sha256:405c5f4855138ead2305f3a4d743dec2370f5635cbb40eeb3aed8f4eeb7c0e29","observation_id":"660d4ad7-01aa-4c15-abb0-635a2dfeb842","resolution":{"observed_at":"2026-08-08T17:25:16.409270Z","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-08T17:25:16.382749Z","title":"A lower bounding method for channel and source coding probabilities,","venue":null,"work_id":"d6ff1321-6c68-4633-835f-dadffd63bd53","year":1975},"citing_paper":{"arxiv_id":"2502.05959","last_updated":"2025-08-08T06:48:08Z","snapshot_observed_at":"2026-08-11T10:26:16.073424Z","submitted_at":"2025-02-09T17:03:02Z","title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-08T17:25:14.712424Z"},"links":{"citing_paper":"/paper/2502.05959"},"observation_digest":"sha256:03b06dec6a6d2c64828760dd6de4797d467e0617431deedd0b58c5713871dd02","observation_id":"8f2aa29b-606b-414c-a7c9-9e1535c5681c","resolution":{"observed_at":"2026-08-08T17:25:16.387697Z","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-08T17:25:16.366946Z","title":"A tight upper bound for the third- order asymptotics for most discrete memoryless channels,","venue":null,"work_id":"0c70badb-655c-46b6-9eae-d442081efecb","year":2013},"citing_paper":{"arxiv_id":"2502.05959","last_updated":"2025-08-08T06:48:08Z","snapshot_observed_at":"2026-08-11T10:26:16.073424Z","submitted_at":"2025-02-09T17:03:02Z","title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-08T17:25:14.717577Z"},"links":{"citing_paper":"/paper/2502.05959"},"observation_digest":"sha256:7424cb1b27d9a09bd3a26611253e001d099d867d35213be4e9ec08854d8fe895","observation_id":"93f8f8fe-98a6-4f13-b029-6450691435ac","resolution":{"observed_at":"2026-08-08T17:25:16.371912Z","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-08T17:25:16.348398Z","title":"The dispersion of joint source- channel coding,","venue":null,"work_id":"f8370202-e012-4b52-8ab6-4396539705a7","year":2011},"citing_paper":{"arxiv_id":"2502.05959","last_updated":"2025-08-08T06:48:08Z","snapshot_observed_at":"2026-08-11T10:26:16.073424Z","submitted_at":"2025-02-09T17:03:02Z","title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-08T17:25:14.721880Z"},"links":{"citing_paper":"/paper/2502.05959"},"observation_digest":"sha256:d9c59dd69e0b40676de70002db7887c250a37a6a182020d843f6c744a5de0dbd","observation_id":"9f36d52d-90ff-45a0-a030-e24766990ceb","resolution":{"observed_at":"2026-08-08T17:25:16.356187Z","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-08T17:25:16.316373Z","title":"Channel coding rate in the finite blocklength regime,","venue":null,"work_id":"02c40cec-de1e-4db4-aa1e-cd1eed286ceb","year":2010},"citing_paper":{"arxiv_id":"2502.05959","last_updated":"2025-08-08T06:48:08Z","snapshot_observed_at":"2026-08-11T10:26:16.073424Z","submitted_at":"2025-02-09T17:03:02Z","title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-08T17:25:14.726219Z"},"links":{"citing_paper":"/paper/2502.05959"},"observation_digest":"sha256:0c19bbfdd4f09fc491eca3e5ff19fdc8a34bf2a75afa0afb48582f0fe74d3b2f","observation_id":"adbaf2cf-d990-4bd5-983d-5b4860a078ab","resolution":{"observed_at":"2026-08-08T17:25:16.326184Z","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-08T17:25:16.287649Z","title":"The dispersion of nearest- neighbor decoding for additive Non-Gaussian channels,","venue":null,"work_id":"2f01248d-b3a8-4d68-af5f-e9477bb06630","year":2017},"citing_paper":{"arxiv_id":"2502.05959","last_updated":"2025-08-08T06:48:08Z","snapshot_observed_at":"2026-08-11T10:26:16.073424Z","submitted_at":"2025-02-09T17:03:02Z","title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-08T17:25:14.730619Z"},"links":{"citing_paper":"/paper/2502.05959"},"observation_digest":"sha256:9181a60481696e54c97197afd2b7eb81ea25315b909fd99639871b6ecaadf83f","observation_id":"28bcf8b4-235d-462e-8703-687b22dbf801","resolution":{"observed_at":"2026-08-08T17:25:16.299598Z","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-08T17:25:16.254083Z","title":"Refined asymptotics for rate- distortion using Gaussian codebooks for arbitrary sources,","venue":null,"work_id":"a82316e8-bcb9-4051-a99e-f5ea91f22ca6","year":2019},"citing_paper":{"arxiv_id":"2502.05959","last_updated":"2025-08-08T06:48:08Z","snapshot_observed_at":"2026-08-11T10:26:16.073424Z","submitted_at":"2025-02-09T17:03:02Z","title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-08T17:25:14.734962Z"},"links":{"citing_paper":"/paper/2502.05959"},"observation_digest":"sha256:c7a86b32b082171aa9d435fb04dc00c70c4ac91e0b4e9181e8f96a2d3df30eb5","observation_id":"141915e9-04ea-4f5e-9adc-4484badbf3f1","resolution":{"observed_at":"2026-08-08T17:25:16.265616Z","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-08T17:25:16.065499Z","title":"On the dispersions of three network information theory problems,","venue":null,"work_id":"a1831f9b-d058-48ba-bb11-a09d75c5bbb2","year":2014},"citing_paper":{"arxiv_id":"2502.05959","last_updated":"2025-08-08T06:48:08Z","snapshot_observed_at":"2026-08-11T10:26:16.073424Z","submitted_at":"2025-02-09T17:03:02Z","title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-08T17:25:14.739092Z"},"links":{"citing_paper":"/paper/2502.05959"},"observation_digest":"sha256:5be6d45959088c3a8a2909987c6858365996c9c351a66c8e4273a95a5be1d37b","observation_id":"a4a6bc92-4022-4e49-8b20-4008b79260d6","resolution":{"observed_at":"2026-08-08T17:25:16.167573Z","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-08T17:25:15.994798Z","title":"Second-order Slepian–Wolf coding theorems for non-mixed and mixed sources,","venue":null,"work_id":"07a527b2-df2b-4cc3-b444-d51016e5a7e6","year":2014},"citing_paper":{"arxiv_id":"2502.05959","last_updated":"2025-08-08T06:48:08Z","snapshot_observed_at":"2026-08-11T10:26:16.073424Z","submitted_at":"2025-02-09T17:03:02Z","title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-08T17:25:14.749433Z"},"links":{"citing_paper":"/paper/2502.05959"},"observation_digest":"sha256:6a40353a87c95853995c49a1046f8c76868cee9830df5767ce71c45f5058da68","observation_id":"f32fa959-923c-45e2-a7e2-7a25aa258909","resolution":{"observed_at":"2026-08-08T17:25:16.010735Z","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-08T17:25:15.935483Z","title":null,"venue":null,"work_id":"e9c957da-6046-4b98-bd9d-0cbc14077355","year":2006},"citing_paper":{"arxiv_id":"2502.05959","last_updated":"2025-08-08T06:48:08Z","snapshot_observed_at":"2026-08-11T10:26:16.073424Z","submitted_at":"2025-02-09T17:03:02Z","title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-08T17:25:14.764032Z"},"links":{"citing_paper":"/paper/2502.05959"},"observation_digest":"sha256:3b8a0659737adb8d03a811a9c622f68d476b059e9672847b42ff7d52735f2e83","observation_id":"8647e737-4c50-47ae-be91-5d6b77ed249c","resolution":{"observed_at":"2026-08-08T17:25:15.959950Z","resolver_source":"raw_fallback","status":"unresolved"},"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-08T17:25:15.916052Z","title":"Second-order asymptotics for the Gaussian MAC with degraded message sets,","venue":null,"work_id":"55ce8ffa-b67d-4735-8a9e-d4fe4211f6c5","year":2015},"citing_paper":{"arxiv_id":"2502.05959","last_updated":"2025-08-08T06:48:08Z","snapshot_observed_at":"2026-08-11T10:26:16.073424Z","submitted_at":"2025-02-09T17:03:02Z","title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-08T17:25:14.777660Z"},"links":{"citing_paper":"/paper/2502.05959"},"observation_digest":"sha256:c21b54401b60facc2f40fc52c95d26447343963e0491e4ff20c332246ac2925f","observation_id":"53f7233b-fb22-4876-b91a-26fd5717dbf6","resolution":{"observed_at":"2026-08-08T17:25:15.921923Z","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-08T17:25:15.891557Z","title":"Dembo and O","venue":null,"work_id":"29136c1e-adcb-4de4-b827-0127a2590299","year":1998},"citing_paper":{"arxiv_id":"2502.05959","last_updated":"2025-08-08T06:48:08Z","snapshot_observed_at":"2026-08-11T10:26:16.073424Z","submitted_at":"2025-02-09T17:03:02Z","title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-08T17:25:14.783101Z"},"links":{"citing_paper":"/paper/2502.05959"},"observation_digest":"sha256:4055ac0f18eee9f55b9849c706e5f6f246ce78f6ffa4d5283d574cf08ffb4e68","observation_id":"5f86f771-b799-4954-b2ae-59e80178eac7","resolution":{"observed_at":"2026-08-08T17:25:15.899968Z","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-08T17:25:15.847685Z","title":"Estimating mutual information via Kolmogorov distance,","venue":null,"work_id":"0fbf2666-a884-40e1-953d-68216e40c0fe","year":2007},"citing_paper":{"arxiv_id":"2502.05959","last_updated":"2025-08-08T06:48:08Z","snapshot_observed_at":"2026-08-11T10:26:16.073424Z","submitted_at":"2025-02-09T17:03:02Z","title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-08T17:25:14.787627Z"},"links":{"citing_paper":"/paper/2502.05959"},"observation_digest":"sha256:f76e96209121e7aee531f2fb9cb2911f7ff16b1b022ab12ad65b177cda620522","observation_id":"5f679776-779f-422c-a7cb-a9c4d08ab896","resolution":{"observed_at":"2026-08-08T17:25:15.860993Z","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-08T17:25:15.735580Z","title":"Estimates of the error exponent for the semi- continuous memoryless channel (in Russian),","venue":null,"work_id":"1cbafdc5-541e-4bc1-a160-468ca69f9ed6","year":1968},"citing_paper":{"arxiv_id":"2502.05959","last_updated":"2025-08-08T06:48:08Z","snapshot_observed_at":"2026-08-11T10:26:16.073424Z","submitted_at":"2025-02-09T17:03:02Z","title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-08T17:25:14.792568Z"},"links":{"citing_paper":"/paper/2502.05959"},"observation_digest":"sha256:e1dfdcbe98aa31790ec71466be658025cb057be71837101f4137b55cda2984b1","observation_id":"826c5a32-4507-451b-9eb1-24abeb2e8f7f","resolution":{"observed_at":"2026-08-08T17:25:15.814545Z","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-08T17:25:15.538680Z","title":"Hypothesis testing and information theory,","venue":null,"work_id":"36df2c96-94ff-4e18-bc01-ad04fb634400","year":1974},"citing_paper":{"arxiv_id":"2502.05959","last_updated":"2025-08-08T06:48:08Z","snapshot_observed_at":"2026-08-11T10:26:16.073424Z","submitted_at":"2025-02-09T17:03:02Z","title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-08T17:25:14.797085Z"},"links":{"citing_paper":"/paper/2502.05959"},"observation_digest":"sha256:3929226454ea06eefac4b5efaf202b9e753a832cfb8a1bbcb59d7f1baedb12dc","observation_id":"d8b24ff0-eb58-4038-a481-db7b738ef868","resolution":{"observed_at":"2026-08-08T17:25:15.603274Z","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-08T17:25:15.497391Z","title":"Linear codes for sources and source networks: Error expo- nents, universal coding,","venue":null,"work_id":"5c1e0780-28f0-4928-821a-f6920e71a5bb","year":1982},"citing_paper":{"arxiv_id":"2502.05959","last_updated":"2025-08-08T06:48:08Z","snapshot_observed_at":"2026-08-11T10:26:16.073424Z","submitted_at":"2025-02-09T17:03:02Z","title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-08T17:25:14.801954Z"},"links":{"citing_paper":"/paper/2502.05959"},"observation_digest":"sha256:e9a4d660a48d877462cbd7c9c8e2b46a55dd93e34182d4d6b091d24ef85df7bc","observation_id":"1a9f2e3a-5504-494e-a0fe-9c05f4358bdb","resolution":{"observed_at":"2026-08-08T17:25:15.502850Z","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-08T17:25:15.467970Z","title":"Universal coding for the Slepian–Wolf data compression system and the strong converse theorem,","venue":null,"work_id":"85ef9135-9cab-41d1-9221-a121f6662be1","year":1908},"citing_paper":{"arxiv_id":"2502.05959","last_updated":"2025-08-08T06:48:08Z","snapshot_observed_at":"2026-08-11T10:26:16.073424Z","submitted_at":"2025-02-09T17:03:02Z","title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-08T17:25:14.844182Z"},"links":{"citing_paper":"/paper/2502.05959"},"observation_digest":"sha256:61b3ec390638d05a04c5039da44d4d8d476bf2c144ced2ff67baf0332d37085b","observation_id":"dba07ab8-b14b-4c96-b612-e74cd0732afc","resolution":{"observed_at":"2026-08-08T17:25:15.480620Z","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-08T17:25:15.438766Z","title":"Compound conditional source coding, slepian-wolf list decoding, and applications to media coding,","venue":null,"work_id":"3e995775-77af-4257-b687-cbb4c136dad4","year":2007},"citing_paper":{"arxiv_id":"2502.05959","last_updated":"2025-08-08T06:48:08Z","snapshot_observed_at":"2026-08-11T10:26:16.073424Z","submitted_at":"2025-02-09T17:03:02Z","title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-08T17:25:14.884656Z"},"links":{"citing_paper":"/paper/2502.05959"},"observation_digest":"sha256:c5d0401cf4fc7ed615b729e59c5a2e536282b09293d8fcd7133ccc57e6497e5b","observation_id":"e88c6cd0-45d0-4961-908e-425e80dffcd3","resolution":{"observed_at":"2026-08-08T17:25:15.448316Z","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-08T17:25:15.398303Z","title":"Scarlett, A","venue":null,"work_id":"978ddea0-2898-4673-b37d-d40f45bb697a","year":2020},"citing_paper":{"arxiv_id":"2502.05959","last_updated":"2025-08-08T06:48:08Z","snapshot_observed_at":"2026-08-11T10:26:16.073424Z","submitted_at":"2025-02-09T17:03:02Z","title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-08T17:25:14.936402Z"},"links":{"citing_paper":"/paper/2502.05959"},"observation_digest":"sha256:71d975a717c567a0743215f3fdff90a2f5ba0c117d18db6ed248ceaec9a9c384","observation_id":"db048ec2-8816-4f16-886c-805f8eb47ff1","resolution":{"observed_at":"2026-08-08T17:25:15.409776Z","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-08T17:25:15.368344Z","title":"Communication over an unknown channel via common broadcasting,","venue":null,"work_id":"00492bde-1ae2-4364-ad18-249052409f48","year":2003},"citing_paper":{"arxiv_id":"2502.05959","last_updated":"2025-08-08T06:48:08Z","snapshot_observed_at":"2026-08-11T10:26:16.073424Z","submitted_at":"2025-02-09T17:03:02Z","title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-08T17:25:14.987169Z"},"links":{"citing_paper":"/paper/2502.05959"},"observation_digest":"sha256:3e83d20810613cb77fc39ea5e8e2fb07c9f64305e96aa9c1ccd0b7837abb0dbf","observation_id":"fc9d71c8-c07f-4174-869a-394954a8f1a9","resolution":{"observed_at":"2026-08-08T17:25:15.373128Z","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-08T17:25:15.324830Z","title":"On two strong converse theorems for discrete memoryless channels,","venue":null,"work_id":"8d2ef58b-64f3-4347-ab65-8697e32fa499","year":2015},"citing_paper":{"arxiv_id":"2502.05959","last_updated":"2025-08-08T06:48:08Z","snapshot_observed_at":"2026-08-11T10:26:16.073424Z","submitted_at":"2025-02-09T17:03:02Z","title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-08T17:25:15.024959Z"},"links":{"citing_paper":"/paper/2502.05959"},"observation_digest":"sha256:fb48cda5454cd9eb7154764c4b741fc2d0f8d997eb10ac4f6d7101c1c8db31f9","observation_id":"3cb9ee50-f4d5-438d-a526-5ac77c2e958a","resolution":{"observed_at":"2026-08-08T17:25:15.343031Z","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-08T17:25:15.231323Z","title":"The random coding bound is tight for the average code,","venue":null,"work_id":"56fed238-f692-47b5-9559-6db98b7aaeee","year":1973},"citing_paper":{"arxiv_id":"2502.05959","last_updated":"2025-08-08T06:48:08Z","snapshot_observed_at":"2026-08-11T10:26:16.073424Z","submitted_at":"2025-02-09T17:03:02Z","title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-08T17:25:15.085853Z"},"links":{"citing_paper":"/paper/2502.05959"},"observation_digest":"sha256:9df09ad79bd5fc8509d3aa698a4783fb39ec3f81e0c426c0e51911737eebe9b7","observation_id":"a98d6fdd-a192-47f8-8cdf-754732c4c25d","resolution":{"observed_at":"2026-08-08T17:25:15.301175Z","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"}}],"paper":{"arxiv_id":"2502.05959","last_updated":"2025-08-08T06:48:08Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-11T10:26:16.073424Z","submitted_at":"2025-02-09T17:03:02Z","title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":0,"verified_fuzzy":33},"total_outbound_references":37},"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 37 of 37 outbound references and 1 inbound Pith citation observation for arXiv:2502.05959."}