{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:M3FJ4ZNGZRZTSDLVQCQKGXZGPB","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"810fea7b08eea92d7f0c461b69b9b6c39c20086c9e17fa5a789ac1ac44a6d8a0","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2019-11-20T23:49:09Z","title_canon_sha256":"47c7a9bc0aedbd80d6f3ef9fdde98014c2da616de1b720408eec6572e47fc193"},"schema_version":"1.0","source":{"id":"1911.09220","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.09220","created_at":"2026-07-05T01:18:16Z"},{"alias_kind":"arxiv_version","alias_value":"1911.09220v2","created_at":"2026-07-05T01:18:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.09220","created_at":"2026-07-05T01:18:16Z"},{"alias_kind":"pith_short_12","alias_value":"M3FJ4ZNGZRZT","created_at":"2026-07-05T01:18:16Z"},{"alias_kind":"pith_short_16","alias_value":"M3FJ4ZNGZRZTSDLV","created_at":"2026-07-05T01:18:16Z"},{"alias_kind":"pith_short_8","alias_value":"M3FJ4ZNG","created_at":"2026-07-05T01:18:16Z"}],"graph_snapshots":[{"event_id":"sha256:ac53221d155aa0620edc2ac543e218a6154396647faad14106a64b687dcdfb2a","target":"graph","created_at":"2026-07-05T01:18:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1911.09220/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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-","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","cross_cats":["cs.NA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2019-11-20T23:49:09Z","title":"MFEM: a modular finite element methods library"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.09220","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:24c3448e2efbd0217d820370f959bf561b1442f0daa616a79b2a8b885b05c28c","target":"record","created_at":"2026-07-05T01:18:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"810fea7b08eea92d7f0c461b69b9b6c39c20086c9e17fa5a789ac1ac44a6d8a0","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2019-11-20T23:49:09Z","title_canon_sha256":"47c7a9bc0aedbd80d6f3ef9fdde98014c2da616de1b720408eec6572e47fc193"},"schema_version":"1.0","source":{"id":"1911.09220","kind":"arxiv","version":2}},"canonical_sha256":"66ca9e65a6cc73390d7580a0a35f26785ec077a99db8307d9e3d0baabc6524fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66ca9e65a6cc73390d7580a0a35f26785ec077a99db8307d9e3d0baabc6524fc","first_computed_at":"2026-07-05T01:18:16.748660Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:18:16.748660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bptv+MrgGdli+zXVwT/AF3irIoMRj2YEunpCchKBs+FdHuryR8S5eiGMjGGtgQ/zQ9tGkFI19X4Hkmwdo70BCg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:18:16.749141Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.09220","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24c3448e2efbd0217d820370f959bf561b1442f0daa616a79b2a8b885b05c28c","sha256:ac53221d155aa0620edc2ac543e218a6154396647faad14106a64b687dcdfb2a"],"state_sha256":"6eeb70b9bf202ec844be8e8467101d95288ef58be5f144bb24e78c5fcb68de42"}