{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:654NK3GOYZTAG5K66R3JYEWLCS","short_pith_number":"pith:654NK3GO","schema_version":"1.0","canonical_sha256":"f778d56ccec66603755ef4769c12cb14ad35d1b64892ccf93561e5538a9e8e29","source":{"kind":"arxiv","id":"1801.09622","version":1},"attestation_state":"computed","paper":{"title":"First-Order Least-Squares Method for the Obstacle Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Thomas F\\\"uhrer","submitted_at":"2018-01-29T16:54:00Z","abstract_excerpt":"We define and analyse a least-squares finite element method for a first-order reformulation of the obstacle problem. Moreover, we derive variational inequalities that are based on similar but non-symmetric bilinear forms. A priori error estimates including the case of non-conforming convex sets are given and optimal convergence rates are shown for the lowest-order case. We provide also a posteriori bounds that can be be used as error indicators in an adaptive algorithm. Numerical studies are presented."},"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":"1801.09622","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-01-29T16:54:00Z","cross_cats_sorted":[],"title_canon_sha256":"52ca21b9329e21741ee686e0346576163ccfcc19da6b8b8f88000718d58ac20a","abstract_canon_sha256":"db4c6dd5f319262c1805e1292d78effdde3030e244202b3b6a47b16cc09962b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:56.891175Z","signature_b64":"DUgFs0dgQrOZRu4R0wi+LBPMYs2Of3BSnZBY7liYs3nxdy7bNqWRBp0hYInOHt8qYBEOQWLbeYSx/wU9idhTAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f778d56ccec66603755ef4769c12cb14ad35d1b64892ccf93561e5538a9e8e29","last_reissued_at":"2026-05-18T00:24:56.890691Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:56.890691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"First-Order Least-Squares Method for the Obstacle Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Thomas F\\\"uhrer","submitted_at":"2018-01-29T16:54:00Z","abstract_excerpt":"We define and analyse a least-squares finite element method for a first-order reformulation of the obstacle problem. Moreover, we derive variational inequalities that are based on similar but non-symmetric bilinear forms. A priori error estimates including the case of non-conforming convex sets are given and optimal convergence rates are shown for the lowest-order case. We provide also a posteriori bounds that can be be used as error indicators in an adaptive algorithm. Numerical studies are presented."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.09622","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":"1801.09622","created_at":"2026-05-18T00:24:56.890768+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.09622v1","created_at":"2026-05-18T00:24:56.890768+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.09622","created_at":"2026-05-18T00:24:56.890768+00:00"},{"alias_kind":"pith_short_12","alias_value":"654NK3GOYZTA","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"654NK3GOYZTAG5K6","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"654NK3GO","created_at":"2026-05-18T12:32:08.215937+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/654NK3GOYZTAG5K66R3JYEWLCS","json":"https://pith.science/pith/654NK3GOYZTAG5K66R3JYEWLCS.json","graph_json":"https://pith.science/api/pith-number/654NK3GOYZTAG5K66R3JYEWLCS/graph.json","events_json":"https://pith.science/api/pith-number/654NK3GOYZTAG5K66R3JYEWLCS/events.json","paper":"https://pith.science/paper/654NK3GO"},"agent_actions":{"view_html":"https://pith.science/pith/654NK3GOYZTAG5K66R3JYEWLCS","download_json":"https://pith.science/pith/654NK3GOYZTAG5K66R3JYEWLCS.json","view_paper":"https://pith.science/paper/654NK3GO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.09622&json=true","fetch_graph":"https://pith.science/api/pith-number/654NK3GOYZTAG5K66R3JYEWLCS/graph.json","fetch_events":"https://pith.science/api/pith-number/654NK3GOYZTAG5K66R3JYEWLCS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/654NK3GOYZTAG5K66R3JYEWLCS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/654NK3GOYZTAG5K66R3JYEWLCS/action/storage_attestation","attest_author":"https://pith.science/pith/654NK3GOYZTAG5K66R3JYEWLCS/action/author_attestation","sign_citation":"https://pith.science/pith/654NK3GOYZTAG5K66R3JYEWLCS/action/citation_signature","submit_replication":"https://pith.science/pith/654NK3GOYZTAG5K66R3JYEWLCS/action/replication_record"}},"created_at":"2026-05-18T00:24:56.890768+00:00","updated_at":"2026-05-18T00:24:56.890768+00:00"}