{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JQVNS24EKFWV4YSTXGVCQN6NEL","short_pith_number":"pith:JQVNS24E","schema_version":"1.0","canonical_sha256":"4c2ad96b84516d5e6253b9aa2837cd22fd765317815a50a6594e56a071974548","source":{"kind":"arxiv","id":"1402.0744","version":1},"attestation_state":"computed","paper":{"title":"Adaptive Boundary Element Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Dirk Praetorius, Michael Feischl, Michael Karkulik, Norbert Heuer, Thomas F\\\"uhrer","submitted_at":"2014-02-04T14:34:41Z","abstract_excerpt":"This paper reviews the state of the art and discusses very recent mathematical developments in the field of adaptive boundary element methods. This includes an overview of available a posteriori error estimates as well as a state-of-the-art formulation of convergence and quasi-optimality of adaptive mesh-refining algorithms."},"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":"1402.0744","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-02-04T14:34:41Z","cross_cats_sorted":[],"title_canon_sha256":"d3bac322f4c3f9274b5e5b97be40eab08536092b315a75794a35c418a78321f0","abstract_canon_sha256":"9b5f5f43a0c1bac740817abad4a1f353bb8b28d9ca24efd335d3c4c9515b5590"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:27.099408Z","signature_b64":"UTKjc0qEgcFn0Mlulc75KEskIL+WUrNchLgw06pdNS/moqQfwes0XypfrSjSzy5L8I0QkOqKPGt6S0sfTRqwDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c2ad96b84516d5e6253b9aa2837cd22fd765317815a50a6594e56a071974548","last_reissued_at":"2026-05-18T02:48:27.098669Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:27.098669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Boundary Element Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Dirk Praetorius, Michael Feischl, Michael Karkulik, Norbert Heuer, Thomas F\\\"uhrer","submitted_at":"2014-02-04T14:34:41Z","abstract_excerpt":"This paper reviews the state of the art and discusses very recent mathematical developments in the field of adaptive boundary element methods. This includes an overview of available a posteriori error estimates as well as a state-of-the-art formulation of convergence and quasi-optimality of adaptive mesh-refining algorithms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0744","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":"1402.0744","created_at":"2026-05-18T02:48:27.098767+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.0744v1","created_at":"2026-05-18T02:48:27.098767+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0744","created_at":"2026-05-18T02:48:27.098767+00:00"},{"alias_kind":"pith_short_12","alias_value":"JQVNS24EKFWV","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"JQVNS24EKFWV4YST","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"JQVNS24E","created_at":"2026-05-18T12:28:35.611951+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/JQVNS24EKFWV4YSTXGVCQN6NEL","json":"https://pith.science/pith/JQVNS24EKFWV4YSTXGVCQN6NEL.json","graph_json":"https://pith.science/api/pith-number/JQVNS24EKFWV4YSTXGVCQN6NEL/graph.json","events_json":"https://pith.science/api/pith-number/JQVNS24EKFWV4YSTXGVCQN6NEL/events.json","paper":"https://pith.science/paper/JQVNS24E"},"agent_actions":{"view_html":"https://pith.science/pith/JQVNS24EKFWV4YSTXGVCQN6NEL","download_json":"https://pith.science/pith/JQVNS24EKFWV4YSTXGVCQN6NEL.json","view_paper":"https://pith.science/paper/JQVNS24E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.0744&json=true","fetch_graph":"https://pith.science/api/pith-number/JQVNS24EKFWV4YSTXGVCQN6NEL/graph.json","fetch_events":"https://pith.science/api/pith-number/JQVNS24EKFWV4YSTXGVCQN6NEL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JQVNS24EKFWV4YSTXGVCQN6NEL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JQVNS24EKFWV4YSTXGVCQN6NEL/action/storage_attestation","attest_author":"https://pith.science/pith/JQVNS24EKFWV4YSTXGVCQN6NEL/action/author_attestation","sign_citation":"https://pith.science/pith/JQVNS24EKFWV4YSTXGVCQN6NEL/action/citation_signature","submit_replication":"https://pith.science/pith/JQVNS24EKFWV4YSTXGVCQN6NEL/action/replication_record"}},"created_at":"2026-05-18T02:48:27.098767+00:00","updated_at":"2026-05-18T02:48:27.098767+00:00"}