{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GGE5PETSKZ2KTGXQDECN3BFQUI","short_pith_number":"pith:GGE5PETS","schema_version":"1.0","canonical_sha256":"3189d792725674a99af01904dd84b0a222bd16380ad432d1f16527af2a923c8c","source":{"kind":"arxiv","id":"1804.07017","version":1},"attestation_state":"computed","paper":{"title":"Programming Parallel Dense Matrix Factorizations with Look-Ahead and OpenMP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"cs.DC","authors_text":"Adri\\'an Castell\\'o, Enrique S. Quintana-Ort\\'i, Francisco D. Igual, Rafael Rodr\\'iguez-S\\'anchez, Sandra Catal\\'an","submitted_at":"2018-04-19T07:14:36Z","abstract_excerpt":"We investigate a parallelization strategy for dense matrix factorization (DMF) algorithms, using OpenMP, that departs from the legacy (or conventional) solution, which simply extracts concurrency from a multithreaded version of BLAS. This approach is also different from the more sophisticated runtime-assisted implementations, which decompose the operation into tasks and identify dependencies via directives and runtime support. Instead, our strategy attains high performance by explicitly embedding a static look-ahead technique into the DMF code, in order to overcome the performance bottleneck o"},"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":"1804.07017","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-19T07:14:36Z","cross_cats_sorted":["cs.MS"],"title_canon_sha256":"528f7cca1b9dfe7e053b039fc3441fc1253a31d71182bbd70c603ad4b96d7910","abstract_canon_sha256":"4cd7e29d82b13f949197a3d07727602ffda68c2b1ef7caa38424a5a0c9d1b82b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:04.574555Z","signature_b64":"uH0thsUIpac2q8ceK6Zq5+5PN1RuH4cMAUR5iHDe0kAHKZDH9e64xokFI1EYqbig8zm/R2KTpJBBylDk/DKuAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3189d792725674a99af01904dd84b0a222bd16380ad432d1f16527af2a923c8c","last_reissued_at":"2026-05-18T00:18:04.573959Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:04.573959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Programming Parallel Dense Matrix Factorizations with Look-Ahead and OpenMP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"cs.DC","authors_text":"Adri\\'an Castell\\'o, Enrique S. Quintana-Ort\\'i, Francisco D. Igual, Rafael Rodr\\'iguez-S\\'anchez, Sandra Catal\\'an","submitted_at":"2018-04-19T07:14:36Z","abstract_excerpt":"We investigate a parallelization strategy for dense matrix factorization (DMF) algorithms, using OpenMP, that departs from the legacy (or conventional) solution, which simply extracts concurrency from a multithreaded version of BLAS. This approach is also different from the more sophisticated runtime-assisted implementations, which decompose the operation into tasks and identify dependencies via directives and runtime support. Instead, our strategy attains high performance by explicitly embedding a static look-ahead technique into the DMF code, in order to overcome the performance bottleneck o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.07017","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":""},"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":"1804.07017","created_at":"2026-05-18T00:18:04.574053+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.07017v1","created_at":"2026-05-18T00:18:04.574053+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07017","created_at":"2026-05-18T00:18:04.574053+00:00"},{"alias_kind":"pith_short_12","alias_value":"GGE5PETSKZ2K","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GGE5PETSKZ2KTGXQ","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GGE5PETS","created_at":"2026-05-18T12:32:25.280505+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/GGE5PETSKZ2KTGXQDECN3BFQUI","json":"https://pith.science/pith/GGE5PETSKZ2KTGXQDECN3BFQUI.json","graph_json":"https://pith.science/api/pith-number/GGE5PETSKZ2KTGXQDECN3BFQUI/graph.json","events_json":"https://pith.science/api/pith-number/GGE5PETSKZ2KTGXQDECN3BFQUI/events.json","paper":"https://pith.science/paper/GGE5PETS"},"agent_actions":{"view_html":"https://pith.science/pith/GGE5PETSKZ2KTGXQDECN3BFQUI","download_json":"https://pith.science/pith/GGE5PETSKZ2KTGXQDECN3BFQUI.json","view_paper":"https://pith.science/paper/GGE5PETS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.07017&json=true","fetch_graph":"https://pith.science/api/pith-number/GGE5PETSKZ2KTGXQDECN3BFQUI/graph.json","fetch_events":"https://pith.science/api/pith-number/GGE5PETSKZ2KTGXQDECN3BFQUI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GGE5PETSKZ2KTGXQDECN3BFQUI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GGE5PETSKZ2KTGXQDECN3BFQUI/action/storage_attestation","attest_author":"https://pith.science/pith/GGE5PETSKZ2KTGXQDECN3BFQUI/action/author_attestation","sign_citation":"https://pith.science/pith/GGE5PETSKZ2KTGXQDECN3BFQUI/action/citation_signature","submit_replication":"https://pith.science/pith/GGE5PETSKZ2KTGXQDECN3BFQUI/action/replication_record"}},"created_at":"2026-05-18T00:18:04.574053+00:00","updated_at":"2026-05-18T00:18:04.574053+00:00"}