{"as_of":"2026-08-12T13:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:84b5cabdf439fee2cefac642ae65338efb802d4299bc63e5b49ce7468ca151e1","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"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-11T12:51:25.387383Z","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-11T12:51:26.961508Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.05864","last_updated":"2024-04-08T20:54:14Z","snapshot_observed_at":"2026-07-06T17:57:27.510162Z","submitted_at":"2024-04-08T20:54:14Z","title":"Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles","version":1},"cited_work":{"arxiv_id":"2404.05864","doi":null,"metadata_source":"pith","pith_arxiv_id":"2404.05864","snapshot_observed_at":"2026-08-11T12:51:26.961508Z","title":"Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles","venue":"cs.IT","work_id":"24efca72-a55d-41cb-8b64-17fff6ae8276","year":2024},"citing_paper":{"arxiv_id":"2412.13945","last_updated":"2024-12-18T15:27:53Z","snapshot_observed_at":"2026-08-12T05:15:46.781267Z","submitted_at":"2024-12-18T15:27:53Z","title":"Restricted subgraphs of edge-colored graphs and applications","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T12:51:25.387383Z"},"links":{"cited_paper":"/paper/2404.05864","citing_paper":"/paper/2412.13945"},"observation_digest":"sha256:3de849d3d120709c4fce9e49cfae08621fd8c334cad40580f3571e029f0c1e32","observation_id":"c0147a20-6be7-4017-ac6f-8f9fe7fac67d","resolution":{"observed_at":"2026-08-11T12:51:26.968721Z","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/2404.05864/citation-record","integrity":"/paper/2404.05864/integrity","json":"/paper/2404.05864/citation-record.json","paper":"/paper/2404.05864"},"outbound":[],"paper":{"arxiv_id":"2404.05864","last_updated":"2024-04-08T20:54:14Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-07-06T17:57:27.510162Z","submitted_at":"2024-04-08T20:54:14Z","title":"Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles"},"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-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 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2404.05864."}