{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:3XYP43BMWE2PSAEIC226IQSSX6","short_pith_number":"pith:3XYP43BM","schema_version":"1.0","canonical_sha256":"ddf0fe6c2cb134f9008816b5e44252bf84e16fddd9a94d6a76379a1b9158af69","source":{"kind":"arxiv","id":"2109.13406","version":2},"attestation_state":"computed","paper":{"title":"MPLAPACK version 2.0.1 user manual","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.MS","authors_text":"Maho Nakata","submitted_at":"2021-09-28T00:10:44Z","abstract_excerpt":"The MPLAPACK (formerly MPACK) is a multiple-precision version of LAPACK (https://www.netlib.org/lapack/). MPLAPACK version 2.0.1 is based on LAPACK version 3.9.1 and translated from Fortran 90 to C++ using FABLE, a Fortran to C++ source-to-source conversion tool (https://github.com/cctbx/cctbx_project/tree/master/fable/). MPLAPACK version 2.0.1 provides the real and complex version of MPBLAS, and the real and complex versions of MPLAPACK support all LAPACK features: solvers for systems of simultaneous linear equations, least-squares solutions of linear systems of equations, eigenvalue problems"},"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.13406","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MS","submitted_at":"2021-09-28T00:10:44Z","cross_cats_sorted":[],"title_canon_sha256":"32ea96538eb81981a8af3d9bddebf3c79cbfad7f404a7146b9886b7819cfdc2b","abstract_canon_sha256":"7fb058c37f1eeb61cf539f15abbdfd0ceea4d7bc668f78dc427f2866fcad2d5c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:56:12.111767Z","signature_b64":"CxiTJVw44GQOwIH1Cm+Xn2XVdOGEvVGxF6OIRT33JWmXm8ED/eqdYpXa8WyuOhpLfhtm2QxPoAIo4wZqFh8UCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ddf0fe6c2cb134f9008816b5e44252bf84e16fddd9a94d6a76379a1b9158af69","last_reissued_at":"2026-07-05T04:56:12.111379Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:56:12.111379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MPLAPACK version 2.0.1 user manual","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.MS","authors_text":"Maho Nakata","submitted_at":"2021-09-28T00:10:44Z","abstract_excerpt":"The MPLAPACK (formerly MPACK) is a multiple-precision version of LAPACK (https://www.netlib.org/lapack/). MPLAPACK version 2.0.1 is based on LAPACK version 3.9.1 and translated from Fortran 90 to C++ using FABLE, a Fortran to C++ source-to-source conversion tool (https://github.com/cctbx/cctbx_project/tree/master/fable/). MPLAPACK version 2.0.1 provides the real and complex version of MPBLAS, and the real and complex versions of MPLAPACK support all LAPACK features: solvers for systems of simultaneous linear equations, least-squares solutions of linear systems of equations, eigenvalue problems"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.13406","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/2109.13406/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.13406","created_at":"2026-07-05T04:56:12.111435+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.13406v2","created_at":"2026-07-05T04:56:12.111435+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.13406","created_at":"2026-07-05T04:56:12.111435+00:00"},{"alias_kind":"pith_short_12","alias_value":"3XYP43BMWE2P","created_at":"2026-07-05T04:56:12.111435+00:00"},{"alias_kind":"pith_short_16","alias_value":"3XYP43BMWE2PSAEI","created_at":"2026-07-05T04:56:12.111435+00:00"},{"alias_kind":"pith_short_8","alias_value":"3XYP43BM","created_at":"2026-07-05T04:56:12.111435+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.06881","citing_title":"Multiple Double Arithmetic on NVIDIA Tensor Cores","ref_index":9,"is_internal_anchor":true},{"citing_arxiv_id":"2506.22546","citing_title":"Primal S-matrix bootstrap with dispersion relations","ref_index":78,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3XYP43BMWE2PSAEIC226IQSSX6","json":"https://pith.science/pith/3XYP43BMWE2PSAEIC226IQSSX6.json","graph_json":"https://pith.science/api/pith-number/3XYP43BMWE2PSAEIC226IQSSX6/graph.json","events_json":"https://pith.science/api/pith-number/3XYP43BMWE2PSAEIC226IQSSX6/events.json","paper":"https://pith.science/paper/3XYP43BM"},"agent_actions":{"view_html":"https://pith.science/pith/3XYP43BMWE2PSAEIC226IQSSX6","download_json":"https://pith.science/pith/3XYP43BMWE2PSAEIC226IQSSX6.json","view_paper":"https://pith.science/paper/3XYP43BM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.13406&json=true","fetch_graph":"https://pith.science/api/pith-number/3XYP43BMWE2PSAEIC226IQSSX6/graph.json","fetch_events":"https://pith.science/api/pith-number/3XYP43BMWE2PSAEIC226IQSSX6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3XYP43BMWE2PSAEIC226IQSSX6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3XYP43BMWE2PSAEIC226IQSSX6/action/storage_attestation","attest_author":"https://pith.science/pith/3XYP43BMWE2PSAEIC226IQSSX6/action/author_attestation","sign_citation":"https://pith.science/pith/3XYP43BMWE2PSAEIC226IQSSX6/action/citation_signature","submit_replication":"https://pith.science/pith/3XYP43BMWE2PSAEIC226IQSSX6/action/replication_record"}},"created_at":"2026-07-05T04:56:12.111435+00:00","updated_at":"2026-07-05T04:56:12.111435+00:00"}