{"as_of":"2026-08-11T04:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9abfad6027d6b6bd65aa8bb540d8494517b51d5ec67c6dda963280fa164d47e7","coverage":[{"denominator":36,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":36,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T16:45:17.171554Z","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-10T06:31:04.303077+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T23:32:17.855729Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12971","snapshot_observed_at":"2026-08-01T23:32:17.855729Z","title":"Universal decoding over finite-state additive channels via noise guessing,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.15404","last_updated":"2026-07-30T06:13:40Z","snapshot_observed_at":"2026-08-06T07:10:19.454928Z","submitted_at":"2026-07-16T19:14:28Z","title":"Closed-Loop Bayesian Bandit Encoder with GRAND Receiver for a Bursty Interference Channel","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T23:32:17.855729Z"},"links":{"cited_paper":"/paper/2501.12971","citing_paper":"/paper/2607.15404"},"observation_digest":"sha256:0ebf234868ec70c133a0cf992a840d763c6d54fd4c207a28f3bb3703731882b5","observation_id":"bc59092b-98a3-4688-a53b-7f5dd0f96746","resolution":{"observed_at":"2026-08-01T23:32:17.855729Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12971","snapshot_observed_at":"2026-07-31T09:41:19.814830Z","title":"On universal decoding over discrete additive channels by noise guessing,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:19.814830Z"},"links":{"cited_paper":"/paper/2501.12971","citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:cb1230ebe323a5d109bcbe9a55cc9d645d5d96260cdc293376bab588d2cfa043","observation_id":"e1a80813-45b5-4f89-bdd7-9fecb1a0e20e","resolution":{"observed_at":"2026-07-31T09:41:19.814830Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2501.12971/citation-record","integrity":"/paper/2501.12971/integrity","json":"/paper/2501.12971/citation-record.json","paper":"/paper/2501.12971"},"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-10T16:45:17.792676Z","title":"Reliable communication under channel uncertainty,","venue":null,"work_id":"0e99dcfc-4fb6-4290-97d6-8b46171b50b1","year":1998},"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":1,"source":"pdf_text","source_observed_at":"2026-08-10T16:45:16.934385Z"},"links":{"citing_paper":"/paper/2501.12971"},"observation_digest":"sha256:54dc431a8a2f6870ee86a5cd9e0d98fc74a73200ac5dc44621c127a641d16d9d","observation_id":"7c54110f-ff1f-4bf9-8f1f-6d36c319f72e","resolution":{"observed_at":"2026-08-10T16:45:17.799632Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T16:45:17.776429Z","title":"Universal decoding for channels with memory,","venue":null,"work_id":"8b78022d-f8ee-413d-ad10-0a2d06f612e9","year":1998},"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":2,"source":"pdf_text","source_observed_at":"2026-08-10T16:45:16.940735Z"},"links":{"citing_paper":"/paper/2501.12971"},"observation_digest":"sha256:a6f30a739839b505ac268641090d54ee495bdc0428b29f7e21cea3b68f9a1498","observation_id":"43f64ed6-02d6-4c4a-b5cc-5b87af08b021","resolution":{"observed_at":"2026-08-10T16:45:17.782416Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T16:45:17.756995Z","title":"Nonprobabilistic mutual information with memory,","venue":null,"work_id":"14dae4ee-c0f2-442c-abfd-da41742828db","year":1975},"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":3,"source":"pdf_text","source_observed_at":"2026-08-10T16:45:16.946505Z"},"links":{"citing_paper":"/paper/2501.12971"},"observation_digest":"sha256:d7d98c56ccc5b26bd1266524489363e9094b3e3d93ae29f149744abd75a5f841","observation_id":"aaf54351-20f8-4953-be4a-36e003f9c431","resolution":{"observed_at":"2026-08-10T16:45:17.761464Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T16:45:16.952099Z","title":"Csiszár and J","venue":null,"work_id":null,"year":2011},"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":4,"source":"pdf_text","source_observed_at":"2026-08-10T16:45:16.952099Z"},"links":{"citing_paper":"/paper/2501.12971"},"observation_digest":"sha256:dbcf5f771ebd2ce5acfa336496bacd30f2874390b6f20fb498a8f66fe5ac98df","observation_id":"efd2092d-a111-4314-9022-d92efb768f1c","resolution":{"observed_at":"2026-08-10T16:45:16.952099Z","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-10T16:45:17.734369Z","title":"Universal decoding for finite-state channels,","venue":null,"work_id":"0e96e536-f2b3-44cd-b90e-06693d37a69f","year":1985},"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":5,"source":"pdf_text","source_observed_at":"2026-08-10T16:45:16.959913Z"},"links":{"citing_paper":"/paper/2501.12971"},"observation_digest":"sha256:0d6af807ea9f8bf30d01b877dbb83f85a783c3274160df32675ed1af6898d750","observation_id":"94fcec9c-2610-4e51-8153-61e2ee010f10","resolution":{"observed_at":"2026-08-10T16:45:17.739297Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T16:45:17.719436Z","title":"Universal decoding for memoryless Gaussian channels with a deterministic interference,","venue":null,"work_id":"92d6f3c6-63bf-407f-9e2a-145dc32bce13","year":1993},"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":6,"source":"pdf_text","source_observed_at":"2026-08-10T16:45:16.965380Z"},"links":{"citing_paper":"/paper/2501.12971"},"observation_digest":"sha256:c1ff1d5b86c6fd7055c2b95fad57068de3ea2af2be0e6ac77b5871fbaf8e3e3a","observation_id":"5c4f89d1-777b-41e3-b0ae-b2c35a0f2362","resolution":{"observed_at":"2026-08-10T16:45:17.724089Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T16:45:17.705786Z","title":"On the universality of the LZ-based decoding algorithm,","venue":null,"work_id":"5dc8db24-f7c5-4041-b1c0-bea9426b0462","year":1998},"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":7,"source":"pdf_text","source_observed_at":"2026-08-10T16:45:16.971029Z"},"links":{"citing_paper":"/paper/2501.12971"},"observation_digest":"sha256:2cb41b23c05c8695c77ac551de3fbef19d84cfa03ed74d5e795d5b086da2dbf9","observation_id":"2c814792-1937-4069-a644-a122162edb60","resolution":{"observed_at":"2026-08-10T16:45:17.710639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T16:45:17.691445Z","title":"Universal composite hypothesis testing: a competitive minimax approach,","venue":null,"work_id":"59837c15-c1ba-4b3e-b279-66c6a5a3b0b2","year":2002},"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":8,"source":"pdf_text","source_observed_at":"2026-08-10T16:45:16.976660Z"},"links":{"citing_paper":"/paper/2501.12971"},"observation_digest":"sha256:76f4784b7d1e3833707a165a9fb0c8573bddc567e26618b638d5058c221dd0cb","observation_id":"c1bb0d98-c690-4929-a445-192121b50139","resolution":{"observed_at":"2026-08-10T16:45:17.695506Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T16:45:17.678456Z","title":"Universal decoding for frequency-selective fading channels,","venue":null,"work_id":"a631e094-8273-45fa-a0fb-577bfc354d63","year":2005},"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":9,"source":"pdf_text","source_observed_at":"2026-08-10T16:45:16.984474Z"},"links":{"citing_paper":"/paper/2501.12971"},"observation_digest":"sha256:2adeb3b2ba2e2942a93cb938cb69abae8265f4554262baa60a4c1eba2035ff03","observation_id":"9f0ed28c-431c-4b4c-afc0-de0c90b993f9","resolution":{"observed_at":"2026-08-10T16:45:17.683401Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T16:45:17.664105Z","title":"Universal decoding for arbitrary channels relative to a given class of decoding metrics,","venue":null,"work_id":"5155a47c-cdc1-49dc-8e6e-6348c2a1cee9","year":2013},"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":10,"source":"pdf_text","source_observed_at":"2026-08-10T16:45:16.991044Z"},"links":{"citing_paper":"/paper/2501.12971"},"observation_digest":"sha256:de076e04293550bccc2495c4675d47ae118335105a48b117a065fd13c9ea1978","observation_id":"b7bdc9d5-834f-464c-b99d-7c7bb33542f6","resolution":{"observed_at":"2026-08-10T16:45:17.669105Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T16:45:17.648347Z","title":"Universal decoding for Gaussian intersymbol interference channels,","venue":null,"work_id":"a655d14f-fc1c-4bd7-8051-40ba0149fa4b","year":2015},"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":11,"source":"pdf_text","source_observed_at":"2026-08-10T16:45:16.995900Z"},"links":{"citing_paper":"/paper/2501.12971"},"observation_digest":"sha256:559f8ad7e29c8009d3ee70233d22fcd1040a688529906ae8c629f06bc00625ce","observation_id":"5218e0c5-d6a4-42e6-9f8f-f45dc9ec223d","resolution":{"observed_at":"2026-08-10T16:45:17.653680Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T16:45:17.629780Z","title":"Exact random coding exponents and universal decoders for the asymmetric broadcast channel,","venue":null,"work_id":"ebe7212c-684e-4aa3-b79d-4ef20bb30e86","year":2018},"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":12,"source":"pdf_text","source_observed_at":"2026-08-10T16:45:17.001821Z"},"links":{"citing_paper":"/paper/2501.12971"},"observation_digest":"sha256:ae1f224ebb6863bf4feb704bc3a7aba4215b11d7d3ca040946b898332ca5a94c","observation_id":"61ebaaed-2911-47ca-8d59-e895495650d7","resolution":{"observed_at":"2026-08-10T16:45:17.636988Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T16:45:17.611808Z","title":"Universal decoding for the typical random code and for the expurgated code,","venue":null,"work_id":"646e0b02-ca34-48a6-ad0e-c46f7a972f3a","year":2022},"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":13,"source":"pdf_text","source_observed_at":"2026-08-10T16:45:17.009383Z"},"links":{"citing_paper":"/paper/2501.12971"},"observation_digest":"sha256:6e7fa98b65e0236b44688c9af501c6764ccfbc341fe3040af29d74f6db70b6f0","observation_id":"902db0a3-b1e6-438a-972d-6bf3ce1a2b4e","resolution":{"observed_at":"2026-08-10T16:45:17.618990Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T16:45:17.597330Z","title":"On universal decoding over memoryless channels with the Krichevsky–Trofimov estimator,","venue":null,"work_id":"1bc971e1-304f-4399-81f7-c87d63155b27","year":2024},"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":14,"source":"pdf_text","source_observed_at":"2026-08-10T16:45:17.016510Z"},"links":{"citing_paper":"/paper/2501.12971"},"observation_digest":"sha256:d65d1c6a57a9b8faa7546fefbb8b56e2c64ede2e1a4da67e7568ea3233679aad","observation_id":"f2fdf9ab-9558-4653-bd40-0ee1832f3a1e","resolution":{"observed_at":"2026-08-10T16:45:17.601651Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T16:45:17.582175Z","title":"On the decoding of convolutional codes on an unknown channel,","venue":null,"work_id":"52eef8be-8857-49f2-bfcb-135633d93d01","year":1999},"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":15,"source":"pdf_text","source_observed_at":"2026-08-10T16:45:17.022181Z"},"links":{"citing_paper":"/paper/2501.12971"},"observation_digest":"sha256:aa4573147a08c0723f9c6f2c81a4ffa2c7bedec6db17915dcdd5baba4c1b98f4","observation_id":"d8ed7df9-52ac-4b0d-bdcb-22201583f7cf","resolution":{"observed_at":"2026-08-10T16:45:17.587968Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T16:45:17.558618Z","title":"Capacity-achieving guessing random additive noise decoding,","venue":null,"work_id":"2adfeab3-d7f1-45a3-9311-ae77f60ec166","year":2019},"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":16,"source":"pdf_text","source_observed_at":"2026-08-10T16:45:17.030122Z"},"links":{"citing_paper":"/paper/2501.12971"},"observation_digest":"sha256:8e3a2dea722e785a76acb7443cafe1825a4b371ef02488713dc0f016e2df8130","observation_id":"e543e039-a0d2-44ab-a657-294dc98e2723","resolution":{"observed_at":"2026-08-10T16:45:17.569987Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T16:45:17.036399Z","title":"Keep the bursts and ditch the interleavers,","venue":null,"work_id":null,"year":2022},"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":17,"source":"pdf_text","source_observed_at":"2026-08-10T16:45:17.036399Z"},"links":{"citing_paper":"/paper/2501.12971"},"observation_digest":"sha256:99b7228b163262f504351aa4827e3d2bbcd82ba80e5b8564232dd98b913df983","observation_id":"ed548de9-d5a3-4a2c-bb9a-7d3bca84208e","resolution":{"observed_at":"2026-08-10T16:45:17.036399Z","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-10T16:45:17.535563Z","title":"On guessing random additive noise decoding,","venue":null,"work_id":"695b2753-6e35-4abc-865c-54160ae269ac","year":2024},"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":18,"source":"pdf_text","source_observed_at":"2026-08-10T16:45:17.044815Z"},"links":{"citing_paper":"/paper/2501.12971"},"observation_digest":"sha256:1343f49583eaeccd0b90d3c7329fe5b2a9abb9207ca0bc40229eeb6a6a5d32fa","observation_id":"79e87352-01f3-4d7c-babb-5c2000c668f7","resolution":{"observed_at":"2026-08-10T16:45:17.540142Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.05959","last_updated":"2025-08-08T06:48:08Z","snapshot_observed_at":"2026-08-08T17:10:54.207886Z","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:cf404e409c849825808dde008064b277a60700e070f657b319a73db52c8af164","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T16:45:17.522203Z","title":"Universal randomized guessing with application to asynchronous decentralized brute–force attacks,","venue":null,"work_id":"370daa33-989d-441c-a8ba-b086aaa9924f","year":2020},"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":20,"source":"pdf_text","source_observed_at":"2026-08-10T16:45:17.070198Z"},"links":{"citing_paper":"/paper/2501.12971"},"observation_digest":"sha256:ff05e2003d0d33b64a8302c9f923a1f5bfcf041b50e523e5af33d745134d8663","observation_id":"d6f376b8-bfbf-4f9b-b9ee-3a28ebc0b3fc","resolution":{"observed_at":"2026-08-10T16:45:17.526359Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T16:45:17.509462Z","title":"The likelihood decoder: Error exponents and mismatch,","venue":null,"work_id":"b8b26f7a-9600-45f6-92bd-f17e835924cf","year":2015},"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":21,"source":"pdf_text","source_observed_at":"2026-08-10T16:45:17.084757Z"},"links":{"citing_paper":"/paper/2501.12971"},"observation_digest":"sha256:1ca95b3c6d6d84931a6185413da2d075db690be07a2ed290844577ddc736fa6a","observation_id":"541b75e2-7053-4bb4-a623-ceed92ce3d50","resolution":{"observed_at":"2026-08-10T16:45:17.514156Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T16:45:17.487484Z","title":"The generalized stochastic likelihood decoder: Random coding and expurgated bounds,","venue":null,"work_id":"8c2b289e-5e58-48f5-9228-68972a4d4ede","year":2017},"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":22,"source":"pdf_text","source_observed_at":"2026-08-10T16:45:17.090100Z"},"links":{"citing_paper":"/paper/2501.12971"},"observation_digest":"sha256:05c71ad6b9b79af7525b1edc17f21128b49f8857fd74fb78cd03deff2c2cfa93","observation_id":"b5e35259-a525-481f-a83b-8a08a3b2aaf9","resolution":{"observed_at":"2026-08-10T16:45:17.495219Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T16:45:17.470879Z","title":"The method of types [information theory],","venue":null,"work_id":"302682a2-3401-4c6b-afa5-59ebba9da546","year":1998},"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":23,"source":"pdf_text","source_observed_at":"2026-08-10T16:45:17.097350Z"},"links":{"citing_paper":"/paper/2501.12971"},"observation_digest":"sha256:f47d1f3cfee949d3a6635ba0db210cd14530346c10650d045c0202dacd2e5e2f","observation_id":"f4da307b-9eba-4dee-a4c6-a9952367acc3","resolution":{"observed_at":"2026-08-10T16:45:17.475967Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T16:45:17.454233Z","title":"Universal noiseless coding,","venue":null,"work_id":"822f94f5-5520-474a-bd74-35cc8717cc39","year":1973},"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":24,"source":"pdf_text","source_observed_at":"2026-08-10T16:45:17.106096Z"},"links":{"citing_paper":"/paper/2501.12971"},"observation_digest":"sha256:143d4c47dcdced24a2f872eebab29bbf6853df352f635f021c6459c7280974f2","observation_id":"079d8f09-1207-46b5-82e4-b3a4f7589b86","resolution":{"observed_at":"2026-08-10T16:45:17.460083Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T16:45:17.438945Z","title":null,"venue":null,"work_id":"2a48764d-8f13-441f-93c3-0305512b0e1e","year":1990},"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":25,"source":"pdf_text","source_observed_at":"2026-08-10T16:45:17.111496Z"},"links":{"citing_paper":"/paper/2501.12971"},"observation_digest":"sha256:01450a3135cddb8356b92b38de50e09735cb159a7530195ce0d7a65cbef33dab","observation_id":"5769b630-278a-49df-8ea5-dbe9ac111b54","resolution":{"observed_at":"2026-08-10T16:45:17.443263Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T16:45:17.422826Z","title":"A sequential algorithm for the universal coding of finite memory sources,","venue":null,"work_id":"55080aee-3dbe-4e56-b695-8bf0f992975d","year":1992},"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":26,"source":"pdf_text","source_observed_at":"2026-08-10T16:45:17.117152Z"},"links":{"citing_paper":"/paper/2501.12971"},"observation_digest":"sha256:075a3b1363721f592a53e0eff94e4721cdd63aa92d3eb322f83e7a197cda16da","observation_id":"f8720eea-6a1a-437e-a1b2-f3a2e4dcdefb","resolution":{"observed_at":"2026-08-10T16:45:17.427813Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T16:45:17.405789Z","title":"Complexity of strings in the class of Markov sources,","venue":null,"work_id":"f5e8ad24-4c8f-40db-ae7b-0db6f5c735c1","year":1986},"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":27,"source":"pdf_text","source_observed_at":"2026-08-10T16:45:17.122500Z"},"links":{"citing_paper":"/paper/2501.12971"},"observation_digest":"sha256:cf80935a4507e712c96d55045a08a5c10653c175be4ce344de9d15a0d062f071","observation_id":"b15f1555-6105-4b0d-8e63-a65e9099c746","resolution":{"observed_at":"2026-08-10T16:45:17.410606Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T16:45:17.390606Z","title":"The error exponent for the noiseless encoding of finite ergodic Markov sources,","venue":null,"work_id":"05724048-96ec-4e39-8724-8ceed9b871bb","year":1981},"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":28,"source":"pdf_text","source_observed_at":"2026-08-10T16:45:17.128669Z"},"links":{"citing_paper":"/paper/2501.12971"},"observation_digest":"sha256:7a15294d390ee8802d4e13cad76f256b7911364c5febf1c269bc2ba8d650fb50","observation_id":"a2375ef7-3f18-4b18-89bc-8e4b7b1d820c","resolution":{"observed_at":"2026-08-10T16:45:17.395433Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T16:45:17.375089Z","title":"Type classes of context trees,","venue":null,"work_id":"953394da-c063-4308-b57b-271868ea80c2","year":2012},"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":29,"source":"pdf_text","source_observed_at":"2026-08-10T16:45:17.133528Z"},"links":{"citing_paper":"/paper/2501.12971"},"observation_digest":"sha256:38b1dc6a0f8ba1c380a8e77267dd2d7542443e70e063215ecee4eee4e67c2aec","observation_id":"2414bcab-ea7b-45fe-86e3-b0314c6e0417","resolution":{"observed_at":"2026-08-10T16:45:17.380067Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T16:45:17.360436Z","title":"Gassiat, Universal Coding and Order Identification by Model Selection Methods","venue":null,"work_id":"45c77fa1-91af-402a-b49a-7d2de6e2aaf2","year":2018},"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":30,"source":"pdf_text","source_observed_at":"2026-08-10T16:45:17.139045Z"},"links":{"citing_paper":"/paper/2501.12971"},"observation_digest":"sha256:5aea2bdf6699171682148791bb7f9f9dcfd6db30b2709f90772bcdb9c2236f75","observation_id":"c36d07ba-f1db-4cad-a9e6-aae77bd8f59b","resolution":{"observed_at":"2026-08-10T16:45:17.365676Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T16:45:17.340595Z","title":"Guessing revisited: A large deviations approach,","venue":null,"work_id":"1b603681-44c0-4932-9dbf-ba10968d9531","year":2011},"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":31,"source":"pdf_text","source_observed_at":"2026-08-10T16:45:17.144250Z"},"links":{"citing_paper":"/paper/2501.12971"},"observation_digest":"sha256:2f0e9f9c7b36952f2d9635b26eeb385361b10a9844fa6ddf76762e5c5b6bb721","observation_id":"e8091e3e-1ac2-4e21-aaaf-71f43f6b29a2","resolution":{"observed_at":"2026-08-10T16:45:17.345988Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T16:45:17.321310Z","title":"Enumerative source encoding,","venue":null,"work_id":"50ac851e-bb67-4b53-96f8-5a1659dbf4f5","year":1973},"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":32,"source":"pdf_text","source_observed_at":"2026-08-10T16:45:17.148815Z"},"links":{"citing_paper":"/paper/2501.12971"},"observation_digest":"sha256:8cbec3c5a02d42b1ca1dfc7dc532feb706860c32bb669cd222af8fd92f55383c","observation_id":"e42b8a8e-d3dd-4485-9ed1-74e672ccceae","resolution":{"observed_at":"2026-08-10T16:45:17.327074Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T16:45:17.299345Z","title":"Randomised attacks on passwords,","venue":null,"work_id":"e2b8ec2e-353e-4bdc-90dd-27d94cb7c39a","year":2010},"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":33,"source":"pdf_text","source_observed_at":"2026-08-10T16:45:17.154769Z"},"links":{"citing_paper":"/paper/2501.12971"},"observation_digest":"sha256:bab2f4cf0c94efe77cd9e4f957dd932e4e526374b0d0dbadac448d82d95f2001","observation_id":"f220990a-ad9c-4d8d-944f-b0a51bf9eda9","resolution":{"observed_at":"2026-08-10T16:45:17.306610Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T16:45:17.277780Z","title":"Oblivious distributed guessing,","venue":null,"work_id":"9d622592-5472-4d86-a01e-516a35f84337","year":2012},"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":34,"source":"pdf_text","source_observed_at":"2026-08-10T16:45:17.161201Z"},"links":{"citing_paper":"/paper/2501.12971"},"observation_digest":"sha256:834917e4e581c060195680c3848c860cb805f08212460ba7ba360c8a9d4b0094","observation_id":"5a1406a3-5cbb-424f-9f79-5fe8421a7ac3","resolution":{"observed_at":"2026-08-10T16:45:17.283932Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T16:45:17.259162Z","title":"Guessing with limited memory,","venue":null,"work_id":"6f1d7272-89ff-4c7c-aac8-db136e34c36c","year":2017},"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":35,"source":"pdf_text","source_observed_at":"2026-08-10T16:45:17.165879Z"},"links":{"citing_paper":"/paper/2501.12971"},"observation_digest":"sha256:cc40b7908835600e6934b92317669e3eeb9d4e44335f46702cc7cc9916ef1c2d","observation_id":"d9bde7bf-4a85-410d-bc94-0bbd5a4e4580","resolution":{"observed_at":"2026-08-10T16:45:17.264810Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T16:45:17.240180Z","title":"Mismatched decoding: Error exponents, second-order rates and saddlepoint approximations,","venue":null,"work_id":"526dbc89-696f-4719-bc47-f5fe1ac6f955","year":2014},"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":36,"source":"pdf_text","source_observed_at":"2026-08-10T16:45:17.171554Z"},"links":{"citing_paper":"/paper/2501.12971"},"observation_digest":"sha256:3095a21ab5f2140bf65f63aa668ad4c841354437f46c172dec3831248497ea16","observation_id":"22a93fd2-57aa-4868-b01c-9e7aadb95ada","resolution":{"observed_at":"2026-08-10T16:45:17.245312Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.12971","last_updated":"2025-07-23T14:43:44Z","latest_version":2,"primary_category":"cs.IT","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"},"reference_resolution":{"displayed":36,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":1,"verified_fuzzy":32},"total_outbound_references":36},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 36 of 36 outbound references and 2 inbound Pith citation observations for arXiv:2501.12971."}