{"as_of":"2026-08-13T03:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:631009d043ee05bc0a809698c8cf940f14edeab3804d4bd9eedb11185b4ad622","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-12T06:34:41.77262+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-12T19:40:08.383714Z","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-24T13:44:32.203914Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2011.00632","last_updated":"2021-03-22T20:09:33Z","snapshot_observed_at":"2026-08-10T04:39:13.520660Z","submitted_at":"2020-11-01T21:42:57Z","title":"Synthesis of Discounted-Reward Optimal Policies for Markov Decision Processes Under Linear Temporal Logic Specifications","version":2},"cited_work":{"arxiv_id":"2011.00632","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2011.00632","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"b4b36af6-58f9-4dc2-aea8-1dc2765232a5","year":2011},"citing_paper":{"arxiv_id":"2103.14600","last_updated":"2021-09-26T22:57:53Z","snapshot_observed_at":"2026-07-06T10:53:47.743165Z","submitted_at":"2021-03-26T17:05:12Z","title":"Model-Free Learning of Safe yet Effective Controllers","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-24T13:41:02.752499Z"},"links":{"cited_paper":"/paper/2011.00632","citing_paper":"/paper/2103.14600"},"observation_digest":"sha256:a86c7dc043bcc42ac35fd681ec2b491b2626f502bfff70033942c952d7f0a01b","observation_id":"93baba9c-59ce-4753-beea-dcd55f0b7623","resolution":{"observed_at":"2026-05-24T13:44:32.206867Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2011.00632","last_updated":"2021-03-22T20:09:33Z","snapshot_observed_at":"2026-08-10T04:39:13.520660Z","submitted_at":"2020-11-01T21:42:57Z","title":"Synthesis of Discounted-Reward Optimal Policies for Markov Decision Processes Under Linear Temporal Logic Specifications","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.00632","snapshot_observed_at":"2026-08-12T19:40:08.383714Z","title":"arXiv preprint arXiv:2011.00632 (2020)","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.10558","last_updated":"2024-11-15T20:10:25Z","snapshot_observed_at":"2026-08-12T19:32:00.293887Z","submitted_at":"2024-11-15T20:10:25Z","title":"Multi-agent Path Finding for Timed Tasks using Evolutionary Games","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T19:40:08.383714Z"},"links":{"cited_paper":"/paper/2011.00632","citing_paper":"/paper/2411.10558"},"observation_digest":"sha256:9b6f984e514b00a30e076a507e781aa27f82ab594f8235de211c141b0ac1e7a8","observation_id":"20aad714-b85b-4e93-9fd9-a45c95ff5441","resolution":{"observed_at":"2026-08-12T19:40:08.383714Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2011.00632/citation-record","integrity":"/paper/2011.00632/integrity","json":"/paper/2011.00632/citation-record.json","paper":"/paper/2011.00632"},"outbound":[],"paper":{"arxiv_id":"2011.00632","last_updated":"2021-03-22T20:09:33Z","latest_version":2,"primary_category":"eess.SY","snapshot_observed_at":"2026-08-10T04:39:13.520660Z","submitted_at":"2020-11-01T21:42:57Z","title":"Synthesis of Discounted-Reward Optimal Policies for Markov Decision Processes Under Linear Temporal Logic Specifications"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2011.00632."}