{"as_of":"2026-08-22T04:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:27e6d3c7f939067cbf2044339ae1220b91c1e548a650f557ec56914ca4fa6a9f","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-21T07:54:56.356555Z","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-21T07:59:50.905820Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2311.12244","last_updated":"2024-06-11T03:51:28Z","snapshot_observed_at":"2026-08-20T13:54:35.740681Z","submitted_at":"2023-11-20T23:56:58Z","title":"Provable Representation with Efficient Planning for Partial Observable Reinforcement Learning","version":3},"cited_work":{"arxiv_id":"2311.12244","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2311.12244","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Zhang, T","venue":null,"work_id":"3b8fb0b3-c9f0-42a9-b3d1-dc3d27199a04","year":null},"citing_paper":{"arxiv_id":"2605.20408","last_updated":"2026-05-19T19:04:47Z","snapshot_observed_at":"2026-07-06T23:30:58.549353Z","submitted_at":"2026-05-19T19:04:47Z","title":"Spectral Souping: A Unified Framework for Online Preference Alignment","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-21T07:54:56.356555Z"},"links":{"cited_paper":"/paper/2311.12244","citing_paper":"/paper/2605.20408"},"observation_digest":"sha256:ade85bfc41a7318527dd4464e4d58cf944e1e00d7ad7c1acad233c2d5a1c08af","observation_id":"b6c8bf1b-053d-4636-83d5-5af7772a9bf3","resolution":{"observed_at":"2026-05-21T07:59:50.908100Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2311.12244/citation-record","integrity":"/paper/2311.12244/integrity","json":"/paper/2311.12244/citation-record.json","paper":"/paper/2311.12244"},"outbound":[],"paper":{"arxiv_id":"2311.12244","last_updated":"2024-06-11T03:51:28Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-20T13:54:35.740681Z","submitted_at":"2023-11-20T23:56:58Z","title":"Provable Representation with Efficient Planning for Partial Observable Reinforcement Learning"},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2311.12244."}