{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:7LBXNEDTSLFIVI5CPE54YFSU2L","short_pith_number":"pith:7LBXNEDT","schema_version":"1.0","canonical_sha256":"fac376907392ca8aa3a2793bcc1654d2cb1d44582e38e5275ae1daa278014e2c","source":{"kind":"arxiv","id":"1109.3577","version":2},"attestation_state":"computed","paper":{"title":"A patchy Dynamic Programming scheme for a class of Hamilton-Jacobi-Bellman equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"math.NA","authors_text":"Athena Picarelli, Emiliano Cristiani, Maurizio Falcone, Simone Cacace","submitted_at":"2011-09-16T10:24:06Z","abstract_excerpt":"In this paper we present a new algorithm for the solution of Hamilton-Jacobi-Bellman equations related to optimal control problems. The key idea is to divide the domain of computation into subdomains which are shaped by the optimal dynamics of the underlying control problem. This can result in a rather complex geometrical subdivision, but it has the advantage that every subdomain is invariant with respect to the optimal dynamics, and then the solution can be computed independently in each subdomain. The features of this dynamics-dependent domain decomposition can be exploited to speed up the c"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1109.3577","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-09-16T10:24:06Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"6578d62170b11555d2e38d4ba765e606442abf8405eee40678ff4f3ad42f5095","abstract_canon_sha256":"f0396248b246290b17937d2980220533a9b9a3fa80172f0e612d3b9a7d1cbcce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:04.829084Z","signature_b64":"XwohbxQ2nU5IVQUVgK3oiwrwtj1KM21KzPMvjAW3rEbyhQM5RxPQpdx28DiSCAJRxZE7pAcaDFaVo8W6It0lDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fac376907392ca8aa3a2793bcc1654d2cb1d44582e38e5275ae1daa278014e2c","last_reissued_at":"2026-05-18T02:46:04.828576Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:04.828576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A patchy Dynamic Programming scheme for a class of Hamilton-Jacobi-Bellman equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"math.NA","authors_text":"Athena Picarelli, Emiliano Cristiani, Maurizio Falcone, Simone Cacace","submitted_at":"2011-09-16T10:24:06Z","abstract_excerpt":"In this paper we present a new algorithm for the solution of Hamilton-Jacobi-Bellman equations related to optimal control problems. The key idea is to divide the domain of computation into subdomains which are shaped by the optimal dynamics of the underlying control problem. This can result in a rather complex geometrical subdivision, but it has the advantage that every subdomain is invariant with respect to the optimal dynamics, and then the solution can be computed independently in each subdomain. The features of this dynamics-dependent domain decomposition can be exploited to speed up the c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3577","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1109.3577","created_at":"2026-05-18T02:46:04.828638+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.3577v2","created_at":"2026-05-18T02:46:04.828638+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3577","created_at":"2026-05-18T02:46:04.828638+00:00"},{"alias_kind":"pith_short_12","alias_value":"7LBXNEDTSLFI","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"7LBXNEDTSLFIVI5C","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"7LBXNEDT","created_at":"2026-05-18T12:26:22.705136+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7LBXNEDTSLFIVI5CPE54YFSU2L","json":"https://pith.science/pith/7LBXNEDTSLFIVI5CPE54YFSU2L.json","graph_json":"https://pith.science/api/pith-number/7LBXNEDTSLFIVI5CPE54YFSU2L/graph.json","events_json":"https://pith.science/api/pith-number/7LBXNEDTSLFIVI5CPE54YFSU2L/events.json","paper":"https://pith.science/paper/7LBXNEDT"},"agent_actions":{"view_html":"https://pith.science/pith/7LBXNEDTSLFIVI5CPE54YFSU2L","download_json":"https://pith.science/pith/7LBXNEDTSLFIVI5CPE54YFSU2L.json","view_paper":"https://pith.science/paper/7LBXNEDT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.3577&json=true","fetch_graph":"https://pith.science/api/pith-number/7LBXNEDTSLFIVI5CPE54YFSU2L/graph.json","fetch_events":"https://pith.science/api/pith-number/7LBXNEDTSLFIVI5CPE54YFSU2L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7LBXNEDTSLFIVI5CPE54YFSU2L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7LBXNEDTSLFIVI5CPE54YFSU2L/action/storage_attestation","attest_author":"https://pith.science/pith/7LBXNEDTSLFIVI5CPE54YFSU2L/action/author_attestation","sign_citation":"https://pith.science/pith/7LBXNEDTSLFIVI5CPE54YFSU2L/action/citation_signature","submit_replication":"https://pith.science/pith/7LBXNEDTSLFIVI5CPE54YFSU2L/action/replication_record"}},"created_at":"2026-05-18T02:46:04.828638+00:00","updated_at":"2026-05-18T02:46:04.828638+00:00"}