{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UXXW3FS3ZVDPRZCHXLBEWULEI5","short_pith_number":"pith:UXXW3FS3","schema_version":"1.0","canonical_sha256":"a5ef6d965bcd46f8e447bac24b5164475235498b2c7b09ef1f4ec2bef23936b9","source":{"kind":"arxiv","id":"1705.03434","version":1},"attestation_state":"computed","paper":{"title":"Two-component domain decomposition scheme with overlapping subdomains for parabolic equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NA","authors_text":"Petr N. Vabishchevich","submitted_at":"2017-05-09T17:17:44Z","abstract_excerpt":"An iteration-free method of domain decomposition is considered for approximate solving a boundary value problem for a second-order parabolic equation. A standard approach to constructing domain decomposition schemes is based on a partition of unity for the domain under the consideration. Here a new general approach is proposed for constructing domain decomposition schemes with overlapping subdomains based on indicator functions of subdomains. The basic peculiarity of this method is connected with a representation of the problem operator as the sum of two operators, which are constructed for tw"},"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":"1705.03434","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-05-09T17:17:44Z","cross_cats_sorted":[],"title_canon_sha256":"d1d437e9c166224070ee9460f743f963860346d31ed3984bda52430dffd6c1b4","abstract_canon_sha256":"1f0d8cb22a2956afbef773bc1e4d459b5e15fc6ff0bf7e83a7092239225eb4ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:47.860768Z","signature_b64":"x1LcaqdU2Xx3MRt16pXg7xwmYgZ1PRNR6vPFWh7uD9xNFCWypooIwsPGgsQnFcTTp2zdA8Ao5MNut6f+rHjtDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5ef6d965bcd46f8e447bac24b5164475235498b2c7b09ef1f4ec2bef23936b9","last_reissued_at":"2026-05-18T00:44:47.860302Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:47.860302Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two-component domain decomposition scheme with overlapping subdomains for parabolic equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NA","authors_text":"Petr N. Vabishchevich","submitted_at":"2017-05-09T17:17:44Z","abstract_excerpt":"An iteration-free method of domain decomposition is considered for approximate solving a boundary value problem for a second-order parabolic equation. A standard approach to constructing domain decomposition schemes is based on a partition of unity for the domain under the consideration. Here a new general approach is proposed for constructing domain decomposition schemes with overlapping subdomains based on indicator functions of subdomains. The basic peculiarity of this method is connected with a representation of the problem operator as the sum of two operators, which are constructed for tw"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03434","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":"1705.03434","created_at":"2026-05-18T00:44:47.860388+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.03434v1","created_at":"2026-05-18T00:44:47.860388+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03434","created_at":"2026-05-18T00:44:47.860388+00:00"},{"alias_kind":"pith_short_12","alias_value":"UXXW3FS3ZVDP","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"UXXW3FS3ZVDPRZCH","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"UXXW3FS3","created_at":"2026-05-18T12:31:49.984773+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/UXXW3FS3ZVDPRZCHXLBEWULEI5","json":"https://pith.science/pith/UXXW3FS3ZVDPRZCHXLBEWULEI5.json","graph_json":"https://pith.science/api/pith-number/UXXW3FS3ZVDPRZCHXLBEWULEI5/graph.json","events_json":"https://pith.science/api/pith-number/UXXW3FS3ZVDPRZCHXLBEWULEI5/events.json","paper":"https://pith.science/paper/UXXW3FS3"},"agent_actions":{"view_html":"https://pith.science/pith/UXXW3FS3ZVDPRZCHXLBEWULEI5","download_json":"https://pith.science/pith/UXXW3FS3ZVDPRZCHXLBEWULEI5.json","view_paper":"https://pith.science/paper/UXXW3FS3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.03434&json=true","fetch_graph":"https://pith.science/api/pith-number/UXXW3FS3ZVDPRZCHXLBEWULEI5/graph.json","fetch_events":"https://pith.science/api/pith-number/UXXW3FS3ZVDPRZCHXLBEWULEI5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UXXW3FS3ZVDPRZCHXLBEWULEI5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UXXW3FS3ZVDPRZCHXLBEWULEI5/action/storage_attestation","attest_author":"https://pith.science/pith/UXXW3FS3ZVDPRZCHXLBEWULEI5/action/author_attestation","sign_citation":"https://pith.science/pith/UXXW3FS3ZVDPRZCHXLBEWULEI5/action/citation_signature","submit_replication":"https://pith.science/pith/UXXW3FS3ZVDPRZCHXLBEWULEI5/action/replication_record"}},"created_at":"2026-05-18T00:44:47.860388+00:00","updated_at":"2026-05-18T00:44:47.860388+00:00"}