{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:RRNGZOOPJF7MUL6PLARF7NOXKQ","short_pith_number":"pith:RRNGZOOP","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"},"canonical_sha256":"8c5a6cb9cf497eca2fcf58225fb5d754152b8271e39fbd4c243e80ef3d017f59","source":{"kind":"arxiv","id":"1905.04033","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04033","created_at":"2026-05-17T23:46:34Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04033v1","created_at":"2026-05-17T23:46:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04033","created_at":"2026-05-17T23:46:34Z"},{"alias_kind":"pith_short_12","alias_value":"RRNGZOOPJF7M","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RRNGZOOPJF7MUL6P","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RRNGZOOP","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:RRNGZOOPJF7MUL6PLARF7NOXKQ","target":"record","payload":{"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"},"canonical_sha256":"8c5a6cb9cf497eca2fcf58225fb5d754152b8271e39fbd4c243e80ef3d017f59","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"},"source_kind":"arxiv","source_id":"1905.04033","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:46:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0kdWOW8IT6S50ZvYMWmqRj6RkUB0keRse6ZEtD7temVnLiWxMVTYuZFLKr7Br+yrtqR717DNrk93jEh3OFbbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:02:04.744173Z"},"content_sha256":"c21963f494762288318c63b3efe6d234659906afb419b9f1a6ec1ea8f3dd3d96","schema_version":"1.0","event_id":"sha256:c21963f494762288318c63b3efe6d234659906afb419b9f1a6ec1ea8f3dd3d96"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:RRNGZOOPJF7MUL6PLARF7NOXKQ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:46:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0XNb9XpzmN58MN/8dEf4GQnkalF2t1uGvUr80f3PVqFU3aXyi8JvBNBi6DMhbZPK854+kmWbfjbQHA5AjA/QDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:02:04.745154Z"},"content_sha256":"1229c18095be564823ee034ae4539360e80e5ca7f8e2d83b4fe581e2ac71c453","schema_version":"1.0","event_id":"sha256:1229c18095be564823ee034ae4539360e80e5ca7f8e2d83b4fe581e2ac71c453"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RRNGZOOPJF7MUL6PLARF7NOXKQ/bundle.json","state_url":"https://pith.science/pith/RRNGZOOPJF7MUL6PLARF7NOXKQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RRNGZOOPJF7MUL6PLARF7NOXKQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T15:02:04Z","links":{"resolver":"https://pith.science/pith/RRNGZOOPJF7MUL6PLARF7NOXKQ","bundle":"https://pith.science/pith/RRNGZOOPJF7MUL6PLARF7NOXKQ/bundle.json","state":"https://pith.science/pith/RRNGZOOPJF7MUL6PLARF7NOXKQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RRNGZOOPJF7MUL6PLARF7NOXKQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RRNGZOOPJF7MUL6PLARF7NOXKQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"af435e288d7ffc68fb9cb3db5d38399b713287c0327413afd02cbbd31e345be8","cross_cats_sorted":["cs.MS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2019-05-10T09:41:30Z","title_canon_sha256":"9e12a2480c5fb6295237e42420fe8bfeb60f590940769c96dcfcd7d6300d610b"},"schema_version":"1.0","source":{"id":"1905.04033","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04033","created_at":"2026-05-17T23:46:34Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04033v1","created_at":"2026-05-17T23:46:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04033","created_at":"2026-05-17T23:46:34Z"},{"alias_kind":"pith_short_12","alias_value":"RRNGZOOPJF7M","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RRNGZOOPJF7MUL6P","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RRNGZOOP","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:1229c18095be564823ee034ae4539360e80e5ca7f8e2d83b4fe581e2ac71c453","target":"graph","created_at":"2026-05-17T23:46:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Jakub \\v{C}erven\\'y, Tzanio Kolev, Veselin Dobrev","cross_cats":["cs.MS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2019-05-10T09:41:30Z","title":"Non-Conforming Mesh Refinement for High-Order Finite Elements"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04033","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c21963f494762288318c63b3efe6d234659906afb419b9f1a6ec1ea8f3dd3d96","target":"record","created_at":"2026-05-17T23:46:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"af435e288d7ffc68fb9cb3db5d38399b713287c0327413afd02cbbd31e345be8","cross_cats_sorted":["cs.MS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2019-05-10T09:41:30Z","title_canon_sha256":"9e12a2480c5fb6295237e42420fe8bfeb60f590940769c96dcfcd7d6300d610b"},"schema_version":"1.0","source":{"id":"1905.04033","kind":"arxiv","version":1}},"canonical_sha256":"8c5a6cb9cf497eca2fcf58225fb5d754152b8271e39fbd4c243e80ef3d017f59","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c5a6cb9cf497eca2fcf58225fb5d754152b8271e39fbd4c243e80ef3d017f59","first_computed_at":"2026-05-17T23:46:34.802457Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:34.802457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"swQBBDTZsz3Lx5Aqf+TUcz5YHSYKbPRGzxVI2c9/8pEvIhE0jUB87nE+HtmzdxRNOLPgpnTDqU7V7KxYgFqrAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:34.802995Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.04033","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c21963f494762288318c63b3efe6d234659906afb419b9f1a6ec1ea8f3dd3d96","sha256:1229c18095be564823ee034ae4539360e80e5ca7f8e2d83b4fe581e2ac71c453"],"state_sha256":"3582097d827c1338cd5391e58fe36b8fa6ce9df72d51221b5b8ead24e0c43877"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2mEECjlYBPc5Ho+hssPbpPeNVES8hNhqtAY3cU/HTHrxud4Zihc6hHTLeT//GrIqyie+sdu+zO3oJx25KotxAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T15:02:04.750346Z","bundle_sha256":"628890911e56e85efef2cb6f6dd0e98128dd447c3b0c58ce1036018ae12c1ffd"}}