{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:N6F4GI7CRZIFXGRAPIWA63WK3Q","short_pith_number":"pith:N6F4GI7C","schema_version":"1.0","canonical_sha256":"6f8bc323e28e505b9a207a2c0f6ecadc1df29af105db490d17b24eb03e6a4d91","source":{"kind":"arxiv","id":"2109.04996","version":1},"attestation_state":"computed","paper":{"title":"Efficient Exascale Discretizations: High-Order Finite Element Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","cs.NA","math.NA"],"primary_cat":"cs.DC","authors_text":"Ahmad Abdelfattah, Aleksandr Obabko, Ali Karakus, Ananias Tomboulides, Cameron W. Smith, David Medina, Elia Merzari, Ian Karlin, Jack Dongarra, Jean-Sylvain Camier, Jed Brown, Jeremy Thompson, Kasia Swirydowicz, Lukas Spies, Mark S. Shephard, Misun Min, Natalie Beams, Noel Chalmers, Paul Fischer, Stanimire Tomov, Stefan Kerkemeier, Thilina Rathnayake, Tim Warburton, Tzanio Kolev, Valeria Barra, Veselin Dobrev, Vladimir Tomov, Will Pazner, Yohann Dudouit, Yu-Hsiang Lan","submitted_at":"2021-09-10T17:07:48Z","abstract_excerpt":"Efficient exploitation of exascale architectures requires rethinking of the numerical algorithms used in many large-scale applications. These architectures favor algorithms that expose ultra fine-grain parallelism and maximize the ratio of floating point operations to energy intensive data movement. One of the few viable approaches to achieve high efficiency in the area of PDE discretizations on unstructured grids is to use matrix-free/partially-assembled high-order finite element methods, since these methods can increase the accuracy and/or lower the computational time due to reduced data mot"},"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":"2109.04996","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2021-09-10T17:07:48Z","cross_cats_sorted":["cs.MS","cs.NA","math.NA"],"title_canon_sha256":"b47d7441ac1c2437d7bc461aae88846d1d9a961b7fb300c41a96da50be0df387","abstract_canon_sha256":"176c583979ba599e7192dd70818ca7fc167b1c12aa737996faa5d0f665e182c5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:13:18.188824Z","signature_b64":"FMWgOTjSflfPIDnCiGiIrBtNX1wJSqay54eTxDtCEukWMFO8u3ilZ8BAyZicA5yaev+BZ/M4ooVdRqzIIDmcBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f8bc323e28e505b9a207a2c0f6ecadc1df29af105db490d17b24eb03e6a4d91","last_reissued_at":"2026-07-05T03:13:18.188359Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:13:18.188359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Exascale Discretizations: High-Order Finite Element Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","cs.NA","math.NA"],"primary_cat":"cs.DC","authors_text":"Ahmad Abdelfattah, Aleksandr Obabko, Ali Karakus, Ananias Tomboulides, Cameron W. Smith, David Medina, Elia Merzari, Ian Karlin, Jack Dongarra, Jean-Sylvain Camier, Jed Brown, Jeremy Thompson, Kasia Swirydowicz, Lukas Spies, Mark S. Shephard, Misun Min, Natalie Beams, Noel Chalmers, Paul Fischer, Stanimire Tomov, Stefan Kerkemeier, Thilina Rathnayake, Tim Warburton, Tzanio Kolev, Valeria Barra, Veselin Dobrev, Vladimir Tomov, Will Pazner, Yohann Dudouit, Yu-Hsiang Lan","submitted_at":"2021-09-10T17:07:48Z","abstract_excerpt":"Efficient exploitation of exascale architectures requires rethinking of the numerical algorithms used in many large-scale applications. These architectures favor algorithms that expose ultra fine-grain parallelism and maximize the ratio of floating point operations to energy intensive data movement. One of the few viable approaches to achieve high efficiency in the area of PDE discretizations on unstructured grids is to use matrix-free/partially-assembled high-order finite element methods, since these methods can increase the accuracy and/or lower the computational time due to reduced data mot"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.04996","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2109.04996/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2109.04996","created_at":"2026-07-05T03:13:18.188418+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.04996v1","created_at":"2026-07-05T03:13:18.188418+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.04996","created_at":"2026-07-05T03:13:18.188418+00:00"},{"alias_kind":"pith_short_12","alias_value":"N6F4GI7CRZIF","created_at":"2026-07-05T03:13:18.188418+00:00"},{"alias_kind":"pith_short_16","alias_value":"N6F4GI7CRZIFXGRA","created_at":"2026-07-05T03:13:18.188418+00:00"},{"alias_kind":"pith_short_8","alias_value":"N6F4GI7C","created_at":"2026-07-05T03:13:18.188418+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/N6F4GI7CRZIFXGRAPIWA63WK3Q","json":"https://pith.science/pith/N6F4GI7CRZIFXGRAPIWA63WK3Q.json","graph_json":"https://pith.science/api/pith-number/N6F4GI7CRZIFXGRAPIWA63WK3Q/graph.json","events_json":"https://pith.science/api/pith-number/N6F4GI7CRZIFXGRAPIWA63WK3Q/events.json","paper":"https://pith.science/paper/N6F4GI7C"},"agent_actions":{"view_html":"https://pith.science/pith/N6F4GI7CRZIFXGRAPIWA63WK3Q","download_json":"https://pith.science/pith/N6F4GI7CRZIFXGRAPIWA63WK3Q.json","view_paper":"https://pith.science/paper/N6F4GI7C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.04996&json=true","fetch_graph":"https://pith.science/api/pith-number/N6F4GI7CRZIFXGRAPIWA63WK3Q/graph.json","fetch_events":"https://pith.science/api/pith-number/N6F4GI7CRZIFXGRAPIWA63WK3Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N6F4GI7CRZIFXGRAPIWA63WK3Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N6F4GI7CRZIFXGRAPIWA63WK3Q/action/storage_attestation","attest_author":"https://pith.science/pith/N6F4GI7CRZIFXGRAPIWA63WK3Q/action/author_attestation","sign_citation":"https://pith.science/pith/N6F4GI7CRZIFXGRAPIWA63WK3Q/action/citation_signature","submit_replication":"https://pith.science/pith/N6F4GI7CRZIFXGRAPIWA63WK3Q/action/replication_record"}},"created_at":"2026-07-05T03:13:18.188418+00:00","updated_at":"2026-07-05T03:13:18.188418+00:00"}