{"as_of":"2026-08-11T20:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7a345593f2547380e94b700a40f1caaee926f539fecce3b85246442bfe862974","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T21:10:19.709985Z","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-08-10T21:10:20.421196Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.03678","last_updated":"2024-06-06T01:46:49Z","snapshot_observed_at":"2026-08-03T18:28:26.518415Z","submitted_at":"2024-06-06T01:46:49Z","title":"Reflective Policy Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.03678","snapshot_observed_at":"2026-08-01T19:47:51.863430Z","title":"arXiv preprint arXiv:2406.03678 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.16873","last_updated":"2026-07-18T16:25:27Z","snapshot_observed_at":"2026-08-08T03:15:21.664094Z","submitted_at":"2026-07-18T16:25:27Z","title":"InfoDense: Density-Aware Regional Decisive Replay for Memory-Efficient Incremental Face Forgery Detection","version":1},"reference_index":259,"source":"arxiv_source","source_observed_at":"2026-08-01T19:47:51.863430Z"},"links":{"cited_paper":"/paper/2406.03678","citing_paper":"/paper/2607.16873"},"observation_digest":"sha256:5e8b19ab084a026860173c1bf57519b0e035b5bca599f503897917c1aee6b731","observation_id":"bf7dc13e-26a8-4ae9-9237-a4ffe1da95c6","resolution":{"observed_at":"2026-08-01T19:47:51.863430Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.03678","last_updated":"2024-06-06T01:46:49Z","snapshot_observed_at":"2026-08-03T18:28:26.518415Z","submitted_at":"2024-06-06T01:46:49Z","title":"Reflective Policy Optimization","version":1},"cited_work":{"arxiv_id":"2406.03678","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.03678","snapshot_observed_at":"2026-08-10T21:10:20.421196Z","title":"Reflective Policy Optimization","venue":"cs.LG","work_id":"d85fcf53-f09b-4974-bf55-a63c301a5798","year":2024},"citing_paper":{"arxiv_id":"2608.06768","last_updated":"2026-08-07T03:41:58Z","snapshot_observed_at":"2026-08-11T20:10:22.107933Z","submitted_at":"2026-08-07T03:41:58Z","title":"Explore or Converge? Stage-Guided Per-Step Optimization for Diffusion Models","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T21:10:19.709985Z"},"links":{"cited_paper":"/paper/2406.03678","citing_paper":"/paper/2608.06768"},"observation_digest":"sha256:ec84260ac1d97cf21de98c54575d01bf1d850007eea43ea328557b861ee8295e","observation_id":"4abcc6a9-1be6-437e-a63a-b91872394fa6","resolution":{"observed_at":"2026-08-10T21:10:20.427087Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2406.03678/citation-record","integrity":"/paper/2406.03678/integrity","json":"/paper/2406.03678/citation-record.json","paper":"/paper/2406.03678"},"outbound":[],"paper":{"arxiv_id":"2406.03678","last_updated":"2024-06-06T01:46:49Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-03T18:28:26.518415Z","submitted_at":"2024-06-06T01:46:49Z","title":"Reflective Policy Optimization"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2406.03678."}