{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:GO3CKAXNW4HST5WVGZ6GCQILN6","short_pith_number":"pith:GO3CKAXN","canonical_record":{"source":{"id":"2212.00083","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2022-11-30T19:54:31Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"fda578125ddbed7ba008ee9aca31aa4ed4f01e016f5d8f5ec85ed0252d912199","abstract_canon_sha256":"a44d085bc102a3fce774fc23edb3b42ea7802c026ffc5d37efec5d8dda09794e"},"schema_version":"1.0"},"canonical_sha256":"33b62502edb70f29f6d5367c61410b6f8b7334d4949bbbc8262ac488c816970e","source":{"kind":"arxiv","id":"2212.00083","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.00083","created_at":"2026-07-05T05:21:30Z"},{"alias_kind":"arxiv_version","alias_value":"2212.00083v1","created_at":"2026-07-05T05:21:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.00083","created_at":"2026-07-05T05:21:30Z"},{"alias_kind":"pith_short_12","alias_value":"GO3CKAXNW4HS","created_at":"2026-07-05T05:21:30Z"},{"alias_kind":"pith_short_16","alias_value":"GO3CKAXNW4HST5WV","created_at":"2026-07-05T05:21:30Z"},{"alias_kind":"pith_short_8","alias_value":"GO3CKAXN","created_at":"2026-07-05T05:21:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:GO3CKAXNW4HST5WVGZ6GCQILN6","target":"record","payload":{"canonical_record":{"source":{"id":"2212.00083","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2022-11-30T19:54:31Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"fda578125ddbed7ba008ee9aca31aa4ed4f01e016f5d8f5ec85ed0252d912199","abstract_canon_sha256":"a44d085bc102a3fce774fc23edb3b42ea7802c026ffc5d37efec5d8dda09794e"},"schema_version":"1.0"},"canonical_sha256":"33b62502edb70f29f6d5367c61410b6f8b7334d4949bbbc8262ac488c816970e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:21:30.482932Z","signature_b64":"oOWyagh9mHUdvavOCbTo9aY7fDYsLYbdDafjmlLXX5uAyMff5tymM0hCchyp/y3FVKdn9R7IDC+nzZ299WvhAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33b62502edb70f29f6d5367c61410b6f8b7334d4949bbbc8262ac488c816970e","last_reissued_at":"2026-07-05T05:21:30.482590Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:21:30.482590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2212.00083","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:21:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/BsR2KPdyfMUcTR0ERkmY9elD2V0458Tm7+U/7RyJZZ6cXtw3XHEX29dgaHZEQZfheQqed2wZMZAT0AkPJF6CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T10:35:53.819592Z"},"content_sha256":"f44ef1b5043820f25c543320a0a527204e49d01b2175b25b906132955dce2571","schema_version":"1.0","event_id":"sha256:f44ef1b5043820f25c543320a0a527204e49d01b2175b25b906132955dce2571"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:GO3CKAXNW4HST5WVGZ6GCQILN6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Smoothed Complexity of Policy Iteration for Markov Decision Processes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.CC","authors_text":"Mihalis Yannakakis, Miranda Christ","submitted_at":"2022-11-30T19:54:31Z","abstract_excerpt":"We show subexponential lower bounds (i.e., $2^{\\Omega (n^c)}$) on the smoothed complexity of the classical Howard's Policy Iteration algorithm for Markov Decision Processes. The bounds hold for the total reward and the average reward criteria. The constructions are robust in the sense that the subexponential bound holds not only on the average for independent random perturbations of the MDP parameters (transition probabilities and rewards), but for all arbitrary perturbations within an inverse polynomial range. We show also an exponential lower bound on the worst-case complexity for the simple"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.00083","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2212.00083/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:21:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1N6tfijrJSGUJ2OHHGEb0bxSLh1qTz+NRAls/MnC2hcXi9gwrQcgQJUuBs2V+HDAgt5scPGVFZLxZNsa0j1/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T10:35:53.820172Z"},"content_sha256":"a7757adc1e2ef94623dfbf328ef9e8b255f4f6adbd8513a92987e79a64cd084e","schema_version":"1.0","event_id":"sha256:a7757adc1e2ef94623dfbf328ef9e8b255f4f6adbd8513a92987e79a64cd084e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GO3CKAXNW4HST5WVGZ6GCQILN6/bundle.json","state_url":"https://pith.science/pith/GO3CKAXNW4HST5WVGZ6GCQILN6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GO3CKAXNW4HST5WVGZ6GCQILN6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-15T10:35:53Z","links":{"resolver":"https://pith.science/pith/GO3CKAXNW4HST5WVGZ6GCQILN6","bundle":"https://pith.science/pith/GO3CKAXNW4HST5WVGZ6GCQILN6/bundle.json","state":"https://pith.science/pith/GO3CKAXNW4HST5WVGZ6GCQILN6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GO3CKAXNW4HST5WVGZ6GCQILN6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:GO3CKAXNW4HST5WVGZ6GCQILN6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a44d085bc102a3fce774fc23edb3b42ea7802c026ffc5d37efec5d8dda09794e","cross_cats_sorted":["cs.GT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2022-11-30T19:54:31Z","title_canon_sha256":"fda578125ddbed7ba008ee9aca31aa4ed4f01e016f5d8f5ec85ed0252d912199"},"schema_version":"1.0","source":{"id":"2212.00083","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.00083","created_at":"2026-07-05T05:21:30Z"},{"alias_kind":"arxiv_version","alias_value":"2212.00083v1","created_at":"2026-07-05T05:21:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.00083","created_at":"2026-07-05T05:21:30Z"},{"alias_kind":"pith_short_12","alias_value":"GO3CKAXNW4HS","created_at":"2026-07-05T05:21:30Z"},{"alias_kind":"pith_short_16","alias_value":"GO3CKAXNW4HST5WV","created_at":"2026-07-05T05:21:30Z"},{"alias_kind":"pith_short_8","alias_value":"GO3CKAXN","created_at":"2026-07-05T05:21:30Z"}],"graph_snapshots":[{"event_id":"sha256:a7757adc1e2ef94623dfbf328ef9e8b255f4f6adbd8513a92987e79a64cd084e","target":"graph","created_at":"2026-07-05T05:21:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2212.00083/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We show subexponential lower bounds (i.e., $2^{\\Omega (n^c)}$) on the smoothed complexity of the classical Howard's Policy Iteration algorithm for Markov Decision Processes. The bounds hold for the total reward and the average reward criteria. The constructions are robust in the sense that the subexponential bound holds not only on the average for independent random perturbations of the MDP parameters (transition probabilities and rewards), but for all arbitrary perturbations within an inverse polynomial range. We show also an exponential lower bound on the worst-case complexity for the simple","authors_text":"Mihalis Yannakakis, Miranda Christ","cross_cats":["cs.GT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2022-11-30T19:54:31Z","title":"The Smoothed Complexity of Policy Iteration for Markov Decision Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.00083","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f44ef1b5043820f25c543320a0a527204e49d01b2175b25b906132955dce2571","target":"record","created_at":"2026-07-05T05:21:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a44d085bc102a3fce774fc23edb3b42ea7802c026ffc5d37efec5d8dda09794e","cross_cats_sorted":["cs.GT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2022-11-30T19:54:31Z","title_canon_sha256":"fda578125ddbed7ba008ee9aca31aa4ed4f01e016f5d8f5ec85ed0252d912199"},"schema_version":"1.0","source":{"id":"2212.00083","kind":"arxiv","version":1}},"canonical_sha256":"33b62502edb70f29f6d5367c61410b6f8b7334d4949bbbc8262ac488c816970e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33b62502edb70f29f6d5367c61410b6f8b7334d4949bbbc8262ac488c816970e","first_computed_at":"2026-07-05T05:21:30.482590Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:21:30.482590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oOWyagh9mHUdvavOCbTo9aY7fDYsLYbdDafjmlLXX5uAyMff5tymM0hCchyp/y3FVKdn9R7IDC+nzZ299WvhAA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:21:30.482932Z","signed_message":"canonical_sha256_bytes"},"source_id":"2212.00083","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f44ef1b5043820f25c543320a0a527204e49d01b2175b25b906132955dce2571","sha256:a7757adc1e2ef94623dfbf328ef9e8b255f4f6adbd8513a92987e79a64cd084e"],"state_sha256":"662688ce60107c93f4f288fc4fdea6e78b193b6410cd5a7d150dd5b5ff471564"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"efQovACAZm1HvW588BNui2gex0J59gRodDyNXDpz2YfWhNqMAyExuvuhE17Ewz5u0HqjEq55TSKQMD/iM2XjAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T10:35:53.823953Z","bundle_sha256":"0af12dddb92727fad0f107474fbcce00b3ef4fd62b355a73b71a67115133d540"}}