{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NWJA4M3CBT7UT2WDIV6CXUVMHV","short_pith_number":"pith:NWJA4M3C","schema_version":"1.0","canonical_sha256":"6d920e33620cff49eac3457c2bd2ac3d52553ddf9e2a014ead98839739c86c05","source":{"kind":"arxiv","id":"1807.01295","version":1},"attestation_state":"computed","paper":{"title":"Parallelization of the multi-level hp-adaptive finite cell method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","physics.comp-ph"],"primary_cat":"cs.DC","authors_text":"2) ((1) Technische Universit\\\"at M\\\"unchen, (2) Institute for Advanced Study, Ali \\\"Ozcan (1), Ernst Rank (1, Garching, Germany, Germany), John N. Jomo (1), Mohamed Elhaddad (1), Munich, Nils Zander (1), Ralf-Peter Mundani (1), Stefan Kollmannsberger (1), Technische Universit\\\"at M\\\"unchen","submitted_at":"2018-07-03T17:27:50Z","abstract_excerpt":"The multi-level hp-refinement scheme is a powerful extension of the finite element method that allows local mesh adaptation without the trouble of constraining hanging nodes. This is achieved through hierarchical high-order overlay meshes, a hp-scheme based on spatial refinement by superposition. An efficient parallelization of this method using standard domain decomposition approaches in combination with ghost elements faces the challenge of a large basis function support resulting from the overlay structure and is in many cases not feasible. In this contribution, a parallelization strategy f"},"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":"1807.01295","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-07-03T17:27:50Z","cross_cats_sorted":["cs.NA","math.NA","physics.comp-ph"],"title_canon_sha256":"c92dabb14e4f50e520643c6cec8477ec2e3373c442df4fa7ecaeaf6c8081dd6a","abstract_canon_sha256":"7bbd5a4abd7f84d421d7a13311d817289ad9c59c9163a78a89c3bdcac6d0dfc7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T19:12:05.670388Z","signature_b64":"J33XPmixPWrCiiDFnNRxHe2w/bGpj+RKJcA7a1CLODDGQuHL4CtPMsZga64PzLRBnki2CQ9pK6ZOwGw0NLvTDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d920e33620cff49eac3457c2bd2ac3d52553ddf9e2a014ead98839739c86c05","last_reissued_at":"2026-06-04T19:12:05.669828Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T19:12:05.669828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallelization of the multi-level hp-adaptive finite cell method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","physics.comp-ph"],"primary_cat":"cs.DC","authors_text":"2) ((1) Technische Universit\\\"at M\\\"unchen, (2) Institute for Advanced Study, Ali \\\"Ozcan (1), Ernst Rank (1, Garching, Germany, Germany), John N. Jomo (1), Mohamed Elhaddad (1), Munich, Nils Zander (1), Ralf-Peter Mundani (1), Stefan Kollmannsberger (1), Technische Universit\\\"at M\\\"unchen","submitted_at":"2018-07-03T17:27:50Z","abstract_excerpt":"The multi-level hp-refinement scheme is a powerful extension of the finite element method that allows local mesh adaptation without the trouble of constraining hanging nodes. This is achieved through hierarchical high-order overlay meshes, a hp-scheme based on spatial refinement by superposition. An efficient parallelization of this method using standard domain decomposition approaches in combination with ghost elements faces the challenge of a large basis function support resulting from the overlay structure and is in many cases not feasible. In this contribution, a parallelization strategy f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.01295","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1807.01295/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1807.01295","created_at":"2026-06-04T19:12:05.669913+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.01295v1","created_at":"2026-06-04T19:12:05.669913+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.01295","created_at":"2026-06-04T19:12:05.669913+00:00"},{"alias_kind":"pith_short_12","alias_value":"NWJA4M3CBT7U","created_at":"2026-06-04T19:12:05.669913+00:00"},{"alias_kind":"pith_short_16","alias_value":"NWJA4M3CBT7UT2WD","created_at":"2026-06-04T19:12:05.669913+00:00"},{"alias_kind":"pith_short_8","alias_value":"NWJA4M3C","created_at":"2026-06-04T19:12:05.669913+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/NWJA4M3CBT7UT2WDIV6CXUVMHV","json":"https://pith.science/pith/NWJA4M3CBT7UT2WDIV6CXUVMHV.json","graph_json":"https://pith.science/api/pith-number/NWJA4M3CBT7UT2WDIV6CXUVMHV/graph.json","events_json":"https://pith.science/api/pith-number/NWJA4M3CBT7UT2WDIV6CXUVMHV/events.json","paper":"https://pith.science/paper/NWJA4M3C"},"agent_actions":{"view_html":"https://pith.science/pith/NWJA4M3CBT7UT2WDIV6CXUVMHV","download_json":"https://pith.science/pith/NWJA4M3CBT7UT2WDIV6CXUVMHV.json","view_paper":"https://pith.science/paper/NWJA4M3C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.01295&json=true","fetch_graph":"https://pith.science/api/pith-number/NWJA4M3CBT7UT2WDIV6CXUVMHV/graph.json","fetch_events":"https://pith.science/api/pith-number/NWJA4M3CBT7UT2WDIV6CXUVMHV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NWJA4M3CBT7UT2WDIV6CXUVMHV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NWJA4M3CBT7UT2WDIV6CXUVMHV/action/storage_attestation","attest_author":"https://pith.science/pith/NWJA4M3CBT7UT2WDIV6CXUVMHV/action/author_attestation","sign_citation":"https://pith.science/pith/NWJA4M3CBT7UT2WDIV6CXUVMHV/action/citation_signature","submit_replication":"https://pith.science/pith/NWJA4M3CBT7UT2WDIV6CXUVMHV/action/replication_record"}},"created_at":"2026-06-04T19:12:05.669913+00:00","updated_at":"2026-06-04T19:12:05.669913+00:00"}