{"as_of":"2026-08-08T12:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:41358036ae717b966624b0d88e3a2564158dbf5453acba1d0a0672705291a3b8","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-08T06:32:00.761636+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-06T14:48:48.754244Z","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-21T11:24:08.683311Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.08414","last_updated":"2024-11-02T22:34:31Z","snapshot_observed_at":"2026-08-04T19:50:50.219376Z","submitted_at":"2024-06-12T16:58:41Z","title":"Discovering Preference Optimization Algorithms with and for Large Language Models","version":3},"cited_work":{"arxiv_id":"2406.08414","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.08414","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Discovering preference optimization algorithms with and for large language models","venue":null,"work_id":"87a383e2-4b59-4064-8f21-67d91f366464","year":2024},"citing_paper":{"arxiv_id":"2408.06292","last_updated":"2024-09-01T00:41:18Z","snapshot_observed_at":"2026-07-06T18:59:43.564435Z","submitted_at":"2024-08-12T16:58:11Z","title":"The AI Scientist: Towards Fully Automated Open-Ended Scientific Discovery","version":3},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-05-11T04:42:31.555355Z"},"links":{"cited_paper":"/paper/2406.08414","citing_paper":"/paper/2408.06292"},"observation_digest":"sha256:31fcd21aba4f4292716302d581e938be69235972f4080b3e1961599280c03674","observation_id":"315307f8-2a52-4ac1-852f-630068906003","resolution":{"observed_at":"2026-05-11T04:42:31.886607Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.08414","last_updated":"2024-11-02T22:34:31Z","snapshot_observed_at":"2026-08-04T19:50:50.219376Z","submitted_at":"2024-06-12T16:58:41Z","title":"Discovering Preference Optimization Algorithms with and for Large Language Models","version":3},"cited_work":{"arxiv_id":"2406.08414","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.08414","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Discovering preference optimization algorithms with and for large language models","venue":null,"work_id":"87a383e2-4b59-4064-8f21-67d91f366464","year":2024},"citing_paper":{"arxiv_id":"2408.08435","last_updated":"2025-03-02T05:13:28Z","snapshot_observed_at":"2026-08-06T11:45:45.286982Z","submitted_at":"2024-08-15T21:59:23Z","title":"Automated Design of Agentic Systems","version":2},"reference_index":177,"source":"arxiv_source","source_observed_at":"2026-05-15T08:07:54.611771Z"},"links":{"cited_paper":"/paper/2406.08414","citing_paper":"/paper/2408.08435"},"observation_digest":"sha256:f76829a9b5d8598c5537b3c3e9cd443e568e6a06d3b78a84358001a7074f88dc","observation_id":"8bc7aea1-67f3-444c-9e03-56b778eac5dc","resolution":{"observed_at":"2026-05-15T08:07:54.765503Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.08414","last_updated":"2024-11-02T22:34:31Z","snapshot_observed_at":"2026-08-04T19:50:50.219376Z","submitted_at":"2024-06-12T16:58:41Z","title":"Discovering Preference Optimization Algorithms with and for Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.08414","snapshot_observed_at":"2026-08-06T14:48:48.754244Z","title":"Chan, Jakob Foerster, Mihaela van der Schaar, and Robert Tjarko Lange","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.17668","last_updated":"2025-09-10T12:25:27Z","snapshot_observed_at":"2026-08-07T21:22:20.825272Z","submitted_at":"2025-07-23T16:31:38Z","title":"How Should We Meta-Learn Reinforcement Learning Algorithms?","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:48.754244Z"},"links":{"cited_paper":"/paper/2406.08414","citing_paper":"/paper/2507.17668"},"observation_digest":"sha256:a4575608aa07537c2b5208f0ed9a17d13c15b895feed6ae630122bb5ec6e8501","observation_id":"4d9a5bb5-e31a-4381-89b2-6e54d990ab38","resolution":{"observed_at":"2026-08-06T14:48:48.754244Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.08414","last_updated":"2024-11-02T22:34:31Z","snapshot_observed_at":"2026-08-04T19:50:50.219376Z","submitted_at":"2024-06-12T16:58:41Z","title":"Discovering Preference Optimization Algorithms with and for Large Language Models","version":3},"cited_work":{"arxiv_id":"2406.08414","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.08414","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Discovering preference optimization algorithms with and for large language models","venue":null,"work_id":"87a383e2-4b59-4064-8f21-67d91f366464","year":2024},"citing_paper":{"arxiv_id":"2605.20189","last_updated":"2026-03-23T07:18:02Z","snapshot_observed_at":"2026-08-01T19:18:00.278267Z","submitted_at":"2026-03-23T07:18:02Z","title":"SOLAR: A Self-Optimizing Open-Ended Autonomous Agent for Lifelong Learning and Continual Adaptation","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-21T11:21:30.867480Z"},"links":{"cited_paper":"/paper/2406.08414","citing_paper":"/paper/2605.20189"},"observation_digest":"sha256:6ea244cd718f4b0cf13b22a86668cddf2cf8b6c0c7d9f995ceb929f59ee11faf","observation_id":"1c8a7d4c-4ae7-471a-b259-8c74cef00c56","resolution":{"observed_at":"2026-05-21T11:24:08.684877Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2406.08414/citation-record","integrity":"/paper/2406.08414/integrity","json":"/paper/2406.08414/citation-record.json","paper":"/paper/2406.08414"},"outbound":[],"paper":{"arxiv_id":"2406.08414","last_updated":"2024-11-02T22:34:31Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-04T19:50:50.219376Z","submitted_at":"2024-06-12T16:58:41Z","title":"Discovering Preference Optimization Algorithms with and for Large Language Models"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2406.08414."}