{"as_of":"2026-08-05T02:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:48ace4e47dcf34c820b006aac77884627aff7dd41621d7a25c1946f1c96357ac","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-04T06:34:03.388597+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-24T19:02:58.877167Z","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-05-24T19:04:50.180690Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1904.01503","last_updated":"2019-04-02T15:46:19Z","snapshot_observed_at":"2026-07-06T07:43:22.332996Z","submitted_at":"2019-04-02T15:46:19Z","title":"On the Complexity of Reachability in Parametric Markov Decision Processes","version":1},"cited_work":{"arxiv_id":"1904.01503","doi":null,"metadata_source":"pith","pith_arxiv_id":"1904.01503","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On the Complexity of Reachability in Parametric Markov Decision Processes","venue":"cs.LO","work_id":"22e4d0e0-38c4-4dad-a488-990d9eccdf61","year":2019},"citing_paper":{"arxiv_id":"1907.08491","last_updated":"2019-07-19T12:52:39Z","snapshot_observed_at":"2026-08-01T21:54:34.393720Z","submitted_at":"2019-07-19T12:52:39Z","title":"Are Parametric Markov Chains Monotonic?","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-24T19:02:58.877167Z"},"links":{"cited_paper":"/paper/1904.01503","citing_paper":"/paper/1907.08491"},"observation_digest":"sha256:de7d07433ea6b6fe15334c9242c4532e24c1537b30a193d32ea8735020c43892","observation_id":"a8e65292-9aaf-4e5a-aa65-b7905c3cbddd","resolution":{"observed_at":"2026-05-24T19:04:50.184479Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1904.01503/citation-record","integrity":"/paper/1904.01503/integrity","json":"/paper/1904.01503/citation-record.json","paper":"/paper/1904.01503"},"outbound":[],"paper":{"arxiv_id":"1904.01503","last_updated":"2019-04-02T15:46:19Z","latest_version":1,"primary_category":"cs.LO","snapshot_observed_at":"2026-07-06T07:43:22.332996Z","submitted_at":"2019-04-02T15:46:19Z","title":"On the Complexity of Reachability in Parametric Markov Decision Processes"},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1904.01503."}