{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:LCMZXK7IHKOQJLZ74EWLUDBPLS","short_pith_number":"pith:LCMZXK7I","canonical_record":{"source":{"id":"2601.23229","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-01-30T17:57:07Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"460f38f32c96f9f0550c9a4c6842470e5f1686bca08bee696e1c91b5887844d3","abstract_canon_sha256":"1ddaca6675b4532c26f098bb15918ed732dae813e352599706ada1bf4a7ae612"},"schema_version":"1.0"},"canonical_sha256":"58999babe83a9d04af3fe12cba0c2f5c88bf441e53576837c2a06d71b233bb31","source":{"kind":"arxiv","id":"2601.23229","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.23229","created_at":"2026-06-03T01:05:48Z"},{"alias_kind":"arxiv_version","alias_value":"2601.23229v2","created_at":"2026-06-03T01:05:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.23229","created_at":"2026-06-03T01:05:48Z"},{"alias_kind":"pith_short_12","alias_value":"LCMZXK7IHKOQ","created_at":"2026-06-03T01:05:48Z"},{"alias_kind":"pith_short_16","alias_value":"LCMZXK7IHKOQJLZ7","created_at":"2026-06-03T01:05:48Z"},{"alias_kind":"pith_short_8","alias_value":"LCMZXK7I","created_at":"2026-06-03T01:05:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:LCMZXK7IHKOQJLZ74EWLUDBPLS","target":"record","payload":{"canonical_record":{"source":{"id":"2601.23229","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-01-30T17:57:07Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"460f38f32c96f9f0550c9a4c6842470e5f1686bca08bee696e1c91b5887844d3","abstract_canon_sha256":"1ddaca6675b4532c26f098bb15918ed732dae813e352599706ada1bf4a7ae612"},"schema_version":"1.0"},"canonical_sha256":"58999babe83a9d04af3fe12cba0c2f5c88bf441e53576837c2a06d71b233bb31","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T01:05:48.297015Z","signature_b64":"C0jbhMiNFJL/W9MPsoR5n+vavhcaMlt96oXxbz6DR3tO5RRJkwK8huwQJgX6dRMaibf/YkaYzGwYtXLz8lPZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58999babe83a9d04af3fe12cba0c2f5c88bf441e53576837c2a06d71b233bb31","last_reissued_at":"2026-06-03T01:05:48.296532Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T01:05:48.296532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2601.23229","source_version":2,"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-06-03T01:05:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"92YVVfaVoC1yfCyfVm039GbBKJ9ohfQ6N+qmY/6x2J+rUS0HfXseV9FliRuQ0LgWbrm5m9ReHNzyDY0CuzpbBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T12:37:11.190165Z"},"content_sha256":"d77866f561aeddaec23e536953c6c8c9c18c987b2062d8f6fc8640c9ea71639f","schema_version":"1.0","event_id":"sha256:d77866f561aeddaec23e536953c6c8c9c18c987b2062d8f6fc8640c9ea71639f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:LCMZXK7IHKOQJLZ74EWLUDBPLS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strongly Polynomial Time Complexity of Policy Iteration for $L_\\infty$ Robust MDPs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.AI","authors_text":"Ali Asadi, Alipasha Montaseri, Carlo Pagano, Ehsan Goharshady, Krishnendu Chatterjee, Mehrdad Karrabi","submitted_at":"2026-01-30T17:57:07Z","abstract_excerpt":"Markov decision processes (MDPs) are a fundamental model in sequential decision making. Robust MDPs (RMDPs) extend this framework by allowing uncertainty in transition probabilities and optimizing against the worst-case realization of that uncertainty. In particular, $(s, a)$-rectangular RMDPs with $L_\\infty$ uncertainty sets form a fundamental and expressive model: they subsume classical MDPs and turn-based stochastic games. We consider this model with discounted payoffs. The existence of polynomial and strongly-polynomial time algorithms is a fundamental problem for these optimization models"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.23229","kind":"arxiv","version":2},"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/2601.23229/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-06-03T01:05:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JJ85XlpN67id2hD7Rl9lb43KStGJcGkt8aP/8rd3XP3aZ9np8Um6YQMYzmrT+K8s06f3sXmw7LQl+CHX7Kb1Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T12:37:11.190564Z"},"content_sha256":"e0fe58cdb3cb774545207c2b1738bb180c63b6401898f0bf9151eb9b5aef5e50","schema_version":"1.0","event_id":"sha256:e0fe58cdb3cb774545207c2b1738bb180c63b6401898f0bf9151eb9b5aef5e50"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LCMZXK7IHKOQJLZ74EWLUDBPLS/bundle.json","state_url":"https://pith.science/pith/LCMZXK7IHKOQJLZ74EWLUDBPLS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LCMZXK7IHKOQJLZ74EWLUDBPLS/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-06-06T12:37:11Z","links":{"resolver":"https://pith.science/pith/LCMZXK7IHKOQJLZ74EWLUDBPLS","bundle":"https://pith.science/pith/LCMZXK7IHKOQJLZ74EWLUDBPLS/bundle.json","state":"https://pith.science/pith/LCMZXK7IHKOQJLZ74EWLUDBPLS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LCMZXK7IHKOQJLZ74EWLUDBPLS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LCMZXK7IHKOQJLZ74EWLUDBPLS","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":"1ddaca6675b4532c26f098bb15918ed732dae813e352599706ada1bf4a7ae612","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-01-30T17:57:07Z","title_canon_sha256":"460f38f32c96f9f0550c9a4c6842470e5f1686bca08bee696e1c91b5887844d3"},"schema_version":"1.0","source":{"id":"2601.23229","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.23229","created_at":"2026-06-03T01:05:48Z"},{"alias_kind":"arxiv_version","alias_value":"2601.23229v2","created_at":"2026-06-03T01:05:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.23229","created_at":"2026-06-03T01:05:48Z"},{"alias_kind":"pith_short_12","alias_value":"LCMZXK7IHKOQ","created_at":"2026-06-03T01:05:48Z"},{"alias_kind":"pith_short_16","alias_value":"LCMZXK7IHKOQJLZ7","created_at":"2026-06-03T01:05:48Z"},{"alias_kind":"pith_short_8","alias_value":"LCMZXK7I","created_at":"2026-06-03T01:05:48Z"}],"graph_snapshots":[{"event_id":"sha256:e0fe58cdb3cb774545207c2b1738bb180c63b6401898f0bf9151eb9b5aef5e50","target":"graph","created_at":"2026-06-03T01:05:48Z","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/2601.23229/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Markov decision processes (MDPs) are a fundamental model in sequential decision making. Robust MDPs (RMDPs) extend this framework by allowing uncertainty in transition probabilities and optimizing against the worst-case realization of that uncertainty. In particular, $(s, a)$-rectangular RMDPs with $L_\\infty$ uncertainty sets form a fundamental and expressive model: they subsume classical MDPs and turn-based stochastic games. We consider this model with discounted payoffs. The existence of polynomial and strongly-polynomial time algorithms is a fundamental problem for these optimization models","authors_text":"Ali Asadi, Alipasha Montaseri, Carlo Pagano, Ehsan Goharshady, Krishnendu Chatterjee, Mehrdad Karrabi","cross_cats":["cs.CC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-01-30T17:57:07Z","title":"Strongly Polynomial Time Complexity of Policy Iteration for $L_\\infty$ Robust MDPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.23229","kind":"arxiv","version":2},"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:d77866f561aeddaec23e536953c6c8c9c18c987b2062d8f6fc8640c9ea71639f","target":"record","created_at":"2026-06-03T01:05:48Z","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":"1ddaca6675b4532c26f098bb15918ed732dae813e352599706ada1bf4a7ae612","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-01-30T17:57:07Z","title_canon_sha256":"460f38f32c96f9f0550c9a4c6842470e5f1686bca08bee696e1c91b5887844d3"},"schema_version":"1.0","source":{"id":"2601.23229","kind":"arxiv","version":2}},"canonical_sha256":"58999babe83a9d04af3fe12cba0c2f5c88bf441e53576837c2a06d71b233bb31","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58999babe83a9d04af3fe12cba0c2f5c88bf441e53576837c2a06d71b233bb31","first_computed_at":"2026-06-03T01:05:48.296532Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T01:05:48.296532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C0jbhMiNFJL/W9MPsoR5n+vavhcaMlt96oXxbz6DR3tO5RRJkwK8huwQJgX6dRMaibf/YkaYzGwYtXLz8lPZDw==","signature_status":"signed_v1","signed_at":"2026-06-03T01:05:48.297015Z","signed_message":"canonical_sha256_bytes"},"source_id":"2601.23229","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d77866f561aeddaec23e536953c6c8c9c18c987b2062d8f6fc8640c9ea71639f","sha256:e0fe58cdb3cb774545207c2b1738bb180c63b6401898f0bf9151eb9b5aef5e50"],"state_sha256":"0648bfcb70ff89ab6ad2e0fa2a07746d23df1161982afc85035614e6f0d6777e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1wNxjzuIIMwVn6sqJsKIZVqadAIF9vJS9z3+8iDHCgHGxpWxBLpgk/fSXQBW6UStmWkL/cTr74Ud72Yib9cvDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T12:37:11.194124Z","bundle_sha256":"7c1ce97a8430961d996a235459039187359e4e4413fbb467af7eed6aa1f50836"}}