{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EFWVJKZP6F2M26EZKBZV4K7CW5","short_pith_number":"pith:EFWVJKZP","schema_version":"1.0","canonical_sha256":"216d54ab2ff174cd789950735e2be2b7462ec2493b09ab4e4a80f4593aa8eea5","source":{"kind":"arxiv","id":"1710.01667","version":3},"attestation_state":"computed","paper":{"title":"An Optimally Convergent Coupling Approach for Interface Problems Approximated with Higher-Order Finite Elements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AP"],"primary_cat":"math.NA","authors_text":"James Cheung, Mauro Perego, Max Gunzburger, Pavel Bochev","submitted_at":"2017-10-04T15:51:39Z","abstract_excerpt":"In this paper, we present a new numerical method for determining the numerical solution of interface problems to optimal accuracy with respect to the polynomial order of the Lagrangian finite element space on polytopial meshes. We introduce the notion of a virtual interface, and on this virtual interface we enforce that \"extended\" interface conditions are satisfied in the sense of a Dirichlet--Neumann coupling. The virtual interface framework serves to bypass geometric variational crimes incurred by the classical finite element method. Further, this approach does not require that the geometric"},"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":"1710.01667","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-10-04T15:51:39Z","cross_cats_sorted":["math.AP"],"title_canon_sha256":"c8366f995c26e663e2015d0ffe0fda35cde8c249dea281a74e900850293e3787","abstract_canon_sha256":"45c2dd286625cac6c24799c2b6fad33f74c2b9f9adc2532ade9557da4e484ed7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:34.643245Z","signature_b64":"xUhNRwHXV49wz3rc1UVgZ50Fw312LLM7/ddsAFammYBNUawHwDWpP4knkNAWj5LORkkTbHqldnVPWtWlkjsXBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"216d54ab2ff174cd789950735e2be2b7462ec2493b09ab4e4a80f4593aa8eea5","last_reissued_at":"2026-05-18T00:21:34.642570Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:34.642570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Optimally Convergent Coupling Approach for Interface Problems Approximated with Higher-Order Finite Elements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AP"],"primary_cat":"math.NA","authors_text":"James Cheung, Mauro Perego, Max Gunzburger, Pavel Bochev","submitted_at":"2017-10-04T15:51:39Z","abstract_excerpt":"In this paper, we present a new numerical method for determining the numerical solution of interface problems to optimal accuracy with respect to the polynomial order of the Lagrangian finite element space on polytopial meshes. We introduce the notion of a virtual interface, and on this virtual interface we enforce that \"extended\" interface conditions are satisfied in the sense of a Dirichlet--Neumann coupling. The virtual interface framework serves to bypass geometric variational crimes incurred by the classical finite element method. Further, this approach does not require that the geometric"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01667","kind":"arxiv","version":3},"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":"1710.01667","created_at":"2026-05-18T00:21:34.642673+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.01667v3","created_at":"2026-05-18T00:21:34.642673+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01667","created_at":"2026-05-18T00:21:34.642673+00:00"},{"alias_kind":"pith_short_12","alias_value":"EFWVJKZP6F2M","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EFWVJKZP6F2M26EZ","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EFWVJKZP","created_at":"2026-05-18T12:31:12.930513+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/EFWVJKZP6F2M26EZKBZV4K7CW5","json":"https://pith.science/pith/EFWVJKZP6F2M26EZKBZV4K7CW5.json","graph_json":"https://pith.science/api/pith-number/EFWVJKZP6F2M26EZKBZV4K7CW5/graph.json","events_json":"https://pith.science/api/pith-number/EFWVJKZP6F2M26EZKBZV4K7CW5/events.json","paper":"https://pith.science/paper/EFWVJKZP"},"agent_actions":{"view_html":"https://pith.science/pith/EFWVJKZP6F2M26EZKBZV4K7CW5","download_json":"https://pith.science/pith/EFWVJKZP6F2M26EZKBZV4K7CW5.json","view_paper":"https://pith.science/paper/EFWVJKZP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.01667&json=true","fetch_graph":"https://pith.science/api/pith-number/EFWVJKZP6F2M26EZKBZV4K7CW5/graph.json","fetch_events":"https://pith.science/api/pith-number/EFWVJKZP6F2M26EZKBZV4K7CW5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EFWVJKZP6F2M26EZKBZV4K7CW5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EFWVJKZP6F2M26EZKBZV4K7CW5/action/storage_attestation","attest_author":"https://pith.science/pith/EFWVJKZP6F2M26EZKBZV4K7CW5/action/author_attestation","sign_citation":"https://pith.science/pith/EFWVJKZP6F2M26EZKBZV4K7CW5/action/citation_signature","submit_replication":"https://pith.science/pith/EFWVJKZP6F2M26EZKBZV4K7CW5/action/replication_record"}},"created_at":"2026-05-18T00:21:34.642673+00:00","updated_at":"2026-05-18T00:21:34.642673+00:00"}