{"as_of":"2026-08-17T22:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7aaf17ec1d98b1e29b3b986259dab6862d392ddf6cfb6d18d186178607190860","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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-12T13:11:50.871720Z","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-08T17:54:42.216969Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2312.17097","last_updated":"2023-12-28T16:20:17Z","snapshot_observed_at":"2026-08-16T14:31:08.550052Z","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:a8774607cd16cc98605673359ffa3c24e225148a2f3c1292002772733e6359cd","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"}},{"citation":{"cited_paper":{"arxiv_id":"2312.17097","last_updated":"2023-12-28T16:20:17Z","snapshot_observed_at":"2026-08-16T14:31:08.550052Z","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":"2312.17097","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.17097","snapshot_observed_at":"2026-08-08T17:54:42.216969Z","title":"Tighter List-Size Bounds for List-Decoding and Recovery of Folded Reed-Solomon and Multiplicity Codes","venue":"cs.IT","work_id":"f52247cb-ab0a-4340-9b03-07ede9d8f39f","year":2023},"citing_paper":{"arxiv_id":"2502.05858","last_updated":"2025-05-08T19:26:25Z","snapshot_observed_at":"2026-08-14T03:00:47.861872Z","submitted_at":"2025-02-09T11:34:54Z","title":"Let's Have Both! Optimal List-Recoverability via Alphabet Permutation Codes","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-08T17:54:42.181686Z"},"links":{"cited_paper":"/paper/2312.17097","citing_paper":"/paper/2502.05858"},"observation_digest":"sha256:96a0c01afe75fceceef5ebfec2161501d472490495d0c2f2a37a530d86600e5f","observation_id":"bac82d7d-c843-4c57-a673-b0ffbc68de32","resolution":{"observed_at":"2026-08-08T17:54:42.221914Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2312.17097/citation-record","integrity":"/paper/2312.17097/integrity","json":"/paper/2312.17097/citation-record.json","paper":"/paper/2312.17097"},"outbound":[],"paper":{"arxiv_id":"2312.17097","last_updated":"2023-12-28T16:20:17Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-16T14:31:08.550052Z","submitted_at":"2023-12-28T16:20:17Z","title":"Tighter List-Size Bounds for List-Decoding and Recovery of Folded Reed-Solomon and Multiplicity Codes"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2312.17097."}