Pith. sign in

Paper Citation Record · LEDGER

Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes

As of 21 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 0 inbound Pith citation observations for arXiv:2506.12254.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2506.12254 v1

Coverage vector

measured 29 of 29 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-07T01:08:15.442926Z

measured 29 of 29 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-20T06:33:59.587034+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

29 of 29 outbound references displayed

  • verified exact0
  • verified fuzzy27
  • unresolved2
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation a909d4b6-4d29-412e-b81f-8a0ebadd0367 · outbound

This paper cites Principles of Cyber-Physical Systems.

Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes Principles of Cyber-Physical Systems

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T01:08:20.438957Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-07T01:08:12.887735Z digest=sha256:8fb513d8846bbe8b4ba10300fc598b2235cc520475b030f779ae9890275efe82

Observation 80841168-a9d5-4b90-88f6-dedc8f46d6b8 · outbound

This paper cites Deterministic MDPs with adversarial rewards and bandit feedback.

Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes Deterministic MDPs with adversarial rewards and bandit feedback

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T01:08:20.267798Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-07T01:08:12.934906Z digest=sha256:961462522cd253d5ad5c240505fde859d8e433634a26525e22e39d4718305cf3

Observation 33448e61-4835-495d-a8cc-31ba8961eedc · outbound

This paper cites Deterministic sub-exponential algorithm for discounted-sum games with unary weights.

Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes Deterministic sub-exponential algorithm for discounted-sum games with unary weights

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T01:08:20.067686Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-07T01:08:13.033505Z digest=sha256:3793130fd12011786f3e902cf0979bf271141a478eb0a530abbc8ebd9df755b8

Observation 5cd8af25-fbef-498c-9ead-b5adf4a86936 · outbound

This paper cites Principles of model checking.

Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes Principles of model checking

Reference 4

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T01:08:19.832173Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-07T01:08:13.109106Z digest=sha256:6ea27960043742f62bfd68c86279e7123676e14ea53ffb02c076b9cf9c851f17

Observation 3d9331a0-ac10-4859-87fe-14019fe03a47 · outbound

This paper cites Discrete dynamic programming.

Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes Discrete dynamic programming

Reference 5

Resolution
unresolved
no resolver link, observed 2026-08-07T01:08:13.182469Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T01:08:13.182469Z digest=sha256:f0ce7111e2b5c24fc114d421a6e04edd755568063705ad005a3b4bf40af26ba8

Observation a69b7078-51ea-4703-a9e3-1d2613e1457b · outbound

This paper cites A survey of computational complexity results in systems and control.

Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes A survey of computational complexity results in systems and control

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T01:08:19.650974Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-07T01:08:13.283196Z digest=sha256:9507815e75093614852bfd664c4e8977f94e9a2ac999c1d6533f2f1313f7e12e

Observation 7d55a36f-4fbe-436f-a63c-29bab80bd9fc · outbound

This paper cites Identification of blackwell optimal policies for deterministic MDPs.

Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes Identification of blackwell optimal policies for deterministic MDPs

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T01:08:19.418613Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-07T01:08:13.389464Z digest=sha256:6afeb5876459a870c97383be402d9ed8f04b035d5a0e404b0462f91a341b3e23

Observation 8a21fd78-120c-438d-aba4-25afe17861d6 · outbound

This paper cites Scalable methods for computing state similarity in deterministic Markov Decision Processes.

Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes Scalable methods for computing state similarity in deterministic Markov Decision Processes

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T01:08:19.227443Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-07T01:08:13.479595Z digest=sha256:1655cbc1a98e2426c353432be989620889b790eec00c112a711fde2f3b2ace82

Observation 6527c5f6-4abb-4637-90ad-4a43e158fc79 · outbound

This paper cites The smoothed complexity of policy iteration for markov decision processes.

Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes The smoothed complexity of policy iteration for markov decision processes

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T01:08:18.927040Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-07T01:08:13.607800Z digest=sha256:1949cdc85d1eabc10e1bb5194ca547b30a4cad59e898ebe8a3bc5287d7ecf44f

Observation 73e5f3fd-0295-4ae1-b494-8f49e34925ec · outbound

This paper cites Introduction to algorithms.

Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes Introduction to algorithms

Reference 10

Resolution
unresolved
no resolver link, observed 2026-08-07T01:08:13.702655Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T01:08:13.702655Z digest=sha256:0c71391d2b12da4f0a5be616cddd66f99ab163d34534f77a7ab73d1720d091eb

Observation 479fab95-df33-4bd0-8e06-f887a5ac8603 · outbound

This paper cites Experimental analysis of the fastest optimum cycle ratio and mean algorithms.

Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes Experimental analysis of the fastest optimum cycle ratio and mean algorithms

Reference 11

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T01:08:18.705022Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-07T01:08:13.824818Z digest=sha256:e7fcc285c3fa9963445aa7303d8acf2b4a6422b223f603c4df44642e0f745284

Observation cea85deb-dee4-43d6-8db3-adfc0b80748e · outbound

This paper cites Finite state Markovian decision processes.

Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes Finite state Markovian decision processes

Reference 12

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T01:08:18.470429Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-07T01:08:13.893521Z digest=sha256:ddc58dcfdaea2ebc14370a379e54c724c91808bdcd59ba1c76890e6eea286866

Observation 032591be-9938-4e14-80d6-6dd26ec8505c · outbound

This paper cites Exponential lower bounds for policy iteration.

Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes Exponential lower bounds for policy iteration

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T01:08:18.254749Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-07T01:08:13.988633Z digest=sha256:0bd5ec2c91e876e15e5ed27f940d3511a80c0a9742d081d07e29437e5ee53f7a

Observation ca7cf355-4fda-471d-a4ce-ce08f7da4a65 · outbound

This paper cites Competitive Markov decision processes.

Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes Competitive Markov decision processes

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T01:08:18.031233Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-07T01:08:14.093708Z digest=sha256:562b0d647ca1538fbe56c99e57c81a86dcb01cc414ad5e0b8685f929fef776c9

Observation 3ecdcdc7-addd-4769-9197-1f80bfd0eaf0 · outbound

This paper cites An exponential lower bound for the parity game strategy improvement algorithm as we know it.

Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes An exponential lower bound for the parity game strategy improvement algorithm as we know it

Reference 15

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T01:08:17.758322Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-07T01:08:14.194600Z digest=sha256:6fb79cbb3292939a3b915c06478e386ea59be74d1856c8d954c99c4eb6fdd8e7

Observation 7e077a51-09f3-4b60-8a24-5091a4b2ee18 · outbound

This paper cites Subexponential lower bounds for randomized pivoting rules for the simplex algorithm.

Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes Subexponential lower bounds for randomized pivoting rules for the simplex algorithm

Reference 16

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T01:08:17.562172Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-07T01:08:14.292726Z digest=sha256:39930444d5e9cfedd704828000030438b49456852b7e113b2ca0e17a219a15dc

Observation 0fe4df56-06ff-443c-8ce2-66fe203dc961 · outbound

This paper cites Worst-case analysis of strategy iteration and the simplex method.

Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes Worst-case analysis of strategy iteration and the simplex method

Reference 17

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T01:08:17.348126Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-07T01:08:14.383527Z digest=sha256:59c0a3bf653e1aa600f83871254f04cbc16564872eb6fde5fb3da8e4c9f5e949

Observation 2ca3955d-2207-4c70-a00f-925322c50eb1 · outbound

This paper cites Lower bounds for howard’s algorithm for finding minimum mean-cost cycles.

Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes Lower bounds for howard’s algorithm for finding minimum mean-cost cycles

Reference 18

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T01:08:17.162237Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-07T01:08:14.475082Z digest=sha256:b6ebad164b1447627f9996750881648dfad91026ce11078c238028fb561ffc8e

Observation e18e38e6-e1a5-491e-a04c-1f9e7af55d28 · outbound

This paper cites Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor.

Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor

Reference 19

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T01:08:17.003208Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-07T01:08:14.548290Z digest=sha256:3c1cbc6c8b06a4f737426dc889ad603a1dd824e70bba44748a4d49e00f202115

Observation 0ca81bb4-5db3-468e-a2e0-b35ee076ab34 · outbound

This paper cites Dynamic programming and markov processes.

Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes Dynamic programming and markov processes

Reference 20

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T01:08:16.853424Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-07T01:08:14.667480Z digest=sha256:236162b6cfde59796f6583ad28216ce9e0c19e7e6c464f75574d24f904810112

Observation b68f9bb0-a0c6-436c-9528-16e101a6aa77 · outbound

This paper cites A characterization of the minimum cycle mean in a digraph.

Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes A characterization of the minimum cycle mean in a digraph

Reference 21

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T01:08:16.666236Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-07T01:08:14.740905Z digest=sha256:3944743a1ff1ccd98d7722965009117d805853eca2ed168019d18aff05cb7559

Observation 175306b4-b660-417f-a9fd-ad7f8a8b6332 · outbound

This paper cites Probabilistic propositional planning: Representations and complexity.

Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes Probabilistic propositional planning: Representations and complexity

Reference 22

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T01:08:16.548256Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-07T01:08:14.809826Z digest=sha256:ba91a9467de509df88ed3a3b0a25681845454ba3983b9862d5aa8fa8db27c7f5

Observation cbbd5bbc-52c1-4170-99db-1a2ee06fdd86 · outbound

This paper cites Smoothed analysis of deterministic discounted and mean-payoff games.

Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes Smoothed analysis of deterministic discounted and mean-payoff games

Reference 23

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T01:08:16.434847Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-07T01:08:14.917505Z digest=sha256:ed0913caec6d1b8db58a02d7f7f0f22cfe5cddc6bf2577b677724007bb8c4542

Observation f09c52eb-c0fc-4274-8f99-e260422b6852 · outbound

This paper cites Polynomial value iteration algorithms for deterministic MDPs.

Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes Polynomial value iteration algorithms for deterministic MDPs

Reference 24

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T01:08:16.287088Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-07T01:08:15.011382Z digest=sha256:ccc0fbefcd2190ca105afe59fec99b0f56835fa03d1a0216269a3a04f5d2c329

Observation 76ac8fb4-b34b-4b16-8dc1-648d0a213469 · outbound

This paper cites Discounted deterministic Markov decision processes and discounted all-pairs shortest paths.

Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes Discounted deterministic Markov decision processes and discounted all-pairs shortest paths

Reference 25

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T01:08:16.167673Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-07T01:08:15.108384Z digest=sha256:e6c7fcdf33d00009c77d88b07d7319fad413ed7c08f72a312ee83cb8e3fcf7e0

Observation 929d2d24-221a-4f4a-a572-8e8ea3e50639 · outbound

This paper cites The simplex method is strongly polynomial for deterministic Markov decision processes.

Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes The simplex method is strongly polynomial for deterministic Markov decision processes

Reference 26

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T01:08:16.058305Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-07T01:08:15.195962Z digest=sha256:acea0663b01a09edfc89abf45106370290b4383a5bcc617c8818b24840bbff25

Observation 6a8db39d-9055-4a53-8b4e-8d6f93160ce9 · outbound

This paper cites Puterman.

Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes Puterman

Reference 27

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T01:08:15.952476Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-07T01:08:15.275843Z digest=sha256:0947170bdcbe661b8e72346bc678b36d125b8b32424c308272fb1a6b55c2fd27

Observation c8495a22-ad1d-4fcc-964c-af28f6235569 · outbound

This paper cites Faster parametric shortest path and minimum-balance algorithms.

Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes Faster parametric shortest path and minimum-balance algorithms

Reference 28

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T01:08:15.822844Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-07T01:08:15.373921Z digest=sha256:6d85657d240849e76fc55d374579d1e3236122ba446e4e8cff24b2b140ac3e03

Observation 36b12812-0a1f-42a5-8121-1c6e26ff59e0 · outbound

This paper cites The complexity of mean payoff games on graphs.

Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes The complexity of mean payoff games on graphs

Reference 29

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T01:08:15.642948Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-07T01:08:15.442926Z digest=sha256:5780b9c0c7a9e32903dd64f481929cc1b07dfaee71cef11f9abe6b0870c3a0d1

Pith citing papers

No inbound Pith citation observations are available.