{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:UNOEDF6TFQZ4XNQSRIS65VDKKY","short_pith_number":"pith:UNOEDF6T","schema_version":"1.0","canonical_sha256":"a35c4197d32c33cbb6128a25eed46a5638e9b8dabb54c661db9c9f7abb5b0ef3","source":{"kind":"arxiv","id":"1404.4698","version":1},"attestation_state":"computed","paper":{"title":"Cross-Points in Domain Decomposition Methods with a Finite Element Discretization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"K\\'evin Santugini-Repiquet (IMB), Martin J. Gander","submitted_at":"2014-04-18T06:19:39Z","abstract_excerpt":"Non-overlapping domain decomposition methods necessarily have to exchange Dirichlet and Neumann traces at interfaces in order to be able to converge to the underlying mono-domain solution. Well known such non-overlapping methods are the Dirichlet-Neumann method, the FETI and Neumann-Neumann methods, and optimized Schwarz methods. For all these methods, cross-points in the domain decomposition configuration where more than two subdomains meet do not pose any problem at the continuous level, but care must be taken when the methods are discretized. We show in this paper two possible approaches fo"},"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":"1404.4698","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-04-18T06:19:39Z","cross_cats_sorted":[],"title_canon_sha256":"414a8d00a710136c3ed04d19abdce022345c2ff88e0fa44785fac7450a73ee41","abstract_canon_sha256":"88aa4dff269dccfcb83ababe0052bb3f2e78b0d0b15d8657128ea2cfc9ef3915"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:55.344944Z","signature_b64":"LGSiOmukUfmaMnNDHf04Pb+gQzzDa7SO1M5X8WTCT6GmAdUq1LBb6kHmsLvIgqLJQIIXXu9KmxmicIudUXCnCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a35c4197d32c33cbb6128a25eed46a5638e9b8dabb54c661db9c9f7abb5b0ef3","last_reissued_at":"2026-05-18T02:53:55.344052Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:55.344052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cross-Points in Domain Decomposition Methods with a Finite Element Discretization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"K\\'evin Santugini-Repiquet (IMB), Martin J. Gander","submitted_at":"2014-04-18T06:19:39Z","abstract_excerpt":"Non-overlapping domain decomposition methods necessarily have to exchange Dirichlet and Neumann traces at interfaces in order to be able to converge to the underlying mono-domain solution. Well known such non-overlapping methods are the Dirichlet-Neumann method, the FETI and Neumann-Neumann methods, and optimized Schwarz methods. For all these methods, cross-points in the domain decomposition configuration where more than two subdomains meet do not pose any problem at the continuous level, but care must be taken when the methods are discretized. We show in this paper two possible approaches fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4698","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":"1404.4698","created_at":"2026-05-18T02:53:55.344197+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.4698v1","created_at":"2026-05-18T02:53:55.344197+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4698","created_at":"2026-05-18T02:53:55.344197+00:00"},{"alias_kind":"pith_short_12","alias_value":"UNOEDF6TFQZ4","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"UNOEDF6TFQZ4XNQS","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"UNOEDF6T","created_at":"2026-05-18T12:28:52.271510+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/UNOEDF6TFQZ4XNQSRIS65VDKKY","json":"https://pith.science/pith/UNOEDF6TFQZ4XNQSRIS65VDKKY.json","graph_json":"https://pith.science/api/pith-number/UNOEDF6TFQZ4XNQSRIS65VDKKY/graph.json","events_json":"https://pith.science/api/pith-number/UNOEDF6TFQZ4XNQSRIS65VDKKY/events.json","paper":"https://pith.science/paper/UNOEDF6T"},"agent_actions":{"view_html":"https://pith.science/pith/UNOEDF6TFQZ4XNQSRIS65VDKKY","download_json":"https://pith.science/pith/UNOEDF6TFQZ4XNQSRIS65VDKKY.json","view_paper":"https://pith.science/paper/UNOEDF6T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.4698&json=true","fetch_graph":"https://pith.science/api/pith-number/UNOEDF6TFQZ4XNQSRIS65VDKKY/graph.json","fetch_events":"https://pith.science/api/pith-number/UNOEDF6TFQZ4XNQSRIS65VDKKY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UNOEDF6TFQZ4XNQSRIS65VDKKY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UNOEDF6TFQZ4XNQSRIS65VDKKY/action/storage_attestation","attest_author":"https://pith.science/pith/UNOEDF6TFQZ4XNQSRIS65VDKKY/action/author_attestation","sign_citation":"https://pith.science/pith/UNOEDF6TFQZ4XNQSRIS65VDKKY/action/citation_signature","submit_replication":"https://pith.science/pith/UNOEDF6TFQZ4XNQSRIS65VDKKY/action/replication_record"}},"created_at":"2026-05-18T02:53:55.344197+00:00","updated_at":"2026-05-18T02:53:55.344197+00:00"}