{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:CKEKOEYVIS4EOT2CBSVNOCLCP7","short_pith_number":"pith:CKEKOEYV","schema_version":"1.0","canonical_sha256":"1288a7131544b8474f420caad709627fc7b6b62759dd99c1ba0805c2f80326fa","source":{"kind":"arxiv","id":"1311.3930","version":1},"attestation_state":"computed","paper":{"title":"An adaptive finite element method for the infinity Laplacian","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.AP","nlin.AO"],"primary_cat":"math.NA","authors_text":"Omar Lakkis, Tristan Pryer","submitted_at":"2013-11-15T17:27:29Z","abstract_excerpt":"We construct a finite element method (FEM) for the infinity Laplacian. Solutions of this problem may be singular, which has prompted us to conduct an a posteriori analysis of the method deriving residual based estimators to drive an adaptive algorithm. It is numerically shown that the optimal convergence rates are regained upon using the adaptive procedure."},"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":"1311.3930","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.NA","submitted_at":"2013-11-15T17:27:29Z","cross_cats_sorted":["math.AP","nlin.AO"],"title_canon_sha256":"f93e6ca2584a796f16676220385753addf0192873e087da7c054f170eb9388b8","abstract_canon_sha256":"1bbd18523ba5300bb031bffc514348e19bc9267b8248f2dbad85b9dfe74ae66a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:29.344075Z","signature_b64":"hdDrOkWShL+SVbN57g8tdsOC4xxroHvOpIbFkvPNbjn3mw+EQmBquXTm4/G6qaXtscbT92yHdFTumiApYLFLDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1288a7131544b8474f420caad709627fc7b6b62759dd99c1ba0805c2f80326fa","last_reissued_at":"2026-05-18T00:44:29.343573Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:29.343573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An adaptive finite element method for the infinity Laplacian","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.AP","nlin.AO"],"primary_cat":"math.NA","authors_text":"Omar Lakkis, Tristan Pryer","submitted_at":"2013-11-15T17:27:29Z","abstract_excerpt":"We construct a finite element method (FEM) for the infinity Laplacian. Solutions of this problem may be singular, which has prompted us to conduct an a posteriori analysis of the method deriving residual based estimators to drive an adaptive algorithm. It is numerically shown that the optimal convergence rates are regained upon using the adaptive procedure."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3930","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":"1311.3930","created_at":"2026-05-18T00:44:29.343640+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.3930v1","created_at":"2026-05-18T00:44:29.343640+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3930","created_at":"2026-05-18T00:44:29.343640+00:00"},{"alias_kind":"pith_short_12","alias_value":"CKEKOEYVIS4E","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"CKEKOEYVIS4EOT2C","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"CKEKOEYV","created_at":"2026-05-18T12:27:40.988391+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/CKEKOEYVIS4EOT2CBSVNOCLCP7","json":"https://pith.science/pith/CKEKOEYVIS4EOT2CBSVNOCLCP7.json","graph_json":"https://pith.science/api/pith-number/CKEKOEYVIS4EOT2CBSVNOCLCP7/graph.json","events_json":"https://pith.science/api/pith-number/CKEKOEYVIS4EOT2CBSVNOCLCP7/events.json","paper":"https://pith.science/paper/CKEKOEYV"},"agent_actions":{"view_html":"https://pith.science/pith/CKEKOEYVIS4EOT2CBSVNOCLCP7","download_json":"https://pith.science/pith/CKEKOEYVIS4EOT2CBSVNOCLCP7.json","view_paper":"https://pith.science/paper/CKEKOEYV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.3930&json=true","fetch_graph":"https://pith.science/api/pith-number/CKEKOEYVIS4EOT2CBSVNOCLCP7/graph.json","fetch_events":"https://pith.science/api/pith-number/CKEKOEYVIS4EOT2CBSVNOCLCP7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CKEKOEYVIS4EOT2CBSVNOCLCP7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CKEKOEYVIS4EOT2CBSVNOCLCP7/action/storage_attestation","attest_author":"https://pith.science/pith/CKEKOEYVIS4EOT2CBSVNOCLCP7/action/author_attestation","sign_citation":"https://pith.science/pith/CKEKOEYVIS4EOT2CBSVNOCLCP7/action/citation_signature","submit_replication":"https://pith.science/pith/CKEKOEYVIS4EOT2CBSVNOCLCP7/action/replication_record"}},"created_at":"2026-05-18T00:44:29.343640+00:00","updated_at":"2026-05-18T00:44:29.343640+00:00"}