{"as_of":"2026-08-09T20:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5c86b57435fcda15f942e79a8b5f61d82f7040f586214eebcd9dfa24ba25496e","coverage":[{"denominator":10,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":10,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-18T01:57:54.508418Z","state":"measured"},{"denominator":10,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":10,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2511.02224/citation-record","integrity":"/paper/2511.02224/integrity","json":"/paper/2511.02224/citation-record.json","paper":"/paper/2511.02224"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On the theory of policy gradient methods: Optimality, approximation, and distribution shift.Journal of Machine Learning Research, 22(98):1–76","venue":null,"work_id":"955bc94c-5571-4612-9435-4eb207b536ef","year":2021},"citing_paper":{"arxiv_id":"2511.02224","last_updated":"2026-05-07T03:38:19Z","snapshot_observed_at":"2026-07-31T22:48:39.114751Z","submitted_at":"2025-11-04T03:34:31Z","title":"Computational Hardness of Static Distributionally Robust Markov Decision Processes","version":5},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-18T01:57:54.508418Z"},"links":{"citing_paper":"/paper/2511.02224"},"observation_digest":"sha256:796f0cc519d45be22f35e46916ea91ae469f4a18d7d5b851ba20a7cc79da51e1","observation_id":"c67b7d1f-3416-44f1-86a8-ea4137672fbb","resolution":{"observed_at":"2026-05-18T02:02:19.592068Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Gabow, Shachindra N Maheshwari, and Leon J","venue":null,"work_id":"65c4a543-7792-4911-b4d7-2af9d3dacfee","year":1976},"citing_paper":{"arxiv_id":"2511.02224","last_updated":"2026-05-07T03:38:19Z","snapshot_observed_at":"2026-07-31T22:48:39.114751Z","submitted_at":"2025-11-04T03:34:31Z","title":"Computational Hardness of Static Distributionally Robust Markov Decision Processes","version":5},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-18T01:57:54.508418Z"},"links":{"citing_paper":"/paper/2511.02224"},"observation_digest":"sha256:019cf03614955289daca680db5bc78fa8eb43469ebc990a811ccecfd666dc740","observation_id":"45800398-90ee-4d19-88fc-2996840484bc","resolution":{"observed_at":"2026-05-18T02:02:19.587139Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"50f897dc-4759-4851-a94b-9898829358b9","year":2005},"citing_paper":{"arxiv_id":"2511.02224","last_updated":"2026-05-07T03:38:19Z","snapshot_observed_at":"2026-07-31T22:48:39.114751Z","submitted_at":"2025-11-04T03:34:31Z","title":"Computational Hardness of Static Distributionally Robust Markov Decision Processes","version":5},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-18T01:57:54.508418Z"},"links":{"citing_paper":"/paper/2511.02224"},"observation_digest":"sha256:201130fef31b9923254656603c9853442ac0a61fd0ae559799407ee65188c0d4","observation_id":"dc19eb62-3992-4d41-9c7d-666696195000","resolution":{"observed_at":"2026-05-18T02:02:19.578294Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"PhD thesis, Massachusetts Institute of Technology","venue":null,"work_id":"18ce4ff1-372e-4418-9da4-2a9f0f96126e","year":2007},"citing_paper":{"arxiv_id":"2511.02224","last_updated":"2026-05-07T03:38:19Z","snapshot_observed_at":"2026-07-31T22:48:39.114751Z","submitted_at":"2025-11-04T03:34:31Z","title":"Computational Hardness of Static Distributionally Robust Markov Decision Processes","version":5},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-18T01:57:54.508418Z"},"links":{"citing_paper":"/paper/2511.02224"},"observation_digest":"sha256:316551c5700925787b5588535c956de10d63fb4b769c6a9f398496883742715d","observation_id":"4b078201-1ad5-4050-bc3c-2818b2317bae","resolution":{"observed_at":"2026-05-18T02:02:19.600638Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.11139","last_updated":"2024-05-05T05:24:09Z","snapshot_observed_at":"2026-08-05T05:16:17.664784Z","submitted_at":"2023-08-22T02:41:15Z","title":"Rectangularity and duality of distributionally robust Markov Decision Processes","version":5},"cited_work":{"arxiv_id":"2308.11139","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2308.11139","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Rectangularity and duality of distributionally robust markov decision processes","venue":null,"work_id":"c1558a81-509a-4100-8d95-8fc661e34546","year":2023},"citing_paper":{"arxiv_id":"2511.02224","last_updated":"2026-05-07T03:38:19Z","snapshot_observed_at":"2026-07-31T22:48:39.114751Z","submitted_at":"2025-11-04T03:34:31Z","title":"Computational Hardness of Static Distributionally Robust Markov Decision Processes","version":5},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-18T01:57:54.508418Z"},"links":{"cited_paper":"/paper/2308.11139","citing_paper":"/paper/2511.02224"},"observation_digest":"sha256:cd869a93dba97cc72f3b0300eaccd538dc92c39cbd4936c0ce4fa7bf7aebf5e0","observation_id":"75707565-9a86-4175-9c14-8bc37364499c","resolution":{"observed_at":"2026-05-18T02:00:39.837719Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Nilim and L","venue":null,"work_id":"fc14cf2a-b3a6-4133-a8c3-e12d1146838c","year":2005},"citing_paper":{"arxiv_id":"2511.02224","last_updated":"2026-05-07T03:38:19Z","snapshot_observed_at":"2026-07-31T22:48:39.114751Z","submitted_at":"2025-11-04T03:34:31Z","title":"Computational Hardness of Static Distributionally Robust Markov Decision Processes","version":5},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-18T01:57:54.508418Z"},"links":{"citing_paper":"/paper/2511.02224"},"observation_digest":"sha256:6e1788f498443046dd1243b114ec807acdea9f364dad8143f6bb0f0f2ea63600","observation_id":"02f48b11-f303-40fb-a666-67791cf36dc0","resolution":{"observed_at":"2026-05-18T02:02:19.565478Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Multi-model markov decision processes","venue":null,"work_id":"589b5a8d-a81e-47c8-b4e8-0eb8ba63ca88","year":2021},"citing_paper":{"arxiv_id":"2511.02224","last_updated":"2026-05-07T03:38:19Z","snapshot_observed_at":"2026-07-31T22:48:39.114751Z","submitted_at":"2025-11-04T03:34:31Z","title":"Computational Hardness of Static Distributionally Robust Markov Decision Processes","version":5},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-18T01:57:54.508418Z"},"links":{"citing_paper":"/paper/2511.02224"},"observation_digest":"sha256:ffa80125c4a1c6eebb907ca26df07a4fb3d95d10fd88e0358db9f110cb8a792b","observation_id":"11e3db98-8d5e-4c2c-b1a3-917ab1229702","resolution":{"observed_at":"2026-05-18T02:02:19.582796Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Le Tallec","venue":null,"work_id":"cb9221a5-0c5c-4eec-80c5-841238efaef0","year":2007},"citing_paper":{"arxiv_id":"2511.02224","last_updated":"2026-05-07T03:38:19Z","snapshot_observed_at":"2026-07-31T22:48:39.114751Z","submitted_at":"2025-11-04T03:34:31Z","title":"Computational Hardness of Static Distributionally Robust Markov Decision Processes","version":5},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-18T01:57:54.508418Z"},"links":{"citing_paper":"/paper/2511.02224"},"observation_digest":"sha256:d4327e54776fbfd2198438fd32c53c2cb1decd96be552b3ccb65d6d54b26c2ef","observation_id":"563ee23d-0ffd-4ba7-8935-ec433b721a0f","resolution":{"observed_at":"2026-05-18T02:02:19.558474Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Mesures dans les espaces produits.Atti Accad","venue":null,"work_id":"e0e1168a-8d05-4fe3-b9f3-1ca2cf7a9bc5","year":1949},"citing_paper":{"arxiv_id":"2511.02224","last_updated":"2026-05-07T03:38:19Z","snapshot_observed_at":"2026-07-31T22:48:39.114751Z","submitted_at":"2025-11-04T03:34:31Z","title":"Computational Hardness of Static Distributionally Robust Markov Decision Processes","version":5},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-18T01:57:54.508418Z"},"links":{"citing_paper":"/paper/2511.02224"},"observation_digest":"sha256:8bc6df82fc5c8284760ec1b62c4aca663b79e41aaeecdddac06ae63c0d0eb5cd","observation_id":"0107e184-0d78-4f7c-8db4-740721cdac06","resolution":{"observed_at":"2026-05-18T02:02:19.552882Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Robust markov decision processes.Mathematics of Operations Research, 38(1):153–183","venue":null,"work_id":"edc2aeac-082e-4c0e-9d39-177f5fa0727f","year":2013},"citing_paper":{"arxiv_id":"2511.02224","last_updated":"2026-05-07T03:38:19Z","snapshot_observed_at":"2026-07-31T22:48:39.114751Z","submitted_at":"2025-11-04T03:34:31Z","title":"Computational Hardness of Static Distributionally Robust Markov Decision Processes","version":5},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-18T01:57:54.508418Z"},"links":{"citing_paper":"/paper/2511.02224"},"observation_digest":"sha256:5f6976895f9b90ca462f54c410e1126718226f5bbbef51c4199210d35b8529bf","observation_id":"87ba489c-ba4f-4564-89c0-555b7b32ce41","resolution":{"observed_at":"2026-05-18T02:02:19.572542Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2511.02224","last_updated":"2026-05-07T03:38:19Z","latest_version":5,"primary_category":"math.OC","snapshot_observed_at":"2026-07-31T22:48:39.114751Z","submitted_at":"2025-11-04T03:34:31Z","title":"Computational Hardness of Static Distributionally Robust Markov Decision Processes"},"reference_resolution":{"displayed":10,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":1,"verified_fuzzy":8},"total_outbound_references":10},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 10 of 10 outbound references and 0 inbound Pith citation observations for arXiv:2511.02224."}