{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:GAZDHA25I6SEUPAXDKVFPII55H","short_pith_number":"pith:GAZDHA25","schema_version":"1.0","canonical_sha256":"303233835d47a44a3c171aaa57a11de9c6387a0d69aebf888cf8bd7d9c975553","source":{"kind":"arxiv","id":"2210.12253","version":1},"attestation_state":"computed","paper":{"title":"End-to-end GPU acceleration of low-order-refined preconditioning for high-order finite element discretizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.MS","authors_text":"Jean-Sylvain Camier, Tzanio Kolev, Will Pazner","submitted_at":"2022-10-21T21:12:57Z","abstract_excerpt":"In this paper, we present algorithms and implementations for the end-to-end GPU acceleration of matrix-free low-order-refined preconditioning of high-order finite element problems. The methods described here allow for the construction of effective preconditioners for high-order problems with optimal memory usage and computational complexity. The preconditioners are based on the construction of a spectrally equivalent low-order discretization on a refined mesh, which is then amenable to, for example, algebraic multigrid preconditioning. The constants of equivalence are independent of mesh size "},"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":"2210.12253","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2022-10-21T21:12:57Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"aa15ddaaf1b10b887f4a40b39780da5ef38efedd41439f032545af0d6bb7fa56","abstract_canon_sha256":"4b1b956c8b2a53c666a150b36bce848c1e2c043b121c2f09f4bf56b59994a97b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:16:35.363369Z","signature_b64":"Qg3NLMt7DI76H5YS6E+KqIGTbWbARmX1b7okCcJBwcUuMRV3ZKK4a9h96OfLxBYsqKJRfu+4T/eZi33PrQyTAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"303233835d47a44a3c171aaa57a11de9c6387a0d69aebf888cf8bd7d9c975553","last_reissued_at":"2026-07-05T06:16:35.362808Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:16:35.362808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"End-to-end GPU acceleration of low-order-refined preconditioning for high-order finite element discretizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.MS","authors_text":"Jean-Sylvain Camier, Tzanio Kolev, Will Pazner","submitted_at":"2022-10-21T21:12:57Z","abstract_excerpt":"In this paper, we present algorithms and implementations for the end-to-end GPU acceleration of matrix-free low-order-refined preconditioning of high-order finite element problems. The methods described here allow for the construction of effective preconditioners for high-order problems with optimal memory usage and computational complexity. The preconditioners are based on the construction of a spectrally equivalent low-order discretization on a refined mesh, which is then amenable to, for example, algebraic multigrid preconditioning. The constants of equivalence are independent of mesh size "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.12253","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/2210.12253/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":"2210.12253","created_at":"2026-07-05T06:16:35.362873+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.12253v1","created_at":"2026-07-05T06:16:35.362873+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.12253","created_at":"2026-07-05T06:16:35.362873+00:00"},{"alias_kind":"pith_short_12","alias_value":"GAZDHA25I6SE","created_at":"2026-07-05T06:16:35.362873+00:00"},{"alias_kind":"pith_short_16","alias_value":"GAZDHA25I6SEUPAX","created_at":"2026-07-05T06:16:35.362873+00:00"},{"alias_kind":"pith_short_8","alias_value":"GAZDHA25","created_at":"2026-07-05T06:16:35.362873+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/GAZDHA25I6SEUPAXDKVFPII55H","json":"https://pith.science/pith/GAZDHA25I6SEUPAXDKVFPII55H.json","graph_json":"https://pith.science/api/pith-number/GAZDHA25I6SEUPAXDKVFPII55H/graph.json","events_json":"https://pith.science/api/pith-number/GAZDHA25I6SEUPAXDKVFPII55H/events.json","paper":"https://pith.science/paper/GAZDHA25"},"agent_actions":{"view_html":"https://pith.science/pith/GAZDHA25I6SEUPAXDKVFPII55H","download_json":"https://pith.science/pith/GAZDHA25I6SEUPAXDKVFPII55H.json","view_paper":"https://pith.science/paper/GAZDHA25","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.12253&json=true","fetch_graph":"https://pith.science/api/pith-number/GAZDHA25I6SEUPAXDKVFPII55H/graph.json","fetch_events":"https://pith.science/api/pith-number/GAZDHA25I6SEUPAXDKVFPII55H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GAZDHA25I6SEUPAXDKVFPII55H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GAZDHA25I6SEUPAXDKVFPII55H/action/storage_attestation","attest_author":"https://pith.science/pith/GAZDHA25I6SEUPAXDKVFPII55H/action/author_attestation","sign_citation":"https://pith.science/pith/GAZDHA25I6SEUPAXDKVFPII55H/action/citation_signature","submit_replication":"https://pith.science/pith/GAZDHA25I6SEUPAXDKVFPII55H/action/replication_record"}},"created_at":"2026-07-05T06:16:35.362873+00:00","updated_at":"2026-07-05T06:16:35.362873+00:00"}