{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:RPCHPM4VMKRDZJUN6BHL5WTJEA","short_pith_number":"pith:RPCHPM4V","schema_version":"1.0","canonical_sha256":"8bc477b39562a23ca68df04ebeda692021a7864fdb7e117bd47e66a64f169bf0","source":{"kind":"arxiv","id":"1503.03996","version":1},"attestation_state":"computed","paper":{"title":"Convergence and Optimality of hp-AFEM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Claudio Canuto, Marco Verani, Ricardo H. Nochetto, Rob Stevenson","submitted_at":"2015-03-13T09:30:01Z","abstract_excerpt":"We design and analyze an adaptive $hp$-finite element method (hp-AFEM) in dimensions $n=1,2$. The algorithm consists of iterating two routines: hp-NEARBEST finds a near-best $hp$-approximation of the current discrete solution and data to a desired accuracy, and REDUCE improves the discrete solution to a finer but comparable accuracy. The former hinges on a recent algorithm by Binev for adaptive $hp$-approximation, and acts as a coarsening step. We prove convergence and instance optimality."},"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":"1503.03996","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-03-13T09:30:01Z","cross_cats_sorted":[],"title_canon_sha256":"1fdfdc0fa52de9d28698ac7c5d997c8d860c08e109269f5451ee1e81867fc1b7","abstract_canon_sha256":"df8b2a772c4892b382ce422484a1eea01f6b5d67cf6341c2b562c661f962f003"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:57.454035Z","signature_b64":"jyEq7VvZsTIemx659I3R/CmMBednvkjqawvMpO+wtPYVW8y0CfD3DrIXgfkJaUITzy7OdO+/gFHlDreG56IKDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bc477b39562a23ca68df04ebeda692021a7864fdb7e117bd47e66a64f169bf0","last_reissued_at":"2026-05-18T02:23:57.453306Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:57.453306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convergence and Optimality of hp-AFEM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Claudio Canuto, Marco Verani, Ricardo H. Nochetto, Rob Stevenson","submitted_at":"2015-03-13T09:30:01Z","abstract_excerpt":"We design and analyze an adaptive $hp$-finite element method (hp-AFEM) in dimensions $n=1,2$. The algorithm consists of iterating two routines: hp-NEARBEST finds a near-best $hp$-approximation of the current discrete solution and data to a desired accuracy, and REDUCE improves the discrete solution to a finer but comparable accuracy. The former hinges on a recent algorithm by Binev for adaptive $hp$-approximation, and acts as a coarsening step. We prove convergence and instance optimality."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.03996","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":"1503.03996","created_at":"2026-05-18T02:23:57.453448+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.03996v1","created_at":"2026-05-18T02:23:57.453448+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.03996","created_at":"2026-05-18T02:23:57.453448+00:00"},{"alias_kind":"pith_short_12","alias_value":"RPCHPM4VMKRD","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"RPCHPM4VMKRDZJUN","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"RPCHPM4V","created_at":"2026-05-18T12:29:39.896362+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/RPCHPM4VMKRDZJUN6BHL5WTJEA","json":"https://pith.science/pith/RPCHPM4VMKRDZJUN6BHL5WTJEA.json","graph_json":"https://pith.science/api/pith-number/RPCHPM4VMKRDZJUN6BHL5WTJEA/graph.json","events_json":"https://pith.science/api/pith-number/RPCHPM4VMKRDZJUN6BHL5WTJEA/events.json","paper":"https://pith.science/paper/RPCHPM4V"},"agent_actions":{"view_html":"https://pith.science/pith/RPCHPM4VMKRDZJUN6BHL5WTJEA","download_json":"https://pith.science/pith/RPCHPM4VMKRDZJUN6BHL5WTJEA.json","view_paper":"https://pith.science/paper/RPCHPM4V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.03996&json=true","fetch_graph":"https://pith.science/api/pith-number/RPCHPM4VMKRDZJUN6BHL5WTJEA/graph.json","fetch_events":"https://pith.science/api/pith-number/RPCHPM4VMKRDZJUN6BHL5WTJEA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RPCHPM4VMKRDZJUN6BHL5WTJEA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RPCHPM4VMKRDZJUN6BHL5WTJEA/action/storage_attestation","attest_author":"https://pith.science/pith/RPCHPM4VMKRDZJUN6BHL5WTJEA/action/author_attestation","sign_citation":"https://pith.science/pith/RPCHPM4VMKRDZJUN6BHL5WTJEA/action/citation_signature","submit_replication":"https://pith.science/pith/RPCHPM4VMKRDZJUN6BHL5WTJEA/action/replication_record"}},"created_at":"2026-05-18T02:23:57.453448+00:00","updated_at":"2026-05-18T02:23:57.453448+00:00"}