{"as_of":"2026-08-09T09:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:000a2764c69d612279aca44ebda6873661e5b991c9aed353f84e658f530d8f52","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:39:56.669431Z","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-11T03:25:58.233163Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.05010","last_updated":"2025-02-25T03:17:46Z","snapshot_observed_at":"2026-07-06T19:46:54.707852Z","submitted_at":"2024-10-22T01:58:29Z","title":"Scattered Forest Search: Smarter Code Space Exploration with LLMs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.05010","snapshot_observed_at":"2026-08-07T12:39:56.669431Z","title":"11 Jiawei Liu and Lingming Zhang","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.24098","last_updated":"2025-05-30T01:00:34Z","snapshot_observed_at":"2026-08-08T22:31:37.525251Z","submitted_at":"2025-05-30T01:00:34Z","title":"HardTests: Synthesizing High-Quality Test Cases for LLM Coding","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T12:39:56.669431Z"},"links":{"cited_paper":"/paper/2411.05010","citing_paper":"/paper/2505.24098"},"observation_digest":"sha256:4b09f87d2ad092eb3185f89d92758c1a24af52c246d890c846da0f7d82fe0827","observation_id":"6bf60f56-81a0-44af-8315-8fc8bfe65d73","resolution":{"observed_at":"2026-08-07T12:39:56.669431Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.05010","last_updated":"2025-02-25T03:17:46Z","snapshot_observed_at":"2026-07-06T19:46:54.707852Z","submitted_at":"2024-10-22T01:58:29Z","title":"Scattered Forest Search: Smarter Code Space Exploration with LLMs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.05010","snapshot_observed_at":"2026-08-05T22:09:46.374893Z","title":"Scattered forest search: S marter code space exploration with LLM s","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.374893Z"},"links":{"cited_paper":"/paper/2411.05010","citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:32f28958d51c5713ed739487cc9fd163dd7131c491f7751559ed52e0b1dbd410","observation_id":"128fcbf7-3888-40bf-bb96-8ca28f1c4ab4","resolution":{"observed_at":"2026-08-05T22:09:46.374893Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.05010","last_updated":"2025-02-25T03:17:46Z","snapshot_observed_at":"2026-07-06T19:46:54.707852Z","submitted_at":"2024-10-22T01:58:29Z","title":"Scattered Forest Search: Smarter Code Space Exploration with LLMs","version":2},"cited_work":{"arxiv_id":"2411.05010","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.05010","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Scattered forest search: Smarter code space exploration with LLMs","venue":null,"work_id":"860c1bbc-3e62-4c88-9140-682820cb6230","year":null},"citing_paper":{"arxiv_id":"2604.16625","last_updated":"2026-04-17T18:25:03Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T18:25:03Z","title":"AdaExplore: Failure-Driven Adaptation and Diversity-Preserving Search for Efficient Kernel Generation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-10T08:27:56.130579Z"},"links":{"cited_paper":"/paper/2411.05010","citing_paper":"/paper/2604.16625"},"observation_digest":"sha256:15e455b0cc176f7917e131bbceca8638614ea609f8f6c49b98879cb66b49fa9d","observation_id":"17563ff9-532a-4b0f-b5b1-883609d76b69","resolution":{"observed_at":"2026-05-10T09:08:25.966414Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.05010","last_updated":"2025-02-25T03:17:46Z","snapshot_observed_at":"2026-07-06T19:46:54.707852Z","submitted_at":"2024-10-22T01:58:29Z","title":"Scattered Forest Search: Smarter Code Space Exploration with LLMs","version":2},"cited_work":{"arxiv_id":"2411.05010","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.05010","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Scattered forest search: Smarter code space exploration with LLMs","venue":null,"work_id":"860c1bbc-3e62-4c88-9140-682820cb6230","year":null},"citing_paper":{"arxiv_id":"2605.08057","last_updated":"2026-05-08T17:44:15Z","snapshot_observed_at":"2026-07-31T05:49:37.295093Z","submitted_at":"2026-05-08T17:44:15Z","title":"CA-SQL: Complexity-Aware Inference Time Reasoning for Text-to-SQL via Exploration and Compute Budget Allocation","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-05-11T02:28:20.366674Z"},"links":{"cited_paper":"/paper/2411.05010","citing_paper":"/paper/2605.08057"},"observation_digest":"sha256:9c6bef6c3baafcb3f780ab65a9b70b6dfe073dca58ed6e79eadd011a870fa666","observation_id":"23084147-741a-4283-bb0a-aab043a6b57a","resolution":{"observed_at":"2026-05-11T03:25:58.251342Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2411.05010/citation-record","integrity":"/paper/2411.05010/integrity","json":"/paper/2411.05010/citation-record.json","paper":"/paper/2411.05010"},"outbound":[],"paper":{"arxiv_id":"2411.05010","last_updated":"2025-02-25T03:17:46Z","latest_version":2,"primary_category":"cs.SE","snapshot_observed_at":"2026-07-06T19:46:54.707852Z","submitted_at":"2024-10-22T01:58:29Z","title":"Scattered Forest Search: Smarter Code Space Exploration with LLMs"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2411.05010."}