{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:IDSHSATBRCBDFVOXDZHKDM3K2G","short_pith_number":"pith:IDSHSATB","canonical_record":{"source":{"id":"2210.14459","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-10-26T04:11:08Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"98bc30017eb88764de9d5b74611d5e70f2f60a0f66a33239ea106371dddfab37","abstract_canon_sha256":"056b6177c79e50639ee2219d326303af1f5027cb771d87aea2677e5705bc98b8"},"schema_version":"1.0"},"canonical_sha256":"40e4790261888232d5d71e4ea1b36ad19f7c9277515bd7fbc356c2965728b1e0","source":{"kind":"arxiv","id":"2210.14459","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.14459","created_at":"2026-07-05T05:10:45Z"},{"alias_kind":"arxiv_version","alias_value":"2210.14459v1","created_at":"2026-07-05T05:10:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.14459","created_at":"2026-07-05T05:10:45Z"},{"alias_kind":"pith_short_12","alias_value":"IDSHSATBRCBD","created_at":"2026-07-05T05:10:45Z"},{"alias_kind":"pith_short_16","alias_value":"IDSHSATBRCBDFVOX","created_at":"2026-07-05T05:10:45Z"},{"alias_kind":"pith_short_8","alias_value":"IDSHSATB","created_at":"2026-07-05T05:10:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:IDSHSATBRCBDFVOXDZHKDM3K2G","target":"record","payload":{"canonical_record":{"source":{"id":"2210.14459","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-10-26T04:11:08Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"98bc30017eb88764de9d5b74611d5e70f2f60a0f66a33239ea106371dddfab37","abstract_canon_sha256":"056b6177c79e50639ee2219d326303af1f5027cb771d87aea2677e5705bc98b8"},"schema_version":"1.0"},"canonical_sha256":"40e4790261888232d5d71e4ea1b36ad19f7c9277515bd7fbc356c2965728b1e0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:10:45.378372Z","signature_b64":"+u8qeLans9iStnNnhraCDP2n1nlmJXG8upEgKs/RPJ5CxRElXNmlvkiUrOvfgdkBcezg+jzS9hTnrHIcrvvUAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40e4790261888232d5d71e4ea1b36ad19f7c9277515bd7fbc356c2965728b1e0","last_reissued_at":"2026-07-05T05:10:45.378016Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:10:45.378016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2210.14459","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:10:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s0V/J/XCS7Zx00TlbQZvEgha4uMZ70VU+kn+va4Qg/LE/PurvKm74VT2rWCIalC/XkqIrOmuyAPNWtQJNNxHCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T05:34:46.266793Z"},"content_sha256":"e421fcb1a8eab0727087123657d4829efa059227feaa7897fe69392123a9df07","schema_version":"1.0","event_id":"sha256:e421fcb1a8eab0727087123657d4829efa059227feaa7897fe69392123a9df07"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:IDSHSATBRCBDFVOXDZHKDM3K2G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Policy iteration: for want of recursive feasibility, all is not lost","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Dragan Nesic, Mathieu Granzotto, Olivier Lindamulage De Silva, Romain Postoyan, Zhong-Ping Jiang","submitted_at":"2022-10-26T04:11:08Z","abstract_excerpt":"This paper investigates recursive feasibility, recursive robust stability and near-optimality properties of policy iteration (PI). For this purpose, we consider deterministic nonlinear discrete-time systems whose inputs are generated by PI for undiscounted cost functions. We first assume that PI is recursively feasible, in the sense that the optimization problems solved at each iteration admit a solution. In this case, we provide novel conditions to establish recursive robust stability properties for a general attractor, meaning that the policies generated at each iteration ensure a robust \\KL"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.14459","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/2210.14459/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:10:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jeIgT1AxdCC84iI2IPU4WodmX+t+n8GHTp7RzfHoQlDAQzCjK991SsO8D41udeib7Ls+QnRPR9ZSKUga5kGwBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T05:34:46.267178Z"},"content_sha256":"9bff752bca1b386b496a4b0ccc7a00e936099eff423e528cabdac899d5f570d4","schema_version":"1.0","event_id":"sha256:9bff752bca1b386b496a4b0ccc7a00e936099eff423e528cabdac899d5f570d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IDSHSATBRCBDFVOXDZHKDM3K2G/bundle.json","state_url":"https://pith.science/pith/IDSHSATBRCBDFVOXDZHKDM3K2G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IDSHSATBRCBDFVOXDZHKDM3K2G/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-19T05:34:46Z","links":{"resolver":"https://pith.science/pith/IDSHSATBRCBDFVOXDZHKDM3K2G","bundle":"https://pith.science/pith/IDSHSATBRCBDFVOXDZHKDM3K2G/bundle.json","state":"https://pith.science/pith/IDSHSATBRCBDFVOXDZHKDM3K2G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IDSHSATBRCBDFVOXDZHKDM3K2G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:IDSHSATBRCBDFVOXDZHKDM3K2G","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":"056b6177c79e50639ee2219d326303af1f5027cb771d87aea2677e5705bc98b8","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-10-26T04:11:08Z","title_canon_sha256":"98bc30017eb88764de9d5b74611d5e70f2f60a0f66a33239ea106371dddfab37"},"schema_version":"1.0","source":{"id":"2210.14459","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.14459","created_at":"2026-07-05T05:10:45Z"},{"alias_kind":"arxiv_version","alias_value":"2210.14459v1","created_at":"2026-07-05T05:10:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.14459","created_at":"2026-07-05T05:10:45Z"},{"alias_kind":"pith_short_12","alias_value":"IDSHSATBRCBD","created_at":"2026-07-05T05:10:45Z"},{"alias_kind":"pith_short_16","alias_value":"IDSHSATBRCBDFVOX","created_at":"2026-07-05T05:10:45Z"},{"alias_kind":"pith_short_8","alias_value":"IDSHSATB","created_at":"2026-07-05T05:10:45Z"}],"graph_snapshots":[{"event_id":"sha256:9bff752bca1b386b496a4b0ccc7a00e936099eff423e528cabdac899d5f570d4","target":"graph","created_at":"2026-07-05T05:10:45Z","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/2210.14459/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper investigates recursive feasibility, recursive robust stability and near-optimality properties of policy iteration (PI). For this purpose, we consider deterministic nonlinear discrete-time systems whose inputs are generated by PI for undiscounted cost functions. We first assume that PI is recursively feasible, in the sense that the optimization problems solved at each iteration admit a solution. In this case, we provide novel conditions to establish recursive robust stability properties for a general attractor, meaning that the policies generated at each iteration ensure a robust \\KL","authors_text":"Dragan Nesic, Mathieu Granzotto, Olivier Lindamulage De Silva, Romain Postoyan, Zhong-Ping Jiang","cross_cats":["cs.SY","eess.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-10-26T04:11:08Z","title":"Policy iteration: for want of recursive feasibility, all is not lost"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.14459","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:e421fcb1a8eab0727087123657d4829efa059227feaa7897fe69392123a9df07","target":"record","created_at":"2026-07-05T05:10:45Z","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":"056b6177c79e50639ee2219d326303af1f5027cb771d87aea2677e5705bc98b8","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-10-26T04:11:08Z","title_canon_sha256":"98bc30017eb88764de9d5b74611d5e70f2f60a0f66a33239ea106371dddfab37"},"schema_version":"1.0","source":{"id":"2210.14459","kind":"arxiv","version":1}},"canonical_sha256":"40e4790261888232d5d71e4ea1b36ad19f7c9277515bd7fbc356c2965728b1e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"40e4790261888232d5d71e4ea1b36ad19f7c9277515bd7fbc356c2965728b1e0","first_computed_at":"2026-07-05T05:10:45.378016Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:10:45.378016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+u8qeLans9iStnNnhraCDP2n1nlmJXG8upEgKs/RPJ5CxRElXNmlvkiUrOvfgdkBcezg+jzS9hTnrHIcrvvUAA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:10:45.378372Z","signed_message":"canonical_sha256_bytes"},"source_id":"2210.14459","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e421fcb1a8eab0727087123657d4829efa059227feaa7897fe69392123a9df07","sha256:9bff752bca1b386b496a4b0ccc7a00e936099eff423e528cabdac899d5f570d4"],"state_sha256":"4871a705e7dc298343704fff19a5aede4915d2b90d9c1e9c415d04a9b2d27cfa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RBuv8t5JlP4IoJUkLdQb8IiJb0Uuna1S/j83cq20Th/eFhZIV0ZU/f2ksFmwGXoo0xOgaITIt/msWfrXZxetCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T05:34:46.269711Z","bundle_sha256":"43b8ca3fe421c1ee4f6944f0ee3e94dcb2f20c9e7b266b6a00ebc8b6dfc7e8fc"}}