{"as_of":"2026-08-14T09:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7b11a003def671bd97fcdf7ab396a30c6303561afdf6ab15afc5c80d236f712c","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-14T06:32:32.682623+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-11T19:03:03.641859Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-20T16:43:34.753518Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.15880","last_updated":"2024-11-01T02:46:03Z","snapshot_observed_at":"2026-08-12T23:58:29.738146Z","submitted_at":"2024-05-24T18:45:51Z","title":"HYSYNTH: Context-Free LLM Approximation for Guiding Program Synthesis","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.15880","snapshot_observed_at":"2026-08-11T19:03:03.641859Z","title":"arXiv:2405.15880","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.07322","last_updated":"2024-12-11T06:33:55Z","snapshot_observed_at":"2026-08-13T12:06:28.147772Z","submitted_at":"2024-12-10T09:10:11Z","title":"ConceptSearch: Towards Efficient Program Search Using LLMs for Abstraction and Reasoning Corpus (ARC)","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-11T19:03:03.641859Z"},"links":{"cited_paper":"/paper/2405.15880","citing_paper":"/paper/2412.07322"},"observation_digest":"sha256:b51a1fa68dcc0bac5245da0a8346284ff56b073953cd4571f780b34a4e0b065a","observation_id":"f827babd-9b11-40d3-adbd-cd3c582d69f2","resolution":{"observed_at":"2026-08-11T19:03:03.641859Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.15880","last_updated":"2024-11-01T02:46:03Z","snapshot_observed_at":"2026-08-12T23:58:29.738146Z","submitted_at":"2024-05-24T18:45:51Z","title":"HYSYNTH: Context-Free LLM Approximation for Guiding Program Synthesis","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.15880","snapshot_observed_at":"2026-08-10T21:18:59.391031Z","title":"A.; Kasibatla, S","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.05247","last_updated":"2025-01-29T16:52:16Z","snapshot_observed_at":"2026-08-12T00:51:00.187791Z","submitted_at":"2025-01-09T13:57:09Z","title":"Online Prompt Selection for Program Synthesis","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-10T21:18:59.391031Z"},"links":{"cited_paper":"/paper/2405.15880","citing_paper":"/paper/2501.05247"},"observation_digest":"sha256:56ec52c02d81106d39c08e32817cd895fc2fcb1c801d1e366ef774268b2d1745","observation_id":"6cb46320-fea6-4fad-a1c0-e6d099fc5419","resolution":{"observed_at":"2026-08-10T21:18:59.391031Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.15880","last_updated":"2024-11-01T02:46:03Z","snapshot_observed_at":"2026-08-12T23:58:29.738146Z","submitted_at":"2024-05-24T18:45:51Z","title":"HYSYNTH: Context-Free LLM Approximation for Guiding Program Synthesis","version":2},"cited_work":{"arxiv_id":"2405.15880","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.15880","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"HYSYNTH: Context-free LLM approximation for guiding program synthesis.arXiv preprint :2405.15880","venue":null,"work_id":"478573fb-0cbb-413f-95fc-ef4b14e0d3e5","year":2024},"citing_paper":{"arxiv_id":"2605.15865","last_updated":"2026-05-15T11:33:48Z","snapshot_observed_at":"2026-08-14T02:59:36.270098Z","submitted_at":"2026-05-15T11:33:48Z","title":"From Text to DSL: Evaluating Grammar-Based Model Generation Using Open LLMs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-20T16:40:08.788179Z"},"links":{"cited_paper":"/paper/2405.15880","citing_paper":"/paper/2605.15865"},"observation_digest":"sha256:dc4ec28df5e2b9b1b87295bf6b0978b0458e4e3879e3552ba2969b8406cd4ed8","observation_id":"726f872b-cf38-4d71-bf3d-b9025d051d20","resolution":{"observed_at":"2026-05-20T16:43:34.755139Z","resolver_source":"arxiv_id","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"}}],"links":{"evidence":"/evidence","html":"/paper/2405.15880/citation-record","integrity":"/paper/2405.15880/integrity","json":"/paper/2405.15880/citation-record.json","paper":"/paper/2405.15880"},"outbound":[],"paper":{"arxiv_id":"2405.15880","last_updated":"2024-11-01T02:46:03Z","latest_version":2,"primary_category":"cs.PL","snapshot_observed_at":"2026-08-12T23:58:29.738146Z","submitted_at":"2024-05-24T18:45:51Z","title":"HYSYNTH: Context-Free LLM Approximation for Guiding Program Synthesis"},"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-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 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2405.15880."}