{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:LG4WCVZT7VUFD7KEBUDOJZIZLG","short_pith_number":"pith:LG4WCVZT","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"},"canonical_sha256":"59b9615733fd6851fd440d06e4e51959af01bed3db8ee471de13f26e0e72efe5","source":{"kind":"arxiv","id":"1407.5044","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.5044","created_at":"2026-05-18T02:47:22Z"},{"alias_kind":"arxiv_version","alias_value":"1407.5044v1","created_at":"2026-05-18T02:47:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5044","created_at":"2026-05-18T02:47:22Z"},{"alias_kind":"pith_short_12","alias_value":"LG4WCVZT7VUF","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LG4WCVZT7VUFD7KE","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LG4WCVZT","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:LG4WCVZT7VUFD7KEBUDOJZIZLG","target":"record","payload":{"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"},"canonical_sha256":"59b9615733fd6851fd440d06e4e51959af01bed3db8ee471de13f26e0e72efe5","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"},"source_kind":"arxiv","source_id":"1407.5044","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-05-18T02:47:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"twiTOyGbY8tUt1K/1L7pnSOCA+lYhlOXk998gYuRaYyyJuYu47tWCClFAKBbCCxFjkVfy6NLHBYHDxv8pU5PAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T09:26:18.157425Z"},"content_sha256":"1429a9195cec62f24f490a35943ebb0267a3bc3620be2f09f9c690d93034263f","schema_version":"1.0","event_id":"sha256:1429a9195cec62f24f490a35943ebb0267a3bc3620be2f09f9c690d93034263f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:LG4WCVZT7VUFD7KEBUDOJZIZLG","target":"graph","payload":{"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"},"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-18T02:47:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tET6cv2zDfZklqUpfSwU2eqPRyswOjGqY+Xgt+htihF9hBFsLSogsnt9KSQiARp78EZiHSQlUvLxWjsz6GujBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T09:26:18.157778Z"},"content_sha256":"3f7becc9d680a395af5ea1e969b06a093ecf184eb3782bc4b01d0963cafd2453","schema_version":"1.0","event_id":"sha256:3f7becc9d680a395af5ea1e969b06a093ecf184eb3782bc4b01d0963cafd2453"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LG4WCVZT7VUFD7KEBUDOJZIZLG/bundle.json","state_url":"https://pith.science/pith/LG4WCVZT7VUFD7KEBUDOJZIZLG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LG4WCVZT7VUFD7KEBUDOJZIZLG/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-20T09:26:18Z","links":{"resolver":"https://pith.science/pith/LG4WCVZT7VUFD7KEBUDOJZIZLG","bundle":"https://pith.science/pith/LG4WCVZT7VUFD7KEBUDOJZIZLG/bundle.json","state":"https://pith.science/pith/LG4WCVZT7VUFD7KEBUDOJZIZLG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LG4WCVZT7VUFD7KEBUDOJZIZLG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LG4WCVZT7VUFD7KEBUDOJZIZLG","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":"c4ff960e4a870b4c4162ff93942b84117ab993c673ff7fe50053c732d7177f12","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-07-18T15:43:00Z","title_canon_sha256":"2d67cd90a2f6f3cd266535c0feca485ec8b525ff1c4005835471192845c74e56"},"schema_version":"1.0","source":{"id":"1407.5044","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.5044","created_at":"2026-05-18T02:47:22Z"},{"alias_kind":"arxiv_version","alias_value":"1407.5044v1","created_at":"2026-05-18T02:47:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5044","created_at":"2026-05-18T02:47:22Z"},{"alias_kind":"pith_short_12","alias_value":"LG4WCVZT7VUF","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LG4WCVZT7VUFD7KE","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LG4WCVZT","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:3f7becc9d680a395af5ea1e969b06a093ecf184eb3782bc4b01d0963cafd2453","target":"graph","created_at":"2026-05-18T02:47:22Z","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":"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","authors_text":"Adriano Festa","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-07-18T15:43:00Z","title":"Domain decomposition based parallel Howard's algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5044","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:1429a9195cec62f24f490a35943ebb0267a3bc3620be2f09f9c690d93034263f","target":"record","created_at":"2026-05-18T02:47:22Z","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":"c4ff960e4a870b4c4162ff93942b84117ab993c673ff7fe50053c732d7177f12","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-07-18T15:43:00Z","title_canon_sha256":"2d67cd90a2f6f3cd266535c0feca485ec8b525ff1c4005835471192845c74e56"},"schema_version":"1.0","source":{"id":"1407.5044","kind":"arxiv","version":1}},"canonical_sha256":"59b9615733fd6851fd440d06e4e51959af01bed3db8ee471de13f26e0e72efe5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59b9615733fd6851fd440d06e4e51959af01bed3db8ee471de13f26e0e72efe5","first_computed_at":"2026-05-18T02:47:22.088163Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:22.088163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Io1YzIfgCMPEUmKbTUaQpPPOqUjANaxdgsQBmN3d0q4Vg4iTFlCIO+iV5tUmhp91ZlXHyYLf0BKphog5//ggBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:22.088669Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.5044","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1429a9195cec62f24f490a35943ebb0267a3bc3620be2f09f9c690d93034263f","sha256:3f7becc9d680a395af5ea1e969b06a093ecf184eb3782bc4b01d0963cafd2453"],"state_sha256":"fffec3fadf66d32586bcf3d0e6ce70a43426ecb2492af2ae0abd9c8466ff637b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rnHFf16KPrQVelct3/yxFQLB6NKIRCGHf2KERlGi0mICNATO7y7zwzNtW+h1cyImWPDBinTVfH9QbYQFNt4iDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T09:26:18.159715Z","bundle_sha256":"341d38456ff4bf57d81370fbcc54c19704547f45ce0ecc5d22509631d205aa15"}}