{"as_of":"2026-08-18T15:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b2c026cc4890a8315b32146557338ac202dfac2a7065be3561243882b775874f","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-18T06:34:40.430872+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-07T14:10:39.079775Z","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-07T13:45:06.303229Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.06571","last_updated":"2024-06-04T20:12:47Z","snapshot_observed_at":"2026-08-17T11:26:52.652432Z","submitted_at":"2024-03-11T10:14:06Z","title":"Scalable Online Exploration via Coverability","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.06571","snapshot_observed_at":"2026-08-07T14:10:39.079775Z","title":"Scalable online exploration via coverability","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20268","last_updated":"2025-07-24T14:21:12Z","snapshot_observed_at":"2026-08-17T11:27:40.773999Z","submitted_at":"2025-05-26T17:44:08Z","title":"Outcome-Based Online Reinforcement Learning: Algorithms and Fundamental Limits","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T14:10:39.079775Z"},"links":{"cited_paper":"/paper/2403.06571","citing_paper":"/paper/2505.20268"},"observation_digest":"sha256:9c52ce61cc27e05b522e46f38001eb83f0a1b5baa86d248577fec4c41eaf16b0","observation_id":"bcc4957d-113f-4c6f-a3d1-ef258ad29e0b","resolution":{"observed_at":"2026-08-07T14:10:39.079775Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.06571","last_updated":"2024-06-04T20:12:47Z","snapshot_observed_at":"2026-08-17T11:26:52.652432Z","submitted_at":"2024-03-11T10:14:06Z","title":"Scalable Online Exploration via Coverability","version":2},"cited_work":{"arxiv_id":"2403.06571","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.06571","snapshot_observed_at":"2026-08-07T13:45:06.303229Z","title":"Scalable Online Exploration via Coverability","venue":"cs.LG","work_id":"075e72ec-83b6-4230-b90a-935012f24ce5","year":2024},"citing_paper":{"arxiv_id":"2505.21395","last_updated":"2025-05-27T16:23:24Z","snapshot_observed_at":"2026-08-07T13:26:21.678395Z","submitted_at":"2025-05-27T16:23:24Z","title":"Square$\\chi$PO: Differentially Private and Robust $\\chi^2$-Preference Optimization in Offline Direct Alignment","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T13:44:54.982699Z"},"links":{"cited_paper":"/paper/2403.06571","citing_paper":"/paper/2505.21395"},"observation_digest":"sha256:e2d950ca20fdede99937154956b3caafd7322f5bc9102390c287e1ec2215d899","observation_id":"0e61b7ea-ceac-44e3-a682-6d065032228d","resolution":{"observed_at":"2026-08-07T13:45:06.394885Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2403.06571/citation-record","integrity":"/paper/2403.06571/integrity","json":"/paper/2403.06571/citation-record.json","paper":"/paper/2403.06571"},"outbound":[],"paper":{"arxiv_id":"2403.06571","last_updated":"2024-06-04T20:12:47Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-17T11:26:52.652432Z","submitted_at":"2024-03-11T10:14:06Z","title":"Scalable Online Exploration via Coverability"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2403.06571."}