{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LG4WCVZT7VUFD7KEBUDOJZIZLG","short_pith_number":"pith:LG4WCVZT","schema_version":"1.0","canonical_sha256":"59b9615733fd6851fd440d06e4e51959af01bed3db8ee471de13f26e0e72efe5","source":{"kind":"arxiv","id":"1407.5044","version":1},"attestation_state":"computed","paper":{"title":"Domain decomposition based parallel Howard's algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Adriano Festa","submitted_at":"2014-07-18T15:43:00Z","abstract_excerpt":"The Classic Howard's algorithm, a technique of resolution for discrete Hamilton-Jacobi equations, is of large use in applications for its high efficiency and good performances. A special beneficial characteristic of the method is the superlinear convergence which, in presence of a finite number of controls, is reached in finite time. Performances of the method can be significantly improved by using parallel computing; how to build a parallel version of method is not a trivial point, the difficulties come from the strict relation between various values of the solution, even related to distant p"},"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":"1407.5044","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-07-18T15:43:00Z","cross_cats_sorted":[],"title_canon_sha256":"2d67cd90a2f6f3cd266535c0feca485ec8b525ff1c4005835471192845c74e56","abstract_canon_sha256":"c4ff960e4a870b4c4162ff93942b84117ab993c673ff7fe50053c732d7177f12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:22.088669Z","signature_b64":"Io1YzIfgCMPEUmKbTUaQpPPOqUjANaxdgsQBmN3d0q4Vg4iTFlCIO+iV5tUmhp91ZlXHyYLf0BKphog5//ggBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59b9615733fd6851fd440d06e4e51959af01bed3db8ee471de13f26e0e72efe5","last_reissued_at":"2026-05-18T02:47:22.088163Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:22.088163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Domain decomposition based parallel Howard's algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Adriano Festa","submitted_at":"2014-07-18T15:43:00Z","abstract_excerpt":"The Classic Howard's algorithm, a technique of resolution for discrete Hamilton-Jacobi equations, is of large use in applications for its high efficiency and good performances. A special beneficial characteristic of the method is the superlinear convergence which, in presence of a finite number of controls, is reached in finite time. Performances of the method can be significantly improved by using parallel computing; how to build a parallel version of method is not a trivial point, the difficulties come from the strict relation between various values of the solution, even related to distant p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5044","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":""},"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":"1407.5044","created_at":"2026-05-18T02:47:22.088235+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.5044v1","created_at":"2026-05-18T02:47:22.088235+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5044","created_at":"2026-05-18T02:47:22.088235+00:00"},{"alias_kind":"pith_short_12","alias_value":"LG4WCVZT7VUF","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LG4WCVZT7VUFD7KE","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LG4WCVZT","created_at":"2026-05-18T12:28:38.356838+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/LG4WCVZT7VUFD7KEBUDOJZIZLG","json":"https://pith.science/pith/LG4WCVZT7VUFD7KEBUDOJZIZLG.json","graph_json":"https://pith.science/api/pith-number/LG4WCVZT7VUFD7KEBUDOJZIZLG/graph.json","events_json":"https://pith.science/api/pith-number/LG4WCVZT7VUFD7KEBUDOJZIZLG/events.json","paper":"https://pith.science/paper/LG4WCVZT"},"agent_actions":{"view_html":"https://pith.science/pith/LG4WCVZT7VUFD7KEBUDOJZIZLG","download_json":"https://pith.science/pith/LG4WCVZT7VUFD7KEBUDOJZIZLG.json","view_paper":"https://pith.science/paper/LG4WCVZT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.5044&json=true","fetch_graph":"https://pith.science/api/pith-number/LG4WCVZT7VUFD7KEBUDOJZIZLG/graph.json","fetch_events":"https://pith.science/api/pith-number/LG4WCVZT7VUFD7KEBUDOJZIZLG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LG4WCVZT7VUFD7KEBUDOJZIZLG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LG4WCVZT7VUFD7KEBUDOJZIZLG/action/storage_attestation","attest_author":"https://pith.science/pith/LG4WCVZT7VUFD7KEBUDOJZIZLG/action/author_attestation","sign_citation":"https://pith.science/pith/LG4WCVZT7VUFD7KEBUDOJZIZLG/action/citation_signature","submit_replication":"https://pith.science/pith/LG4WCVZT7VUFD7KEBUDOJZIZLG/action/replication_record"}},"created_at":"2026-05-18T02:47:22.088235+00:00","updated_at":"2026-05-18T02:47:22.088235+00:00"}