{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:654NK3GOYZTAG5K66R3JYEWLCS","short_pith_number":"pith:654NK3GO","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"},"canonical_sha256":"f778d56ccec66603755ef4769c12cb14ad35d1b64892ccf93561e5538a9e8e29","source":{"kind":"arxiv","id":"1801.09622","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.09622","created_at":"2026-05-18T00:24:56Z"},{"alias_kind":"arxiv_version","alias_value":"1801.09622v1","created_at":"2026-05-18T00:24:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.09622","created_at":"2026-05-18T00:24:56Z"},{"alias_kind":"pith_short_12","alias_value":"654NK3GOYZTA","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"654NK3GOYZTAG5K6","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"654NK3GO","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:654NK3GOYZTAG5K66R3JYEWLCS","target":"record","payload":{"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"},"canonical_sha256":"f778d56ccec66603755ef4769c12cb14ad35d1b64892ccf93561e5538a9e8e29","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"},"source_kind":"arxiv","source_id":"1801.09622","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-18T00:24:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gg6LKCsN2x5gV+NChHQ3CHx4V9wc+YAFZSZRuDGaKZOSpsTBHTbi9bxTI8B0l0T42093Vtn7h3kO5MKr76PxBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:29:09.010645Z"},"content_sha256":"68661056ee66e1f345f0ae03900f96506a98cb14659e512c695148c682153c23","schema_version":"1.0","event_id":"sha256:68661056ee66e1f345f0ae03900f96506a98cb14659e512c695148c682153c23"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:654NK3GOYZTAG5K66R3JYEWLCS","target":"graph","payload":{"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"},"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-18T00:24:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oYrQkKFCeKfR3jzQyf8sZ+vGQfAITUBXHI3M+7HZGZOV2agOZLPfhUMfu3Tdr5gBbRYHeAW8TpHs+pGkG0pvCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:29:09.011197Z"},"content_sha256":"033648675d5b3cdee490646be2dc8438c5bee30d2e9e3c397c5b8f936412381d","schema_version":"1.0","event_id":"sha256:033648675d5b3cdee490646be2dc8438c5bee30d2e9e3c397c5b8f936412381d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/654NK3GOYZTAG5K66R3JYEWLCS/bundle.json","state_url":"https://pith.science/pith/654NK3GOYZTAG5K66R3JYEWLCS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/654NK3GOYZTAG5K66R3JYEWLCS/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-28T20:29:09Z","links":{"resolver":"https://pith.science/pith/654NK3GOYZTAG5K66R3JYEWLCS","bundle":"https://pith.science/pith/654NK3GOYZTAG5K66R3JYEWLCS/bundle.json","state":"https://pith.science/pith/654NK3GOYZTAG5K66R3JYEWLCS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/654NK3GOYZTAG5K66R3JYEWLCS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:654NK3GOYZTAG5K66R3JYEWLCS","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":"db4c6dd5f319262c1805e1292d78effdde3030e244202b3b6a47b16cc09962b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-01-29T16:54:00Z","title_canon_sha256":"52ca21b9329e21741ee686e0346576163ccfcc19da6b8b8f88000718d58ac20a"},"schema_version":"1.0","source":{"id":"1801.09622","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.09622","created_at":"2026-05-18T00:24:56Z"},{"alias_kind":"arxiv_version","alias_value":"1801.09622v1","created_at":"2026-05-18T00:24:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.09622","created_at":"2026-05-18T00:24:56Z"},{"alias_kind":"pith_short_12","alias_value":"654NK3GOYZTA","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"654NK3GOYZTAG5K6","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"654NK3GO","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:033648675d5b3cdee490646be2dc8438c5bee30d2e9e3c397c5b8f936412381d","target":"graph","created_at":"2026-05-18T00:24:56Z","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 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.","authors_text":"Thomas F\\\"uhrer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-01-29T16:54:00Z","title":"First-Order Least-Squares Method for the Obstacle Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.09622","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:68661056ee66e1f345f0ae03900f96506a98cb14659e512c695148c682153c23","target":"record","created_at":"2026-05-18T00:24:56Z","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":"db4c6dd5f319262c1805e1292d78effdde3030e244202b3b6a47b16cc09962b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-01-29T16:54:00Z","title_canon_sha256":"52ca21b9329e21741ee686e0346576163ccfcc19da6b8b8f88000718d58ac20a"},"schema_version":"1.0","source":{"id":"1801.09622","kind":"arxiv","version":1}},"canonical_sha256":"f778d56ccec66603755ef4769c12cb14ad35d1b64892ccf93561e5538a9e8e29","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f778d56ccec66603755ef4769c12cb14ad35d1b64892ccf93561e5538a9e8e29","first_computed_at":"2026-05-18T00:24:56.890691Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:56.890691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DUgFs0dgQrOZRu4R0wi+LBPMYs2Of3BSnZBY7liYs3nxdy7bNqWRBp0hYInOHt8qYBEOQWLbeYSx/wU9idhTAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:56.891175Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.09622","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68661056ee66e1f345f0ae03900f96506a98cb14659e512c695148c682153c23","sha256:033648675d5b3cdee490646be2dc8438c5bee30d2e9e3c397c5b8f936412381d"],"state_sha256":"35957ca31b1617bfca3913dacff21f8bbe2a47fb53d396e8e0c1556e66c7d38f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zr7g5BUO40bqhWSXM/kIxUoJ1pUsyfmz4W2WPFbljUo0Lt18jAwAhHUs8/apP1lc6Dvv3wnkiRA4MCQla7XECQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:29:09.014205Z","bundle_sha256":"82eccf7bb733d04fdeb052e0fb2751afcca4cc8df6e2fcf1a9075d13387a24b0"}}