{"as_of":"2026-08-06T17:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ea33c0c2a5d8c15d785ade47d4b640f71a9250958edee1cc0ed0abd38fa40697","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-06T06:34:29.942622+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-03T23:27:38.492107Z","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-05-15T05:19:45.649723Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.04660","last_updated":"2026-05-11T11:25:22Z","snapshot_observed_at":"2026-07-06T22:08:54.821773Z","submitted_at":"2025-08-06T17:28:31Z","title":"Composing Policy Gradients and Prompt Optimization for Language Model Programs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.04660","snapshot_observed_at":"2026-08-03T23:27:38.492107Z","title":"Multi-module grpo: Composing policy gradients and prompt optimization for language model programs","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.05933","last_updated":"2026-06-24T14:20:52Z","snapshot_observed_at":"2026-08-06T14:58:22.171505Z","submitted_at":"2025-11-08T08:56:29Z","title":"Reinforcement Learning Improves Traversal of Parametric Knowledge in LLMs","version":2},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-03T23:27:38.492107Z"},"links":{"cited_paper":"/paper/2508.04660","citing_paper":"/paper/2511.05933"},"observation_digest":"sha256:9316d314c6a26453bac5df16f74eecf91cfae46f993668daebff954c550ddb22","observation_id":"06c08a80-087b-44d7-b3d9-3dffe953b6bf","resolution":{"observed_at":"2026-08-03T23:27:38.492107Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.04660","last_updated":"2026-05-11T11:25:22Z","snapshot_observed_at":"2026-07-06T22:08:54.821773Z","submitted_at":"2025-08-06T17:28:31Z","title":"Composing Policy Gradients and Prompt Optimization for Language Model Programs","version":2},"cited_work":{"arxiv_id":"2508.04660","doi":null,"metadata_source":"pith","pith_arxiv_id":"2508.04660","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Composing Policy Gradients and Prompt Optimization for Language Model Programs","venue":"cs.CL","work_id":"f503186d-3982-410a-bf3d-a7a73ce1ed55","year":2025},"citing_paper":{"arxiv_id":"2605.12484","last_updated":"2026-05-14T17:49:32Z","snapshot_observed_at":"2026-08-02T06:23:20.104772Z","submitted_at":"2026-05-12T17:58:20Z","title":"Learning, Fast and Slow: Towards LLMs That Adapt Continually","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-05-13T05:00:31.452781Z"},"links":{"cited_paper":"/paper/2508.04660","citing_paper":"/paper/2605.12484"},"observation_digest":"sha256:3a258810a6280c93690228b37b456ac22ed499d598823e4e82286445084fcabb","observation_id":"1e740241-909c-433f-b377-86568cea36a2","resolution":{"observed_at":"2026-05-13T05:07:18.525124Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.04660","last_updated":"2026-05-11T11:25:22Z","snapshot_observed_at":"2026-07-06T22:08:54.821773Z","submitted_at":"2025-08-06T17:28:31Z","title":"Composing Policy Gradients and Prompt Optimization for Language Model Programs","version":2},"cited_work":{"arxiv_id":"2508.04660","doi":null,"metadata_source":"pith","pith_arxiv_id":"2508.04660","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Composing Policy Gradients and Prompt Optimization for Language Model Programs","venue":"cs.CL","work_id":"f503186d-3982-410a-bf3d-a7a73ce1ed55","year":2025},"citing_paper":{"arxiv_id":"2605.12484","last_updated":"2026-05-14T17:49:32Z","snapshot_observed_at":"2026-08-02T06:23:20.104772Z","submitted_at":"2026-05-12T17:58:20Z","title":"Learning, Fast and Slow: Towards LLMs That Adapt Continually","version":2},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-05-15T05:19:05.368681Z"},"links":{"cited_paper":"/paper/2508.04660","citing_paper":"/paper/2605.12484"},"observation_digest":"sha256:d93730421c934ff654985aa53d9eeccb0992bf211dc184ca069cbfb99c7b63ee","observation_id":"9b133ca8-3b8f-4e2a-9286-4e9a87a319a5","resolution":{"observed_at":"2026-05-15T05:19:45.652980Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.04660","last_updated":"2026-05-11T11:25:22Z","snapshot_observed_at":"2026-07-06T22:08:54.821773Z","submitted_at":"2025-08-06T17:28:31Z","title":"Composing Policy Gradients and Prompt Optimization for Language Model Programs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.04660","snapshot_observed_at":"2026-08-01T09:43:58.250297Z","title":"arXiv preprint arXiv:2508.04660 , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20668","last_updated":"2026-07-22T19:08:19Z","snapshot_observed_at":"2026-08-02T11:40:51.571368Z","submitted_at":"2026-07-22T19:08:19Z","title":"From Agent Failures to Text Policies: What Works and What Breaks","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-01T09:43:58.250297Z"},"links":{"cited_paper":"/paper/2508.04660","citing_paper":"/paper/2607.20668"},"observation_digest":"sha256:3b6e66870e8f3aec2ae5eadbd9a7e7f8cef8e56a139fdf7ffab9dddd9a941b24","observation_id":"1bb7ea02-4660-41cf-bac3-dcbf028a1f63","resolution":{"observed_at":"2026-08-01T09:43:58.250297Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2508.04660/citation-record","integrity":"/paper/2508.04660/integrity","json":"/paper/2508.04660/citation-record.json","paper":"/paper/2508.04660"},"outbound":[],"paper":{"arxiv_id":"2508.04660","last_updated":"2026-05-11T11:25:22Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T22:08:54.821773Z","submitted_at":"2025-08-06T17:28:31Z","title":"Composing Policy Gradients and Prompt Optimization for Language Model Programs"},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2508.04660."}