{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GGE5PETSKZ2KTGXQDECN3BFQUI","short_pith_number":"pith:GGE5PETS","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"},"canonical_sha256":"3189d792725674a99af01904dd84b0a222bd16380ad432d1f16527af2a923c8c","source":{"kind":"arxiv","id":"1804.07017","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.07017","created_at":"2026-05-18T00:18:04Z"},{"alias_kind":"arxiv_version","alias_value":"1804.07017v1","created_at":"2026-05-18T00:18:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07017","created_at":"2026-05-18T00:18:04Z"},{"alias_kind":"pith_short_12","alias_value":"GGE5PETSKZ2K","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GGE5PETSKZ2KTGXQ","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GGE5PETS","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GGE5PETSKZ2KTGXQDECN3BFQUI","target":"record","payload":{"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"},"canonical_sha256":"3189d792725674a99af01904dd84b0a222bd16380ad432d1f16527af2a923c8c","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"},"source_kind":"arxiv","source_id":"1804.07017","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:18:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7mk4Ml3/HTbj/p7xOrIxQjYlCIoGTdhmH/l9UrUMwEZItDWdipvaGvVqtI2Krb7mT2CihS8Dc/fF7Qao9IT9BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:18:34.391047Z"},"content_sha256":"1f94a48c28582a6f50cccfb3bb75677a874cae396009af67026d747384d1d00c","schema_version":"1.0","event_id":"sha256:1f94a48c28582a6f50cccfb3bb75677a874cae396009af67026d747384d1d00c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GGE5PETSKZ2KTGXQDECN3BFQUI","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:18:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1kkGN6e12hWzhfI6a1fz8rZFMgIZeqQYWz/Jlp9xCpir9uA5boe6Bynk+ozOSw4FrOYM9mIQgsE7a4mUXVm5Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:18:34.391480Z"},"content_sha256":"6a099a8aa49c829cf2dfc32ee0e90cfd8467f729f2550b129f8dcb3d9a6ed8b9","schema_version":"1.0","event_id":"sha256:6a099a8aa49c829cf2dfc32ee0e90cfd8467f729f2550b129f8dcb3d9a6ed8b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GGE5PETSKZ2KTGXQDECN3BFQUI/bundle.json","state_url":"https://pith.science/pith/GGE5PETSKZ2KTGXQDECN3BFQUI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GGE5PETSKZ2KTGXQDECN3BFQUI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T01:18:34Z","links":{"resolver":"https://pith.science/pith/GGE5PETSKZ2KTGXQDECN3BFQUI","bundle":"https://pith.science/pith/GGE5PETSKZ2KTGXQDECN3BFQUI/bundle.json","state":"https://pith.science/pith/GGE5PETSKZ2KTGXQDECN3BFQUI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GGE5PETSKZ2KTGXQDECN3BFQUI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GGE5PETSKZ2KTGXQDECN3BFQUI","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":"4cd7e29d82b13f949197a3d07727602ffda68c2b1ef7caa38424a5a0c9d1b82b","cross_cats_sorted":["cs.MS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-19T07:14:36Z","title_canon_sha256":"528f7cca1b9dfe7e053b039fc3441fc1253a31d71182bbd70c603ad4b96d7910"},"schema_version":"1.0","source":{"id":"1804.07017","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.07017","created_at":"2026-05-18T00:18:04Z"},{"alias_kind":"arxiv_version","alias_value":"1804.07017v1","created_at":"2026-05-18T00:18:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07017","created_at":"2026-05-18T00:18:04Z"},{"alias_kind":"pith_short_12","alias_value":"GGE5PETSKZ2K","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GGE5PETSKZ2KTGXQ","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GGE5PETS","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:6a099a8aa49c829cf2dfc32ee0e90cfd8467f729f2550b129f8dcb3d9a6ed8b9","target":"graph","created_at":"2026-05-18T00:18:04Z","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"},"paper":{"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","authors_text":"Adri\\'an Castell\\'o, Enrique S. Quintana-Ort\\'i, Francisco D. Igual, Rafael Rodr\\'iguez-S\\'anchez, Sandra Catal\\'an","cross_cats":["cs.MS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-19T07:14:36Z","title":"Programming Parallel Dense Matrix Factorizations with Look-Ahead and OpenMP"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.07017","kind":"arxiv","version":1},"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:1f94a48c28582a6f50cccfb3bb75677a874cae396009af67026d747384d1d00c","target":"record","created_at":"2026-05-18T00:18:04Z","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":"4cd7e29d82b13f949197a3d07727602ffda68c2b1ef7caa38424a5a0c9d1b82b","cross_cats_sorted":["cs.MS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-19T07:14:36Z","title_canon_sha256":"528f7cca1b9dfe7e053b039fc3441fc1253a31d71182bbd70c603ad4b96d7910"},"schema_version":"1.0","source":{"id":"1804.07017","kind":"arxiv","version":1}},"canonical_sha256":"3189d792725674a99af01904dd84b0a222bd16380ad432d1f16527af2a923c8c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3189d792725674a99af01904dd84b0a222bd16380ad432d1f16527af2a923c8c","first_computed_at":"2026-05-18T00:18:04.573959Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:04.573959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uH0thsUIpac2q8ceK6Zq5+5PN1RuH4cMAUR5iHDe0kAHKZDH9e64xokFI1EYqbig8zm/R2KTpJBBylDk/DKuAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:04.574555Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.07017","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f94a48c28582a6f50cccfb3bb75677a874cae396009af67026d747384d1d00c","sha256:6a099a8aa49c829cf2dfc32ee0e90cfd8467f729f2550b129f8dcb3d9a6ed8b9"],"state_sha256":"830e499a8e9c92f2a63e5177cac146e97439ebdbba09a6bc6b459c302d79ef96"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iCaKjdAvQX7flv43+BgOszsCGj9bl1TdywLZ6FxvUqMvU+MiS4b6pjctDhkOfLUbrOtgaL1jtYKGAtwKwFLlCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:18:34.394603Z","bundle_sha256":"e3b2c765ebb0e09b34ba068e96a0e5ce54a3eb2af7078360cd1b9d1e21a749ca"}}