{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RRNGZOOPJF7MUL6PLARF7NOXKQ","short_pith_number":"pith:RRNGZOOP","schema_version":"1.0","canonical_sha256":"8c5a6cb9cf497eca2fcf58225fb5d754152b8271e39fbd4c243e80ef3d017f59","source":{"kind":"arxiv","id":"1905.04033","version":1},"attestation_state":"computed","paper":{"title":"Non-Conforming Mesh Refinement for High-Order Finite Elements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"cs.NA","authors_text":"Jakub \\v{C}erven\\'y, Tzanio Kolev, Veselin Dobrev","submitted_at":"2019-05-10T09:41:30Z","abstract_excerpt":"We propose a general algorithm for non-conforming adaptive mesh refinement (AMR) of unstructured meshes in high-order finite element codes. Our focus is on h-refinement with a fixed polynomial order. The algorithm handles triangular, quadrilateral, hexahedral and prismatic meshes of arbitrarily high order curvature, for any order finite element space in the de Rham sequence. We present a flexible data structure for meshes with hanging nodes and a general procedure to construct the conforming interpolation operator, both in serial and in parallel. The algorithm and data structure allow anisotro"},"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":"1905.04033","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2019-05-10T09:41:30Z","cross_cats_sorted":["cs.MS"],"title_canon_sha256":"9e12a2480c5fb6295237e42420fe8bfeb60f590940769c96dcfcd7d6300d610b","abstract_canon_sha256":"af435e288d7ffc68fb9cb3db5d38399b713287c0327413afd02cbbd31e345be8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:34.802995Z","signature_b64":"swQBBDTZsz3Lx5Aqf+TUcz5YHSYKbPRGzxVI2c9/8pEvIhE0jUB87nE+HtmzdxRNOLPgpnTDqU7V7KxYgFqrAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c5a6cb9cf497eca2fcf58225fb5d754152b8271e39fbd4c243e80ef3d017f59","last_reissued_at":"2026-05-17T23:46:34.802457Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:34.802457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Conforming Mesh Refinement for High-Order Finite Elements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"cs.NA","authors_text":"Jakub \\v{C}erven\\'y, Tzanio Kolev, Veselin Dobrev","submitted_at":"2019-05-10T09:41:30Z","abstract_excerpt":"We propose a general algorithm for non-conforming adaptive mesh refinement (AMR) of unstructured meshes in high-order finite element codes. Our focus is on h-refinement with a fixed polynomial order. The algorithm handles triangular, quadrilateral, hexahedral and prismatic meshes of arbitrarily high order curvature, for any order finite element space in the de Rham sequence. We present a flexible data structure for meshes with hanging nodes and a general procedure to construct the conforming interpolation operator, both in serial and in parallel. The algorithm and data structure allow anisotro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04033","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":"1905.04033","created_at":"2026-05-17T23:46:34.802545+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.04033v1","created_at":"2026-05-17T23:46:34.802545+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04033","created_at":"2026-05-17T23:46:34.802545+00:00"},{"alias_kind":"pith_short_12","alias_value":"RRNGZOOPJF7M","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"RRNGZOOPJF7MUL6P","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"RRNGZOOP","created_at":"2026-05-18T12:33:27.125529+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/RRNGZOOPJF7MUL6PLARF7NOXKQ","json":"https://pith.science/pith/RRNGZOOPJF7MUL6PLARF7NOXKQ.json","graph_json":"https://pith.science/api/pith-number/RRNGZOOPJF7MUL6PLARF7NOXKQ/graph.json","events_json":"https://pith.science/api/pith-number/RRNGZOOPJF7MUL6PLARF7NOXKQ/events.json","paper":"https://pith.science/paper/RRNGZOOP"},"agent_actions":{"view_html":"https://pith.science/pith/RRNGZOOPJF7MUL6PLARF7NOXKQ","download_json":"https://pith.science/pith/RRNGZOOPJF7MUL6PLARF7NOXKQ.json","view_paper":"https://pith.science/paper/RRNGZOOP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.04033&json=true","fetch_graph":"https://pith.science/api/pith-number/RRNGZOOPJF7MUL6PLARF7NOXKQ/graph.json","fetch_events":"https://pith.science/api/pith-number/RRNGZOOPJF7MUL6PLARF7NOXKQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RRNGZOOPJF7MUL6PLARF7NOXKQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RRNGZOOPJF7MUL6PLARF7NOXKQ/action/storage_attestation","attest_author":"https://pith.science/pith/RRNGZOOPJF7MUL6PLARF7NOXKQ/action/author_attestation","sign_citation":"https://pith.science/pith/RRNGZOOPJF7MUL6PLARF7NOXKQ/action/citation_signature","submit_replication":"https://pith.science/pith/RRNGZOOPJF7MUL6PLARF7NOXKQ/action/replication_record"}},"created_at":"2026-05-17T23:46:34.802545+00:00","updated_at":"2026-05-17T23:46:34.802545+00:00"}