{"as_of":"2026-08-15T09:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d2af2e71b23e128dac0737f5c1acb4a42d04f0cb8ae79bbd515ab857369653ad","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-11T12:40:45.582528Z","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-11T12:40:45.908610Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2110.10351","last_updated":"2021-10-20T02:57:21Z","snapshot_observed_at":"2026-08-13T17:49:38.326340Z","submitted_at":"2021-10-20T02:57:21Z","title":"Faster Algorithm and Sharper Analysis for Constrained Markov Decision Process","version":1},"cited_work":{"arxiv_id":"2110.10351","doi":null,"metadata_source":"pith","pith_arxiv_id":"2110.10351","snapshot_observed_at":"2026-08-11T12:40:45.908610Z","title":"Faster Algorithm and Sharper Analysis for Constrained Markov Decision Process","venue":"math.OC","work_id":"11e1b172-bdfb-4038-aa45-72afcdc420f5","year":2021},"citing_paper":{"arxiv_id":"2412.14002","last_updated":"2024-12-18T16:17:25Z","snapshot_observed_at":"2026-08-14T22:23:08.376654Z","submitted_at":"2024-12-18T16:17:25Z","title":"Operator Splitting for Convex Constrained Markov Decision Processes","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T12:40:45.582528Z"},"links":{"cited_paper":"/paper/2110.10351","citing_paper":"/paper/2412.14002"},"observation_digest":"sha256:5ab54f0f01f4f4c0719d9d247c5cb96d4ad8439a3288bf1baa269eab49350d20","observation_id":"df37e178-a510-4759-9e23-c8ca8325bc49","resolution":{"observed_at":"2026-08-11T12:40:45.912662Z","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/2110.10351/citation-record","integrity":"/paper/2110.10351/integrity","json":"/paper/2110.10351/citation-record.json","paper":"/paper/2110.10351"},"outbound":[],"paper":{"arxiv_id":"2110.10351","last_updated":"2021-10-20T02:57:21Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-13T17:49:38.326340Z","submitted_at":"2021-10-20T02:57:21Z","title":"Faster Algorithm and Sharper Analysis for Constrained Markov Decision Process"},"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:2110.10351."}