{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4W5N4MVGW4KBALRVLLNLV3YWPY","short_pith_number":"pith:4W5N4MVG","schema_version":"1.0","canonical_sha256":"e5bade32a6b714102e355adabaef167e32a10e4e825b64c886e19d8bd8c144c2","source":{"kind":"arxiv","id":"1409.3818","version":1},"attestation_state":"computed","paper":{"title":"A new Algorithm Based on Factorization for Heterogeneous Domain Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Laurence Halpern (LAGA), Martin J. Gander, V\\'eronique Martin (LAMFA)","submitted_at":"2014-09-12T18:47:41Z","abstract_excerpt":"Often computational models are too expensive to be solved in the entire domain of simulation, and a cheaper model would suffice away from the main zone of interest. We present for the concrete example of an evolution problem of advection reaction diffusion type a heterogeneous domain decomposition algorithm which allows us to recover a solution that is very close to the solution of the fully viscous problem, but solves only an inviscid problem in parts of the domain. Our new algorithm is based on the factorization of the underlying differential operator, and we therefore call it factorization "},"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":"1409.3818","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-09-12T18:47:41Z","cross_cats_sorted":[],"title_canon_sha256":"c764b9465ad69fcbae5ddde9e0b8105e10a670866c91c9feeca413ba1b7ea3d8","abstract_canon_sha256":"a8b42c11ca2f667598f6ec2b117de397aca299a569b65b5668614472977aee66"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:54.616050Z","signature_b64":"wUCQug5exNgvHGbGCWpaQxlZ7wimjYZ2wUEbdMQrqH1lWHwXzeHpnM8z2jv+62y2/c6SNwN4CR1XPA9KGRKnCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5bade32a6b714102e355adabaef167e32a10e4e825b64c886e19d8bd8c144c2","last_reissued_at":"2026-05-18T02:42:54.615701Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:54.615701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new Algorithm Based on Factorization for Heterogeneous Domain Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Laurence Halpern (LAGA), Martin J. Gander, V\\'eronique Martin (LAMFA)","submitted_at":"2014-09-12T18:47:41Z","abstract_excerpt":"Often computational models are too expensive to be solved in the entire domain of simulation, and a cheaper model would suffice away from the main zone of interest. We present for the concrete example of an evolution problem of advection reaction diffusion type a heterogeneous domain decomposition algorithm which allows us to recover a solution that is very close to the solution of the fully viscous problem, but solves only an inviscid problem in parts of the domain. Our new algorithm is based on the factorization of the underlying differential operator, and we therefore call it factorization "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3818","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":"1409.3818","created_at":"2026-05-18T02:42:54.615753+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.3818v1","created_at":"2026-05-18T02:42:54.615753+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3818","created_at":"2026-05-18T02:42:54.615753+00:00"},{"alias_kind":"pith_short_12","alias_value":"4W5N4MVGW4KB","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4W5N4MVGW4KBALRV","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4W5N4MVG","created_at":"2026-05-18T12:28:14.216126+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/4W5N4MVGW4KBALRVLLNLV3YWPY","json":"https://pith.science/pith/4W5N4MVGW4KBALRVLLNLV3YWPY.json","graph_json":"https://pith.science/api/pith-number/4W5N4MVGW4KBALRVLLNLV3YWPY/graph.json","events_json":"https://pith.science/api/pith-number/4W5N4MVGW4KBALRVLLNLV3YWPY/events.json","paper":"https://pith.science/paper/4W5N4MVG"},"agent_actions":{"view_html":"https://pith.science/pith/4W5N4MVGW4KBALRVLLNLV3YWPY","download_json":"https://pith.science/pith/4W5N4MVGW4KBALRVLLNLV3YWPY.json","view_paper":"https://pith.science/paper/4W5N4MVG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.3818&json=true","fetch_graph":"https://pith.science/api/pith-number/4W5N4MVGW4KBALRVLLNLV3YWPY/graph.json","fetch_events":"https://pith.science/api/pith-number/4W5N4MVGW4KBALRVLLNLV3YWPY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4W5N4MVGW4KBALRVLLNLV3YWPY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4W5N4MVGW4KBALRVLLNLV3YWPY/action/storage_attestation","attest_author":"https://pith.science/pith/4W5N4MVGW4KBALRVLLNLV3YWPY/action/author_attestation","sign_citation":"https://pith.science/pith/4W5N4MVGW4KBALRVLLNLV3YWPY/action/citation_signature","submit_replication":"https://pith.science/pith/4W5N4MVGW4KBALRVLLNLV3YWPY/action/replication_record"}},"created_at":"2026-05-18T02:42:54.615753+00:00","updated_at":"2026-05-18T02:42:54.615753+00:00"}