{"as_of":"2026-08-15T17:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d6b6c0e79afaa94fe0df67280510624ba3a17fe8d2e32375e58a5ff01ef29731","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-15T06:32:42.880941+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-12T18:40:09.101468Z","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-11T16:21:30.285956Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2312.13912","last_updated":"2024-04-30T17:05:38Z","snapshot_observed_at":"2026-08-13T04:56:05.363051Z","submitted_at":"2023-12-21T15:00:06Z","title":"Solving Long-run Average Reward Robust MDPs via Stochastic Games","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.13912","snapshot_observed_at":"2026-08-12T18:40:09.101468Z","title":"CoRR abs/2312.13912 (2023)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.11451","last_updated":"2024-12-10T09:59:27Z","snapshot_observed_at":"2026-08-13T15:05:35.263945Z","submitted_at":"2024-11-18T10:34:14Z","title":"Robust Markov Decision Processes: A Place Where AI and Formal Methods Meet","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T18:40:09.101468Z"},"links":{"cited_paper":"/paper/2312.13912","citing_paper":"/paper/2411.11451"},"observation_digest":"sha256:176427030a640761ed8afd0ce5e8161fbaa7fd93c767671819dc56d8b1d2ff8d","observation_id":"abf40e6e-393c-4500-b451-29414b40dcef","resolution":{"observed_at":"2026-08-12T18:40:09.101468Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.13912","last_updated":"2024-04-30T17:05:38Z","snapshot_observed_at":"2026-08-13T04:56:05.363051Z","submitted_at":"2023-12-21T15:00:06Z","title":"Solving Long-run Average Reward Robust MDPs via Stochastic Games","version":2},"cited_work":{"arxiv_id":"2312.13912","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.13912","snapshot_observed_at":"2026-08-11T16:21:30.285956Z","title":"Solving Long-run Average Reward Robust MDPs via Stochastic Games","venue":"cs.AI","work_id":"40c61a5d-5d0d-4009-b812-1335c39bf2dd","year":2023},"citing_paper":{"arxiv_id":"2412.10185","last_updated":"2024-12-13T14:55:48Z","snapshot_observed_at":"2026-08-15T06:45:52.414777Z","submitted_at":"2024-12-13T14:55:48Z","title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-11T16:21:30.057802Z"},"links":{"cited_paper":"/paper/2312.13912","citing_paper":"/paper/2412.10185"},"observation_digest":"sha256:142b7f2c65c7416d880240f55839c9ad6154baea1e670c5b0b2dd979061dc5bd","observation_id":"36c9a7c1-b2b7-4025-85c5-9fa8ded2994c","resolution":{"observed_at":"2026-08-11T16:21:30.289758Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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/2312.13912/citation-record","integrity":"/paper/2312.13912/integrity","json":"/paper/2312.13912/citation-record.json","paper":"/paper/2312.13912"},"outbound":[],"paper":{"arxiv_id":"2312.13912","last_updated":"2024-04-30T17:05:38Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-13T04:56:05.363051Z","submitted_at":"2023-12-21T15:00:06Z","title":"Solving Long-run Average Reward Robust MDPs via Stochastic Games"},"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 2 inbound Pith citation observations for arXiv:2312.13912."}