{"as_of":"2026-08-05T04:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9285525b96b4cd02385890360a01ac2f3f2018e12ce4fbdf5401f27c23114a58","coverage":[{"denominator":6,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T06:26:55.057225Z","state":"measured"},{"denominator":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"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-11T02:07:49.641275Z","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-11T03:55:56.296671Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2601.23229","last_updated":"2026-06-02T12:28:36Z","snapshot_observed_at":"2026-08-03T06:17:50.328428Z","submitted_at":"2026-01-30T17:57:07Z","title":"Strongly Polynomial Time Complexity of Policy Iteration for $L_\\infty$ Robust MDPs","version":2},"cited_work":{"arxiv_id":"2601.23229","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2601.23229","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2601.23229 , year=","venue":null,"work_id":"84d36e57-a278-4197-8694-107bf47e2232","year":null},"citing_paper":{"arxiv_id":"2605.07459","last_updated":"2026-05-08T09:06:02Z","snapshot_observed_at":"2026-08-02T12:51:55.067692Z","submitted_at":"2026-05-08T09:06:02Z","title":"On the Complexity of Discounted Robust MDPs with $L_p$ Uncertainty Sets","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-05-11T02:07:49.641275Z"},"links":{"cited_paper":"/paper/2601.23229","citing_paper":"/paper/2605.07459"},"observation_digest":"sha256:25e7697adb92590611fe835f2ef9acdd80a1b9b3cceefd1e98b7577f31027fa7","observation_id":"ce453ce3-a564-41e3-abe9-4513595706ed","resolution":{"observed_at":"2026-06-03T02:05:45.252219Z","resolver_source":"arxiv_id","status":"verified_exact"},"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/2601.23229/citation-record","integrity":"/paper/2601.23229/integrity","json":"/paper/2601.23229/citation-record.json","paper":"/paper/2601.23229"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T06:26:54.374625Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.23229","last_updated":"2026-06-02T12:28:36Z","snapshot_observed_at":"2026-08-03T06:17:50.328428Z","submitted_at":"2026-01-30T17:57:07Z","title":"Strongly Polynomial Time Complexity of Policy Iteration for $L_\\infty$ Robust MDPs","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:54.374625Z"},"links":{"citing_paper":"/paper/2601.23229"},"observation_digest":"sha256:b7899250e7a7448fec4b9bbd9b50f3a52caa25f9775673e0c05b739f07175542","observation_id":"00381c1f-19b3-46a4-8cbd-920de6a2b090","resolution":{"observed_at":"2026-08-03T06:26:54.374625Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T06:26:54.447784Z","title":"C 1-linearly independent","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2601.23229","last_updated":"2026-06-02T12:28:36Z","snapshot_observed_at":"2026-08-03T06:17:50.328428Z","submitted_at":"2026-01-30T17:57:07Z","title":"Strongly Polynomial Time Complexity of Policy Iteration for $L_\\infty$ Robust MDPs","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:54.447784Z"},"links":{"citing_paper":"/paper/2601.23229"},"observation_digest":"sha256:f73966b873c62079316a3944ef9a1b55ec822b3213866d2479378a5c6291ae6a","observation_id":"014d5b43-c17b-4ca5-b20c-86ea0e124d5b","resolution":{"observed_at":"2026-08-03T06:26:54.447784Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T06:26:54.600213Z","title":"linear independence","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2601.23229","last_updated":"2026-06-02T12:28:36Z","snapshot_observed_at":"2026-08-03T06:17:50.328428Z","submitted_at":"2026-01-30T17:57:07Z","title":"Strongly Polynomial Time Complexity of Policy Iteration for $L_\\infty$ Robust MDPs","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:54.600213Z"},"links":{"citing_paper":"/paper/2601.23229"},"observation_digest":"sha256:7cbc5bf23edea7ad343cecc964ab5bed83d090eab8a314834698ea820649d52c","observation_id":"f45c8089-ba30-4b72-8bfe-694657d2f471","resolution":{"observed_at":"2026-08-03T06:26:54.600213Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T06:26:54.738551Z","title":"Given the properties of such policies, discussed in Section 3, we defineX s as follows so thatP ρ s,s′ ∈A(X s)for alls, s′ ∈ S: Xs ={ ˆPs,s′ |s ′ ∈ S} ∪ {δ(s),1}","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.23229","last_updated":"2026-06-02T12:28:36Z","snapshot_observed_at":"2026-08-03T06:17:50.328428Z","submitted_at":"2026-01-30T17:57:07Z","title":"Strongly Polynomial Time Complexity of Policy Iteration for $L_\\infty$ Robust MDPs","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:54.738551Z"},"links":{"citing_paper":"/paper/2601.23229"},"observation_digest":"sha256:d2a2bc95ec58716e0834453148dc284804738092c746b5a2906c050d14e8e94d","observation_id":"f470692a-b3fe-4e84-be4d-ac7804c31750","resolution":{"observed_at":"2026-08-03T06:26:54.738551Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T06:26:54.890470Z","title":"Let(s t, s′ t, s′′ t ) = argmaxs,s′,s′′ fρt(s, s′, s′′)be the maximizing triple","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.23229","last_updated":"2026-06-02T12:28:36Z","snapshot_observed_at":"2026-08-03T06:17:50.328428Z","submitted_at":"2026-01-30T17:57:07Z","title":"Strongly Polynomial Time Complexity of Policy Iteration for $L_\\infty$ Robust MDPs","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:54.890470Z"},"links":{"citing_paper":"/paper/2601.23229"},"observation_digest":"sha256:343022d8013c4a20a460005979d305fcb7f084700f0bcc0f79def290419c050d","observation_id":"bc193b56-4bd2-4ed1-a29a-dc7746c45a7c","resolution":{"observed_at":"2026-08-03T06:26:54.890470Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T06:26:55.057225Z","title":"For any specific triple, the mass transfer value can take at mostO(nlogn)different logarithmic scales (from Step 1) before it vanishes or the triple is no longer active","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.23229","last_updated":"2026-06-02T12:28:36Z","snapshot_observed_at":"2026-08-03T06:17:50.328428Z","submitted_at":"2026-01-30T17:57:07Z","title":"Strongly Polynomial Time Complexity of Policy Iteration for $L_\\infty$ Robust MDPs","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:55.057225Z"},"links":{"citing_paper":"/paper/2601.23229"},"observation_digest":"sha256:c88b1069e2529bee3ab275f9c9e61f94120e437d574ae4c9def38eeec4f4bfe3","observation_id":"c641d5f0-6ed2-40cb-a7b2-8c9f12a23310","resolution":{"observed_at":"2026-08-03T06:26:55.057225Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2601.23229","last_updated":"2026-06-02T12:28:36Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-03T06:17:50.328428Z","submitted_at":"2026-01-30T17:57:07Z","title":"Strongly Polynomial Time Complexity of Policy Iteration for $L_\\infty$ Robust MDPs"},"reference_resolution":{"displayed":6,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":6},"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 6 of 6 outbound references and 1 inbound Pith citation observation for arXiv:2601.23229."}