{"as_of":"2026-08-17T17:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6f2f734f9b03c9d2c8cb941b75f92ae3b2cf6f29dfd7ba1b4f2395dc1910b091","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T13:16:44.920237Z","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-08T13:16:45.710429Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.09031","last_updated":"2024-10-11T17:48:43Z","snapshot_observed_at":"2026-08-16T13:10:14.027635Z","submitted_at":"2024-10-11T17:48:43Z","title":"Improved List Size for Folded Reed-Solomon Codes","version":1},"cited_work":{"arxiv_id":"2410.09031","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.09031","snapshot_observed_at":"2026-08-08T13:16:45.710429Z","title":"Improved List Size for Folded Reed-Solomon Codes","venue":"cs.IT","work_id":"24e5618f-e28d-465c-9cbf-cfbe2be78f27","year":2024},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.920237Z"},"links":{"cited_paper":"/paper/2410.09031","citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:403ad1ba2dcc61b3fe45a2024d079e8b47e59fe4c8280d2e1cad0ebc4db76852","observation_id":"756faae6-ca15-402c-8cc7-5ac461d954f5","resolution":{"observed_at":"2026-08-08T13:16:45.714994Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2410.09031","last_updated":"2024-10-11T17:48:43Z","snapshot_observed_at":"2026-08-16T13:10:14.027635Z","submitted_at":"2024-10-11T17:48:43Z","title":"Improved List Size for Folded Reed-Solomon Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.09031","snapshot_observed_at":"2026-08-04T00:39:29.337197Z","title":"Improved list size for folded reed-solomon codes,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.05534","last_updated":"2026-07-31T21:41:34Z","snapshot_observed_at":"2026-08-10T18:51:48.892731Z","submitted_at":"2026-01-09T05:20:02Z","title":"BloQBench: A Blockchain Benchmarking Framework for Quantum Supremacy","version":3},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-04T00:39:29.337197Z"},"links":{"cited_paper":"/paper/2410.09031","citing_paper":"/paper/2601.05534"},"observation_digest":"sha256:74c2a56a5be200863d7d5e2c9395e0f3875751625e25d7ef4d9a1c4bf5a4d068","observation_id":"1f187ca4-b3a0-4cd3-ba98-1b2cbcc1d2a7","resolution":{"observed_at":"2026-08-04T00:39:29.337197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.09031","last_updated":"2024-10-11T17:48:43Z","snapshot_observed_at":"2026-08-16T13:10:14.027635Z","submitted_at":"2024-10-11T17:48:43Z","title":"Improved List Size for Folded Reed-Solomon Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.09031","snapshot_observed_at":"2026-08-03T10:38:16.952942Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.10047","last_updated":"2026-06-10T15:41:34Z","snapshot_observed_at":"2026-08-08T08:18:37.096235Z","submitted_at":"2026-01-15T03:53:19Z","title":"Optimal Proximity Gap for Folded Reed--Solomon Codes via Subspace Designs","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-03T10:38:16.952942Z"},"links":{"cited_paper":"/paper/2410.09031","citing_paper":"/paper/2601.10047"},"observation_digest":"sha256:4f61298c4300fcf5c4fefbd9537c6dac7fc555cad80756e19cf86a2af6f0c79e","observation_id":"a8da5037-904c-4858-8790-c3b6defa9056","resolution":{"observed_at":"2026-08-03T10:38:16.952942Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2410.09031/citation-record","integrity":"/paper/2410.09031/integrity","json":"/paper/2410.09031/citation-record.json","paper":"/paper/2410.09031"},"outbound":[],"paper":{"arxiv_id":"2410.09031","last_updated":"2024-10-11T17:48:43Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-16T13:10:14.027635Z","submitted_at":"2024-10-11T17:48:43Z","title":"Improved List Size for Folded Reed-Solomon 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 3 inbound Pith citation observations for arXiv:2410.09031."}