{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NQ6JGTAPPMCUPAR7C75DOKT3DM","short_pith_number":"pith:NQ6JGTAP","schema_version":"1.0","canonical_sha256":"6c3c934c0f7b0547823f17fa372a7b1b3c97b0cd12a1a13faa39b304b8ebf658","source":{"kind":"arxiv","id":"1712.09821","version":2},"attestation_state":"computed","paper":{"title":"An adaptive $hp$-refinement strategy with computable guaranteed bound on the error reduction factor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Alexandre Ern, Iain Smears, Martin Vohral\\'ik, Patrik Daniel","submitted_at":"2017-12-28T10:54:51Z","abstract_excerpt":"We propose a new practical adaptive refinement strategy for $hp$-finite element approximations of elliptic problems. Following recent theoretical developments in polynomial-degree-robust a posteriori error analysis, we solve two types of discrete local problems on vertex-based patches. The first type involves the solution on each patch of a mixed finite element problem with homogeneous Neumann boundary conditions, which leads to an ${\\mathbf H}(\\mathrm{div},\\Omega)$-conforming equilibrated flux. This, in turn, yields a guaranteed upper bound on the error and serves to mark mesh vertices for re"},"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":"1712.09821","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-12-28T10:54:51Z","cross_cats_sorted":[],"title_canon_sha256":"f18812c55d403b65c401daaaf45c98a561b8e549bb2318a5b62e217548b58c7a","abstract_canon_sha256":"a39745265d9d3f0806e7d5089a97a897e76b6d595a2e4bcef784cdcb56d09eea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:19.136335Z","signature_b64":"/ibfzhMkJk1n5jB8ybb+HIM/vWQIYGRwwD6q6RGAk75oBM5J8mPsVP3vdslNCDv3f3zy43Y46HOnFoTm9Q3FCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c3c934c0f7b0547823f17fa372a7b1b3c97b0cd12a1a13faa39b304b8ebf658","last_reissued_at":"2026-05-18T00:03:19.135856Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:19.135856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An adaptive $hp$-refinement strategy with computable guaranteed bound on the error reduction factor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Alexandre Ern, Iain Smears, Martin Vohral\\'ik, Patrik Daniel","submitted_at":"2017-12-28T10:54:51Z","abstract_excerpt":"We propose a new practical adaptive refinement strategy for $hp$-finite element approximations of elliptic problems. Following recent theoretical developments in polynomial-degree-robust a posteriori error analysis, we solve two types of discrete local problems on vertex-based patches. The first type involves the solution on each patch of a mixed finite element problem with homogeneous Neumann boundary conditions, which leads to an ${\\mathbf H}(\\mathrm{div},\\Omega)$-conforming equilibrated flux. This, in turn, yields a guaranteed upper bound on the error and serves to mark mesh vertices for re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09821","kind":"arxiv","version":2},"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":"1712.09821","created_at":"2026-05-18T00:03:19.135936+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.09821v2","created_at":"2026-05-18T00:03:19.135936+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09821","created_at":"2026-05-18T00:03:19.135936+00:00"},{"alias_kind":"pith_short_12","alias_value":"NQ6JGTAPPMCU","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"NQ6JGTAPPMCUPAR7","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"NQ6JGTAP","created_at":"2026-05-18T12:31:34.259226+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/NQ6JGTAPPMCUPAR7C75DOKT3DM","json":"https://pith.science/pith/NQ6JGTAPPMCUPAR7C75DOKT3DM.json","graph_json":"https://pith.science/api/pith-number/NQ6JGTAPPMCUPAR7C75DOKT3DM/graph.json","events_json":"https://pith.science/api/pith-number/NQ6JGTAPPMCUPAR7C75DOKT3DM/events.json","paper":"https://pith.science/paper/NQ6JGTAP"},"agent_actions":{"view_html":"https://pith.science/pith/NQ6JGTAPPMCUPAR7C75DOKT3DM","download_json":"https://pith.science/pith/NQ6JGTAPPMCUPAR7C75DOKT3DM.json","view_paper":"https://pith.science/paper/NQ6JGTAP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.09821&json=true","fetch_graph":"https://pith.science/api/pith-number/NQ6JGTAPPMCUPAR7C75DOKT3DM/graph.json","fetch_events":"https://pith.science/api/pith-number/NQ6JGTAPPMCUPAR7C75DOKT3DM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NQ6JGTAPPMCUPAR7C75DOKT3DM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NQ6JGTAPPMCUPAR7C75DOKT3DM/action/storage_attestation","attest_author":"https://pith.science/pith/NQ6JGTAPPMCUPAR7C75DOKT3DM/action/author_attestation","sign_citation":"https://pith.science/pith/NQ6JGTAPPMCUPAR7C75DOKT3DM/action/citation_signature","submit_replication":"https://pith.science/pith/NQ6JGTAPPMCUPAR7C75DOKT3DM/action/replication_record"}},"created_at":"2026-05-18T00:03:19.135936+00:00","updated_at":"2026-05-18T00:03:19.135936+00:00"}