{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:WLUBSYWQ3QOYZGVQJC2APLKDBC","short_pith_number":"pith:WLUBSYWQ","canonical_record":{"source":{"id":"1308.2087","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-08-09T11:05:02Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"1beab89bac14e3fcf07069c0c7830df442250fa4be7e8ced9d467aa6bba11b01","abstract_canon_sha256":"f4fb65408fafc8d2d795212765fb6eb949edbb79e00490239bd0a17e818228d5"},"schema_version":"1.0"},"canonical_sha256":"b2e81962d0dc1d8c9ab048b407ad430893033ac63fe627152bc57e4ec1b0fcf4","source":{"kind":"arxiv","id":"1308.2087","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.2087","created_at":"2026-05-18T01:20:21Z"},{"alias_kind":"arxiv_version","alias_value":"1308.2087v3","created_at":"2026-05-18T01:20:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.2087","created_at":"2026-05-18T01:20:21Z"},{"alias_kind":"pith_short_12","alias_value":"WLUBSYWQ3QOY","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WLUBSYWQ3QOYZGVQ","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WLUBSYWQ","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:WLUBSYWQ3QOYZGVQJC2APLKDBC","target":"record","payload":{"canonical_record":{"source":{"id":"1308.2087","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-08-09T11:05:02Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"1beab89bac14e3fcf07069c0c7830df442250fa4be7e8ced9d467aa6bba11b01","abstract_canon_sha256":"f4fb65408fafc8d2d795212765fb6eb949edbb79e00490239bd0a17e818228d5"},"schema_version":"1.0"},"canonical_sha256":"b2e81962d0dc1d8c9ab048b407ad430893033ac63fe627152bc57e4ec1b0fcf4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:21.477259Z","signature_b64":"nvW41OIi+2eXq+9ey5kqA6V4hPhCxkmB2Bax72bSo5OnbxOng4cAkuWN0UFH/jXVBiaVhvRhiyw7qA4Kfk34CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2e81962d0dc1d8c9ab048b407ad430893033ac63fe627152bc57e4ec1b0fcf4","last_reissued_at":"2026-05-18T01:20:21.476685Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:21.476685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.2087","source_version":3,"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-05-18T01:20:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a7dqKBPrZWiHy7NsPPlfdiGcaIegv+cZTmaJIjfqAg6p1d6BNkcm/fWXyN3Y/b1P5R5yOx73tviluJlVFseKAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:00:44.112347Z"},"content_sha256":"77aea0358ed19cdbfa82b332fd0081a12bf1dabf9de8b7e13128f26bb108f933","schema_version":"1.0","event_id":"sha256:77aea0358ed19cdbfa82b332fd0081a12bf1dabf9de8b7e13128f26bb108f933"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:WLUBSYWQ3QOYZGVQJC2APLKDBC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Policy Iteration Algorithm for Dynamic Programming Equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.OC","authors_text":"Alessandro Alla, Dante Kalise, Maurizio Falcone","submitted_at":"2013-08-09T11:05:02Z","abstract_excerpt":"We present an accelerated algorithm for the solution of static Hamilton-Jacobi-Bellman equations related to optimal control problems. Our scheme is based on a classic policy iteration procedure, which is known to have superlinear convergence in many relevant cases provided the initial guess is sufficiently close to the solution. In many cases, this limitation degenerates into a behavior similar to a value iteration method, with an increased computation time. The new scheme circumvents this problem by combining the advantages of both algorithms with an efficient coupling. The method starts with"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.2087","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T01:20:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PK0nZQpF2BoJgL4jZvruG+dnm1q5Gh3FhNnhmjt6xsWaqp/voM5Gi5EzfifhhQPkll1sTAjAgrXu7i07ww6hCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:00:44.112981Z"},"content_sha256":"0861ce2023af2efd346a50729cfeb6a9c4471edda70956df48f2f4784dead15d","schema_version":"1.0","event_id":"sha256:0861ce2023af2efd346a50729cfeb6a9c4471edda70956df48f2f4784dead15d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WLUBSYWQ3QOYZGVQJC2APLKDBC/bundle.json","state_url":"https://pith.science/pith/WLUBSYWQ3QOYZGVQJC2APLKDBC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WLUBSYWQ3QOYZGVQJC2APLKDBC/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-05-26T15:00:44Z","links":{"resolver":"https://pith.science/pith/WLUBSYWQ3QOYZGVQJC2APLKDBC","bundle":"https://pith.science/pith/WLUBSYWQ3QOYZGVQJC2APLKDBC/bundle.json","state":"https://pith.science/pith/WLUBSYWQ3QOYZGVQJC2APLKDBC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WLUBSYWQ3QOYZGVQJC2APLKDBC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:WLUBSYWQ3QOYZGVQJC2APLKDBC","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":"f4fb65408fafc8d2d795212765fb6eb949edbb79e00490239bd0a17e818228d5","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-08-09T11:05:02Z","title_canon_sha256":"1beab89bac14e3fcf07069c0c7830df442250fa4be7e8ced9d467aa6bba11b01"},"schema_version":"1.0","source":{"id":"1308.2087","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.2087","created_at":"2026-05-18T01:20:21Z"},{"alias_kind":"arxiv_version","alias_value":"1308.2087v3","created_at":"2026-05-18T01:20:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.2087","created_at":"2026-05-18T01:20:21Z"},{"alias_kind":"pith_short_12","alias_value":"WLUBSYWQ3QOY","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WLUBSYWQ3QOYZGVQ","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WLUBSYWQ","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:0861ce2023af2efd346a50729cfeb6a9c4471edda70956df48f2f4784dead15d","target":"graph","created_at":"2026-05-18T01:20:21Z","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"},"paper":{"abstract_excerpt":"We present an accelerated algorithm for the solution of static Hamilton-Jacobi-Bellman equations related to optimal control problems. Our scheme is based on a classic policy iteration procedure, which is known to have superlinear convergence in many relevant cases provided the initial guess is sufficiently close to the solution. In many cases, this limitation degenerates into a behavior similar to a value iteration method, with an increased computation time. The new scheme circumvents this problem by combining the advantages of both algorithms with an efficient coupling. The method starts with","authors_text":"Alessandro Alla, Dante Kalise, Maurizio Falcone","cross_cats":["math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-08-09T11:05:02Z","title":"An Efficient Policy Iteration Algorithm for Dynamic Programming Equations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.2087","kind":"arxiv","version":3},"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:77aea0358ed19cdbfa82b332fd0081a12bf1dabf9de8b7e13128f26bb108f933","target":"record","created_at":"2026-05-18T01:20:21Z","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":"f4fb65408fafc8d2d795212765fb6eb949edbb79e00490239bd0a17e818228d5","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-08-09T11:05:02Z","title_canon_sha256":"1beab89bac14e3fcf07069c0c7830df442250fa4be7e8ced9d467aa6bba11b01"},"schema_version":"1.0","source":{"id":"1308.2087","kind":"arxiv","version":3}},"canonical_sha256":"b2e81962d0dc1d8c9ab048b407ad430893033ac63fe627152bc57e4ec1b0fcf4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b2e81962d0dc1d8c9ab048b407ad430893033ac63fe627152bc57e4ec1b0fcf4","first_computed_at":"2026-05-18T01:20:21.476685Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:21.476685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nvW41OIi+2eXq+9ey5kqA6V4hPhCxkmB2Bax72bSo5OnbxOng4cAkuWN0UFH/jXVBiaVhvRhiyw7qA4Kfk34CA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:21.477259Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.2087","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:77aea0358ed19cdbfa82b332fd0081a12bf1dabf9de8b7e13128f26bb108f933","sha256:0861ce2023af2efd346a50729cfeb6a9c4471edda70956df48f2f4784dead15d"],"state_sha256":"49c5353530a94370dba39aab4abfe9db26f20671669b67a74c45ee19d1176697"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CYndwFsgaK+jMPvaQyn7hBi7NDU49dVOf7hR0MEob2XTh8IYire1hGC0P+bG+4PsS5r1dhZNBFwqRgCJBosnAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:00:44.116203Z","bundle_sha256":"77cb05659300a4dd3ee6329a8864324ec5c122ac2445752dc075ba01777fb664"}}