{"as_of":"2026-08-15T19:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3f555b0ce1f58485ff4c0e0ed554d8acc7fb3ee0bee779161810d1af18de999d","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-15T06:32:42.880941+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-08-12T10:05:56.403972Z","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-12T10:05:56.584329Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1405.2878","last_updated":"2014-05-12T19:11:03Z","snapshot_observed_at":"2026-08-15T16:32:10.429501Z","submitted_at":"2014-05-12T19:11:03Z","title":"Approximate Policy Iteration Schemes: A Comparison","version":1},"cited_work":{"arxiv_id":"1405.2878","doi":null,"metadata_source":"pith","pith_arxiv_id":"1405.2878","snapshot_observed_at":"2026-08-12T10:05:56.584329Z","title":"Approximate Policy Iteration Schemes: A Comparison","venue":"cs.AI","work_id":"4a6a7691-5697-44ea-98b4-38bb9aa5073b","year":2014},"citing_paper":{"arxiv_id":"2411.19583","last_updated":"2024-11-29T09:56:40Z","snapshot_observed_at":"2026-08-15T14:29:43.978141Z","submitted_at":"2024-11-29T09:56:40Z","title":"Solving Rubik's Cube Without Tricky Sampling","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T10:05:56.403972Z"},"links":{"cited_paper":"/paper/1405.2878","citing_paper":"/paper/2411.19583"},"observation_digest":"sha256:14338d07c8bd55706f368c0224f42b9c392166d49878f729d66fe8334a6d8684","observation_id":"3ddd0cd6-2473-475f-97b8-e5212880ae5f","resolution":{"observed_at":"2026-08-12T10:05:56.593774Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1405.2878/citation-record","integrity":"/paper/1405.2878/integrity","json":"/paper/1405.2878/citation-record.json","paper":"/paper/1405.2878"},"outbound":[],"paper":{"arxiv_id":"1405.2878","last_updated":"2014-05-12T19:11:03Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-15T16:32:10.429501Z","submitted_at":"2014-05-12T19:11:03Z","title":"Approximate Policy Iteration Schemes: A Comparison"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1405.2878."}