{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CHBTD5KYRSJCXBGDAQI6ID5L7E","short_pith_number":"pith:CHBTD5KY","schema_version":"1.0","canonical_sha256":"11c331f5588c922b84c30411e40fabf92d7fd01be9fb5058d2f81baa2cc0f0ab","source":{"kind":"arxiv","id":"1811.09260","version":1},"attestation_state":"computed","paper":{"title":"Finite element error estimates in $L^2$ for regularized discrete approximations to the obstacle problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Christian Kahle, Dominik Hafemeyer, Johannes Pfefferer","submitted_at":"2018-11-22T18:11:28Z","abstract_excerpt":"This work is concerned with quasi-optimal a-priori finite element error estimates for the obstacle problem in the $L^2$-norm. The discrete approximations are introduced as solutions to a finite element discretization of an accordingly regularized problem. The underlying domain is only assumed to be convex and polygonally or polyhedrally bounded such that an application of point-wise error estimates results in a rate less than two in general. The main ingredient for proving the quasi-optimal estimates is the structural and commonly used assumption that the obstacle is inactive on the boundary o"},"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":"1811.09260","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-11-22T18:11:28Z","cross_cats_sorted":[],"title_canon_sha256":"88a9d208ce41713bdb42cff8194e22cb56572fe626728b3ec12bb3ef1da74a63","abstract_canon_sha256":"3bd9b829c9d0d87385aa1f214cc96a68ba8940c6a177b961599b074e030ba6b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:03.798485Z","signature_b64":"unJB64eE9N0sJf3501ejLt3kOuNlax4XkZFglcJEGvyDvJGqk5wpohoMj75Y2/NfMBsJ6+MdwumJRU42N9aSDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11c331f5588c922b84c30411e40fabf92d7fd01be9fb5058d2f81baa2cc0f0ab","last_reissued_at":"2026-05-18T00:00:03.797974Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:03.797974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finite element error estimates in $L^2$ for regularized discrete approximations to the obstacle problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Christian Kahle, Dominik Hafemeyer, Johannes Pfefferer","submitted_at":"2018-11-22T18:11:28Z","abstract_excerpt":"This work is concerned with quasi-optimal a-priori finite element error estimates for the obstacle problem in the $L^2$-norm. The discrete approximations are introduced as solutions to a finite element discretization of an accordingly regularized problem. The underlying domain is only assumed to be convex and polygonally or polyhedrally bounded such that an application of point-wise error estimates results in a rate less than two in general. The main ingredient for proving the quasi-optimal estimates is the structural and commonly used assumption that the obstacle is inactive on the boundary o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.09260","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":"1811.09260","created_at":"2026-05-18T00:00:03.798050+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.09260v1","created_at":"2026-05-18T00:00:03.798050+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.09260","created_at":"2026-05-18T00:00:03.798050+00:00"},{"alias_kind":"pith_short_12","alias_value":"CHBTD5KYRSJC","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"CHBTD5KYRSJCXBGD","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"CHBTD5KY","created_at":"2026-05-18T12:32:16.446611+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/CHBTD5KYRSJCXBGDAQI6ID5L7E","json":"https://pith.science/pith/CHBTD5KYRSJCXBGDAQI6ID5L7E.json","graph_json":"https://pith.science/api/pith-number/CHBTD5KYRSJCXBGDAQI6ID5L7E/graph.json","events_json":"https://pith.science/api/pith-number/CHBTD5KYRSJCXBGDAQI6ID5L7E/events.json","paper":"https://pith.science/paper/CHBTD5KY"},"agent_actions":{"view_html":"https://pith.science/pith/CHBTD5KYRSJCXBGDAQI6ID5L7E","download_json":"https://pith.science/pith/CHBTD5KYRSJCXBGDAQI6ID5L7E.json","view_paper":"https://pith.science/paper/CHBTD5KY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.09260&json=true","fetch_graph":"https://pith.science/api/pith-number/CHBTD5KYRSJCXBGDAQI6ID5L7E/graph.json","fetch_events":"https://pith.science/api/pith-number/CHBTD5KYRSJCXBGDAQI6ID5L7E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CHBTD5KYRSJCXBGDAQI6ID5L7E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CHBTD5KYRSJCXBGDAQI6ID5L7E/action/storage_attestation","attest_author":"https://pith.science/pith/CHBTD5KYRSJCXBGDAQI6ID5L7E/action/author_attestation","sign_citation":"https://pith.science/pith/CHBTD5KYRSJCXBGDAQI6ID5L7E/action/citation_signature","submit_replication":"https://pith.science/pith/CHBTD5KYRSJCXBGDAQI6ID5L7E/action/replication_record"}},"created_at":"2026-05-18T00:00:03.798050+00:00","updated_at":"2026-05-18T00:00:03.798050+00:00"}