{"as_of":"2026-08-14T08:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:87859a78c8364061fe17a4a655699c449f4ecd31de315205d7e573f99fe9f1b9","coverage":[{"denominator":7,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T13:11:50.871720Z","state":"measured"},{"denominator":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2411.16596/citation-record","integrity":"/paper/2411.16596/integrity","json":"/paper/2411.16596/citation-record.json","paper":"/paper/2411.16596"},"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-12T13:11:51.016412Z","title":"Ideal-theoretic explanation of capacity-achieving decoding","venue":null,"work_id":"3732d763-f077-440a-bede-7f29e3a8123e","year":2024},"citing_paper":{"arxiv_id":"2411.16596","last_updated":"2025-05-28T16:26:39Z","snapshot_observed_at":"2026-08-14T06:48:47.892558Z","submitted_at":"2024-11-25T17:29:17Z","title":"Bivariate Linear Operator Codes","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-12T13:11:50.838586Z"},"links":{"citing_paper":"/paper/2411.16596"},"observation_digest":"sha256:9f957682091a7a8453d6ac7207296351df7dcf6171600553d4e93bcf7ac15bc1","observation_id":"71dbd329-5684-4670-ab6c-43d5818e76d7","resolution":{"observed_at":"2026-08-12T13:11:51.021610Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.15034","last_updated":"2024-01-26T17:53:34Z","snapshot_observed_at":"2026-08-14T01:42:19.916021Z","submitted_at":"2024-01-26T17:53:34Z","title":"Explicit Subcodes of Reed-Solomon Codes that Efficiently Achieve List Decoding Capacity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.15034","snapshot_observed_at":"2026-08-12T13:11:50.844098Z","title":"Explicit subcodes of reed-solomon codes that efficiently achieve list decoding capacity","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.16596","last_updated":"2025-05-28T16:26:39Z","snapshot_observed_at":"2026-08-14T06:48:47.892558Z","submitted_at":"2024-11-25T17:29:17Z","title":"Bivariate Linear Operator Codes","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-12T13:11:50.844098Z"},"links":{"cited_paper":"/paper/2401.15034","citing_paper":"/paper/2411.16596"},"observation_digest":"sha256:b272907f967447136bc1b764615e3fac98df57fa58e31711301ac46fbb231be7","observation_id":"39e08599-32a1-4794-9f20-ae64ab25ab6f","resolution":{"observed_at":"2026-08-12T13:11:50.844098Z","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-12T13:11:50.999835Z","title":"List decoding for noisy channels","venue":null,"work_id":"83773790-71ac-4d0d-b40f-9e60a78383b1","year":1957},"citing_paper":{"arxiv_id":"2411.16596","last_updated":"2025-05-28T16:26:39Z","snapshot_observed_at":"2026-08-14T06:48:47.892558Z","submitted_at":"2024-11-25T17:29:17Z","title":"Bivariate Linear Operator Codes","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-12T13:11:50.850510Z"},"links":{"citing_paper":"/paper/2411.16596"},"observation_digest":"sha256:8df9b89d155d648e87330e111f3851ea7113dfa1a6e84458d7f8ec0c3b26d11f","observation_id":"f9f0beb6-9fd7-4688-846a-966902f12208","resolution":{"observed_at":"2026-08-12T13:11:51.005181Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"cs/0511072","last_updated":"2007-10-08T18:36:41Z","snapshot_observed_at":"2026-07-07T03:07:15.469842Z","submitted_at":"2005-11-18T22:31:44Z","title":"Explicit Codes Achieving List Decoding Capacity: Error-correction with Optimal Redundancy","version":2},"cited_work":{"arxiv_id":"cs/0511072","doi":null,"metadata_source":"pith","pith_arxiv_id":"cs/0511072","snapshot_observed_at":"2026-08-12T13:11:50.926759Z","title":"Explicit Codes Achieving List Decoding Capacity: Error-correction with Optimal Redundancy","venue":"cs.IT","work_id":"b3c48c5f-4227-4f85-8237-3021673a7d40","year":2005},"citing_paper":{"arxiv_id":"2411.16596","last_updated":"2025-05-28T16:26:39Z","snapshot_observed_at":"2026-08-14T06:48:47.892558Z","submitted_at":"2024-11-25T17:29:17Z","title":"Bivariate Linear Operator Codes","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-12T13:11:50.855453Z"},"links":{"cited_paper":"/paper/cs/0511072","citing_paper":"/paper/2411.16596"},"observation_digest":"sha256:3da495f01739f0f0a37740d6a0d6c7762343fc86a09ae2267c2eb1fbc4e611a0","observation_id":"cb5fd729-3471-43ab-8d22-19bcce825fe8","resolution":{"observed_at":"2026-08-12T13:11:50.934076Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T13:11:50.983145Z","title":"Linear-algebraic list decoding for variants of reed-solomon codes","venue":null,"work_id":"d9f2661f-7acf-4ba2-886a-6368cf76200a","year":2012},"citing_paper":{"arxiv_id":"2411.16596","last_updated":"2025-05-28T16:26:39Z","snapshot_observed_at":"2026-08-14T06:48:47.892558Z","submitted_at":"2024-11-25T17:29:17Z","title":"Bivariate Linear Operator Codes","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-12T13:11:50.861099Z"},"links":{"citing_paper":"/paper/2411.16596"},"observation_digest":"sha256:18466efdb707435b4287215fa40fde3824c656712d34fbe2f6a6b34be8e73251","observation_id":"2408d991-fc89-4f4d-ab7f-8f4e171d37d8","resolution":{"observed_at":"2026-08-12T13:11:50.988551Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T13:11:50.965495Z","title":"Improved list decoding of folded reed-solomon and multiplicity codes","venue":null,"work_id":"ac9746ca-9ebc-427e-b305-f383dd78822a","year":2023},"citing_paper":{"arxiv_id":"2411.16596","last_updated":"2025-05-28T16:26:39Z","snapshot_observed_at":"2026-08-14T06:48:47.892558Z","submitted_at":"2024-11-25T17:29:17Z","title":"Bivariate Linear Operator Codes","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T13:11:50.865865Z"},"links":{"citing_paper":"/paper/2411.16596"},"observation_digest":"sha256:f5b3418f54d0bc46df7f59e8414efe80d253e125e90cc984e37ac14bff219c8f","observation_id":"c6c1331b-7f40-47c7-b858-1841244f5545","resolution":{"observed_at":"2026-08-12T13:11:50.971465Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.17097","last_updated":"2023-12-28T16:20:17Z","snapshot_observed_at":"2026-08-13T04:52:48.377552Z","submitted_at":"2023-12-28T16:20:17Z","title":"Tighter List-Size Bounds for List-Decoding and Recovery of Folded Reed-Solomon and Multiplicity Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.17097","snapshot_observed_at":"2026-08-12T13:11:50.871720Z","title":"Tighter list-size bounds for list-decoding and recovery of folded reed-solomon and multiplicity codes","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.16596","last_updated":"2025-05-28T16:26:39Z","snapshot_observed_at":"2026-08-14T06:48:47.892558Z","submitted_at":"2024-11-25T17:29:17Z","title":"Bivariate Linear Operator Codes","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-12T13:11:50.871720Z"},"links":{"cited_paper":"/paper/2312.17097","citing_paper":"/paper/2411.16596"},"observation_digest":"sha256:ca8e0de0b1a27d34046cba101d4a51b3ed2be2a5afd5ef81314cdde61c620c61","observation_id":"809b7342-4d78-4c0b-aec3-ae1637660a0d","resolution":{"observed_at":"2026-08-12T13:11:50.871720Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2411.16596","last_updated":"2025-05-28T16:26:39Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-14T06:48:47.892558Z","submitted_at":"2024-11-25T17:29:17Z","title":"Bivariate Linear Operator Codes"},"reference_resolution":{"displayed":7,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":1,"verified_fuzzy":4},"total_outbound_references":7},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 7 of 7 outbound references and 0 inbound Pith citation observations for arXiv:2411.16596."}