{"as_of":"2026-08-16T01:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8d75c5d6ce5b002526d2c581607b852e8b3ea2e36b15feab1a7876bd7155aeb4","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":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T21:23:23.736451Z","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-06-30T14:04:44.664938Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.17503","last_updated":"2024-10-29T20:01:16Z","snapshot_observed_at":"2026-08-12T23:57:55.983591Z","submitted_at":"2024-05-26T04:00:30Z","title":"Code Repair with LLMs gives an Exploration-Exploitation Tradeoff","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.17503","snapshot_observed_at":"2026-08-12T10:24:29.850961Z","title":"Code Repair with LLMs gives an Exploration-Exploitation Tradeoff,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.19275","last_updated":"2025-04-07T07:29:42Z","snapshot_observed_at":"2026-08-12T17:33:35.329857Z","submitted_at":"2024-11-28T17:12:21Z","title":"VeCoGen: Automating Generation of Formally Verified C Code with Large Language Models","version":3},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-12T10:24:29.850961Z"},"links":{"cited_paper":"/paper/2405.17503","citing_paper":"/paper/2411.19275"},"observation_digest":"sha256:79b48e8e491ee1e47ef092ea2808aba543dd61e18f4a1223d881450fbd150b8e","observation_id":"a790e6a5-1160-47dd-ae15-890790c53ff9","resolution":{"observed_at":"2026-08-12T10:24:29.850961Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.17503","last_updated":"2024-10-29T20:01:16Z","snapshot_observed_at":"2026-08-12T23:57:55.983591Z","submitted_at":"2024-05-26T04:00:30Z","title":"Code Repair with LLMs gives an Exploration-Exploitation Tradeoff","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.17503","snapshot_observed_at":"2026-08-11T13:11:34.783076Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.13422","last_updated":"2025-02-08T23:39:32Z","snapshot_observed_at":"2026-08-14T02:14:03.027513Z","submitted_at":"2024-12-18T01:38:09Z","title":"Generating Diverse Hypotheses for Inductive Reasoning","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-11T13:11:34.783076Z"},"links":{"cited_paper":"/paper/2405.17503","citing_paper":"/paper/2412.13422"},"observation_digest":"sha256:4e41cac15832e0e529e7ff634b2897e48e637db74d3912c77b851ab8d91c181e","observation_id":"73ccace6-ed37-4699-a4f9-67e1a18088a9","resolution":{"observed_at":"2026-08-11T13:11:34.783076Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.17503","last_updated":"2024-10-29T20:01:16Z","snapshot_observed_at":"2026-08-12T23:57:55.983591Z","submitted_at":"2024-05-26T04:00:30Z","title":"Code Repair with LLMs gives an Exploration-Exploitation Tradeoff","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.17503","snapshot_observed_at":"2026-08-15T21:23:23.736451Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.10008","last_updated":"2025-05-28T08:37:29Z","snapshot_observed_at":"2026-08-15T21:16:47.858746Z","submitted_at":"2025-05-15T06:43:32Z","title":"SVA-ICL: Improving LLM-based Software Vulnerability Assessment via In-Context Learning and Information Fusion","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T21:23:23.736451Z"},"links":{"cited_paper":"/paper/2405.17503","citing_paper":"/paper/2505.10008"},"observation_digest":"sha256:20a8d58decdab98b59dabcc636303eaa261afabce23400c42f544ba0c3f16450","observation_id":"78ec2ef1-6465-4d9e-bd80-47bf93ed9e18","resolution":{"observed_at":"2026-08-15T21:23:23.736451Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.17503","last_updated":"2024-10-29T20:01:16Z","snapshot_observed_at":"2026-08-12T23:57:55.983591Z","submitted_at":"2024-05-26T04:00:30Z","title":"Code Repair with LLMs gives an Exploration-Exploitation Tradeoff","version":3},"cited_work":{"arxiv_id":"2405.17503","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.17503","snapshot_observed_at":"2026-06-30T14:04:44.664938Z","title":null,"venue":null,"work_id":"85606de0-b7a5-4199-87e2-95be3e9d96cb","year":2024},"citing_paper":{"arxiv_id":"2602.08561","last_updated":"2026-04-23T07:57:30Z","snapshot_observed_at":"2026-08-15T23:06:02.085337Z","submitted_at":"2026-02-09T11:59:59Z","title":"Automating Computational Reproducibility in Social Science: Comparing Prompt-Based and Agent-Based Approaches","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-16T05:55:48.203213Z"},"links":{"cited_paper":"/paper/2405.17503","citing_paper":"/paper/2602.08561"},"observation_digest":"sha256:570dc3d59382723369e3b48e36cc31542c9d0039c22efa77f48395c0c6fd76bf","observation_id":"c9dd8760-edf9-457e-9b1f-40ff50795d03","resolution":{"observed_at":"2026-05-16T05:57:24.438717Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.17503","last_updated":"2024-10-29T20:01:16Z","snapshot_observed_at":"2026-08-12T23:57:55.983591Z","submitted_at":"2024-05-26T04:00:30Z","title":"Code Repair with LLMs gives an Exploration-Exploitation Tradeoff","version":3},"cited_work":{"arxiv_id":"2405.17503","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.17503","snapshot_observed_at":"2026-06-30T14:04:44.664938Z","title":null,"venue":null,"work_id":"85606de0-b7a5-4199-87e2-95be3e9d96cb","year":2024},"citing_paper":{"arxiv_id":"2605.24375","last_updated":"2026-05-23T03:30:36Z","snapshot_observed_at":"2026-08-04T17:22:32.357745Z","submitted_at":"2026-05-23T03:30:36Z","title":"Distilling Game Code World Model Generation into Lightweight Large Language Models","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-30T13:58:37.956333Z"},"links":{"cited_paper":"/paper/2405.17503","citing_paper":"/paper/2605.24375"},"observation_digest":"sha256:9ff0635269ef2a18ab0a1b63ba0401b1e50bd8f8efd18b98a75c97f84cf21f0f","observation_id":"c524263d-085b-47ed-9aa2-5d523e762c78","resolution":{"observed_at":"2026-06-30T14:04:44.666926Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.17503","last_updated":"2024-10-29T20:01:16Z","snapshot_observed_at":"2026-08-12T23:57:55.983591Z","submitted_at":"2024-05-26T04:00:30Z","title":"Code Repair with LLMs gives an Exploration-Exploitation Tradeoff","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.17503","snapshot_observed_at":"2026-08-01T03:05:32.216635Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.25236","last_updated":"2026-07-28T03:23:47Z","snapshot_observed_at":"2026-08-07T21:03:50.260810Z","submitted_at":"2026-07-28T03:23:47Z","title":"VisualPatchWorld: Code World Models as Latent Structured Representations for Planning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T03:05:32.216635Z"},"links":{"cited_paper":"/paper/2405.17503","citing_paper":"/paper/2607.25236"},"observation_digest":"sha256:5876a11a210c229a70cdb6c1ab3ec55f4552f6ea29c9f20f43f3ab0c1a8fd7ca","observation_id":"446b2999-7743-4f1c-923d-f64b7768df7f","resolution":{"observed_at":"2026-08-01T03:05:32.216635Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.17503","last_updated":"2024-10-29T20:01:16Z","snapshot_observed_at":"2026-08-12T23:57:55.983591Z","submitted_at":"2024-05-26T04:00:30Z","title":"Code Repair with LLMs gives an Exploration-Exploitation Tradeoff","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.17503","snapshot_observed_at":"2026-08-14T11:46:31.476860Z","title":"doi:10.52202/079017-3746","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.13404","last_updated":"2026-08-13T16:01:32Z","snapshot_observed_at":"2026-08-16T01:12:18.528944Z","submitted_at":"2026-08-13T16:01:32Z","title":"Does Fixing Break Security? An Empirical Study of Security Degradation in Iterative LLM-Driven Infrastructure-as-Code Repair","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T11:46:31.476860Z"},"links":{"cited_paper":"/paper/2405.17503","citing_paper":"/paper/2608.13404"},"observation_digest":"sha256:3b74d888afe13b23e8b75d7ac255fe25d299a444d0365127252b67d786024e8c","observation_id":"40cd8c9a-d0b9-463f-83a7-ee754227646b","resolution":{"observed_at":"2026-08-14T11:46:31.476860Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2405.17503/citation-record","integrity":"/paper/2405.17503/integrity","json":"/paper/2405.17503/citation-record.json","paper":"/paper/2405.17503"},"outbound":[],"paper":{"arxiv_id":"2405.17503","last_updated":"2024-10-29T20:01:16Z","latest_version":3,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-12T23:57:55.983591Z","submitted_at":"2024-05-26T04:00:30Z","title":"Code Repair with LLMs gives an Exploration-Exploitation Tradeoff"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2405.17503."}