{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:M3FJ4ZNGZRZTSDLVQCQKGXZGPB","short_pith_number":"pith:M3FJ4ZNG","schema_version":"1.0","canonical_sha256":"66ca9e65a6cc73390d7580a0a35f26785ec077a99db8307d9e3d0baabc6524fc","source":{"kind":"arxiv","id":"1911.09220","version":2},"attestation_state":"computed","paper":{"title":"MFEM: a modular finite element methods library","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.MS","authors_text":"Aaron Fisher, Andrew Barker, David Medina, Jakub Cerveny, Jamie Bramwell, Jean-Sylvain Camier, Johann Dahm, Julian Andrej, Mark Stowell, Robert Anderson, Stefano Zampini, Tzanio Kolev, Veselin Dobrev, Vladimir Tomov, Will Pazner, Yohann Dudouit","submitted_at":"2019-11-20T23:49:09Z","abstract_excerpt":"MFEM is an open-source, lightweight, flexible and scalable C++ library for modular finite element methods that features arbitrary high-order finite element meshes and spaces, support for a wide variety of discretization approaches and emphasis on usability, portability, and high-performance computing efficiency. MFEM's goal is to provide application scientists with access to cutting-edge algorithms for high-order finite element meshing, discretizations and linear solvers, while enabling researchers to quickly and easily develop and test new algorithms in very general, fully unstructured, high-"},"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":"1911.09220","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2019-11-20T23:49:09Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"47c7a9bc0aedbd80d6f3ef9fdde98014c2da616de1b720408eec6572e47fc193","abstract_canon_sha256":"810fea7b08eea92d7f0c461b69b9b6c39c20086c9e17fa5a789ac1ac44a6d8a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:18:16.749141Z","signature_b64":"bptv+MrgGdli+zXVwT/AF3irIoMRj2YEunpCchKBs+FdHuryR8S5eiGMjGGtgQ/zQ9tGkFI19X4Hkmwdo70BCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66ca9e65a6cc73390d7580a0a35f26785ec077a99db8307d9e3d0baabc6524fc","last_reissued_at":"2026-07-05T01:18:16.748660Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:18:16.748660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MFEM: a modular finite element methods library","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.MS","authors_text":"Aaron Fisher, Andrew Barker, David Medina, Jakub Cerveny, Jamie Bramwell, Jean-Sylvain Camier, Johann Dahm, Julian Andrej, Mark Stowell, Robert Anderson, Stefano Zampini, Tzanio Kolev, Veselin Dobrev, Vladimir Tomov, Will Pazner, Yohann Dudouit","submitted_at":"2019-11-20T23:49:09Z","abstract_excerpt":"MFEM is an open-source, lightweight, flexible and scalable C++ library for modular finite element methods that features arbitrary high-order finite element meshes and spaces, support for a wide variety of discretization approaches and emphasis on usability, portability, and high-performance computing efficiency. MFEM's goal is to provide application scientists with access to cutting-edge algorithms for high-order finite element meshing, discretizations and linear solvers, while enabling researchers to quickly and easily develop and test new algorithms in very general, fully unstructured, high-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.09220","kind":"arxiv","version":2},"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/1911.09220/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":"1911.09220","created_at":"2026-07-05T01:18:16.748720+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.09220v2","created_at":"2026-07-05T01:18:16.748720+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.09220","created_at":"2026-07-05T01:18:16.748720+00:00"},{"alias_kind":"pith_short_12","alias_value":"M3FJ4ZNGZRZT","created_at":"2026-07-05T01:18:16.748720+00:00"},{"alias_kind":"pith_short_16","alias_value":"M3FJ4ZNGZRZTSDLV","created_at":"2026-07-05T01:18:16.748720+00:00"},{"alias_kind":"pith_short_8","alias_value":"M3FJ4ZNG","created_at":"2026-07-05T01:18:16.748720+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/M3FJ4ZNGZRZTSDLVQCQKGXZGPB","json":"https://pith.science/pith/M3FJ4ZNGZRZTSDLVQCQKGXZGPB.json","graph_json":"https://pith.science/api/pith-number/M3FJ4ZNGZRZTSDLVQCQKGXZGPB/graph.json","events_json":"https://pith.science/api/pith-number/M3FJ4ZNGZRZTSDLVQCQKGXZGPB/events.json","paper":"https://pith.science/paper/M3FJ4ZNG"},"agent_actions":{"view_html":"https://pith.science/pith/M3FJ4ZNGZRZTSDLVQCQKGXZGPB","download_json":"https://pith.science/pith/M3FJ4ZNGZRZTSDLVQCQKGXZGPB.json","view_paper":"https://pith.science/paper/M3FJ4ZNG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.09220&json=true","fetch_graph":"https://pith.science/api/pith-number/M3FJ4ZNGZRZTSDLVQCQKGXZGPB/graph.json","fetch_events":"https://pith.science/api/pith-number/M3FJ4ZNGZRZTSDLVQCQKGXZGPB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M3FJ4ZNGZRZTSDLVQCQKGXZGPB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M3FJ4ZNGZRZTSDLVQCQKGXZGPB/action/storage_attestation","attest_author":"https://pith.science/pith/M3FJ4ZNGZRZTSDLVQCQKGXZGPB/action/author_attestation","sign_citation":"https://pith.science/pith/M3FJ4ZNGZRZTSDLVQCQKGXZGPB/action/citation_signature","submit_replication":"https://pith.science/pith/M3FJ4ZNGZRZTSDLVQCQKGXZGPB/action/replication_record"}},"created_at":"2026-07-05T01:18:16.748720+00:00","updated_at":"2026-07-05T01:18:16.748720+00:00"}