{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:J4NGSXJ3RPGYNSMQE6EBL4JC2K","short_pith_number":"pith:J4NGSXJ3","canonical_record":{"source":{"id":"1110.2677","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-10-12T15:09:45Z","cross_cats_sorted":[],"title_canon_sha256":"83e16261861428c9af251486c9d4fa4b0ba681636e5975681bf5af32b4d97474","abstract_canon_sha256":"808dac60bcf7a782af3b35ac9159e0c4828d629cd79f84a839b1dfdfb669a9a2"},"schema_version":"1.0"},"canonical_sha256":"4f1a695d3b8bcd86c990278815f122d2b9441438139d987959cf7b3eb8f77190","source":{"kind":"arxiv","id":"1110.2677","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.2677","created_at":"2026-05-18T04:11:07Z"},{"alias_kind":"arxiv_version","alias_value":"1110.2677v1","created_at":"2026-05-18T04:11:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.2677","created_at":"2026-05-18T04:11:07Z"},{"alias_kind":"pith_short_12","alias_value":"J4NGSXJ3RPGY","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"J4NGSXJ3RPGYNSMQ","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"J4NGSXJ3","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:J4NGSXJ3RPGYNSMQE6EBL4JC2K","target":"record","payload":{"canonical_record":{"source":{"id":"1110.2677","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-10-12T15:09:45Z","cross_cats_sorted":[],"title_canon_sha256":"83e16261861428c9af251486c9d4fa4b0ba681636e5975681bf5af32b4d97474","abstract_canon_sha256":"808dac60bcf7a782af3b35ac9159e0c4828d629cd79f84a839b1dfdfb669a9a2"},"schema_version":"1.0"},"canonical_sha256":"4f1a695d3b8bcd86c990278815f122d2b9441438139d987959cf7b3eb8f77190","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:07.790362Z","signature_b64":"TmwS68OFK175QfKaIdSMb3vOhJ39nT98v7HJTU3HPOzDcCyBBVkhMDxzElEmOd0yvn0rXV0PK9xpv6NRleP6AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f1a695d3b8bcd86c990278815f122d2b9441438139d987959cf7b3eb8f77190","last_reissued_at":"2026-05-18T04:11:07.789758Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:07.789758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.2677","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-18T04:11:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DF9Z4WfCZQaNxW4MU0gOhgZPtApGbb4GrBeYMkGrhzJXBa2jhU1Lv/wCl0yG8gwZC25L28lnPFoQcSegUPiAAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:28:53.487234Z"},"content_sha256":"ce9bf0a89811efaa9d222a979ff518f5fbccde6bfd6902e716cb01296a1cee95","schema_version":"1.0","event_id":"sha256:ce9bf0a89811efaa9d222a979ff518f5fbccde6bfd6902e716cb01296a1cee95"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:J4NGSXJ3RPGYNSMQE6EBL4JC2K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hybrid static/dynamic scheduling for already optimized dense matrix factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Laura Grigori, Simplice Donfack, Vivek Kale, William D. Gropp","submitted_at":"2011-10-12T15:09:45Z","abstract_excerpt":"We present the use of a hybrid static/dynamic scheduling strategy of the task dependency graph for direct methods used in dense numerical linear algebra. This strategy provides a balance of data locality, load balance, and low dequeue overhead. We show that the usage of this scheduling in communication avoiding dense factorization leads to significant performance gains. On a 48 core AMD Opteron NUMA machine, our experiments show that we can achieve up to 64% improvement over a version of CALU that uses fully dynamic scheduling, and up to 30% improvement over the version of CALU that uses fully"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.2677","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-18T04:11:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Ik/RDH0vVXFDrnPHnW61szgtWXQZo/zRUGcSS/goyaLGzjmyDXD9xTrh5BeF0yozggfe/Dt5Sr+oHHo89JOBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:28:53.487618Z"},"content_sha256":"ad06ae231c3cc9f7d6bd180dd2aeb15a857b21a16a9d97dad3b1f6c6873733e7","schema_version":"1.0","event_id":"sha256:ad06ae231c3cc9f7d6bd180dd2aeb15a857b21a16a9d97dad3b1f6c6873733e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J4NGSXJ3RPGYNSMQE6EBL4JC2K/bundle.json","state_url":"https://pith.science/pith/J4NGSXJ3RPGYNSMQE6EBL4JC2K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J4NGSXJ3RPGYNSMQE6EBL4JC2K/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-27T00:28:53Z","links":{"resolver":"https://pith.science/pith/J4NGSXJ3RPGYNSMQE6EBL4JC2K","bundle":"https://pith.science/pith/J4NGSXJ3RPGYNSMQE6EBL4JC2K/bundle.json","state":"https://pith.science/pith/J4NGSXJ3RPGYNSMQE6EBL4JC2K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J4NGSXJ3RPGYNSMQE6EBL4JC2K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:J4NGSXJ3RPGYNSMQE6EBL4JC2K","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":"808dac60bcf7a782af3b35ac9159e0c4828d629cd79f84a839b1dfdfb669a9a2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-10-12T15:09:45Z","title_canon_sha256":"83e16261861428c9af251486c9d4fa4b0ba681636e5975681bf5af32b4d97474"},"schema_version":"1.0","source":{"id":"1110.2677","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.2677","created_at":"2026-05-18T04:11:07Z"},{"alias_kind":"arxiv_version","alias_value":"1110.2677v1","created_at":"2026-05-18T04:11:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.2677","created_at":"2026-05-18T04:11:07Z"},{"alias_kind":"pith_short_12","alias_value":"J4NGSXJ3RPGY","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"J4NGSXJ3RPGYNSMQ","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"J4NGSXJ3","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:ad06ae231c3cc9f7d6bd180dd2aeb15a857b21a16a9d97dad3b1f6c6873733e7","target":"graph","created_at":"2026-05-18T04:11:07Z","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 present the use of a hybrid static/dynamic scheduling strategy of the task dependency graph for direct methods used in dense numerical linear algebra. This strategy provides a balance of data locality, load balance, and low dequeue overhead. We show that the usage of this scheduling in communication avoiding dense factorization leads to significant performance gains. On a 48 core AMD Opteron NUMA machine, our experiments show that we can achieve up to 64% improvement over a version of CALU that uses fully dynamic scheduling, and up to 30% improvement over the version of CALU that uses fully","authors_text":"Laura Grigori, Simplice Donfack, Vivek Kale, William D. Gropp","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-10-12T15:09:45Z","title":"Hybrid static/dynamic scheduling for already optimized dense matrix factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.2677","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:ce9bf0a89811efaa9d222a979ff518f5fbccde6bfd6902e716cb01296a1cee95","target":"record","created_at":"2026-05-18T04:11:07Z","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":"808dac60bcf7a782af3b35ac9159e0c4828d629cd79f84a839b1dfdfb669a9a2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-10-12T15:09:45Z","title_canon_sha256":"83e16261861428c9af251486c9d4fa4b0ba681636e5975681bf5af32b4d97474"},"schema_version":"1.0","source":{"id":"1110.2677","kind":"arxiv","version":1}},"canonical_sha256":"4f1a695d3b8bcd86c990278815f122d2b9441438139d987959cf7b3eb8f77190","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f1a695d3b8bcd86c990278815f122d2b9441438139d987959cf7b3eb8f77190","first_computed_at":"2026-05-18T04:11:07.789758Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:11:07.789758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TmwS68OFK175QfKaIdSMb3vOhJ39nT98v7HJTU3HPOzDcCyBBVkhMDxzElEmOd0yvn0rXV0PK9xpv6NRleP6AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:11:07.790362Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.2677","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce9bf0a89811efaa9d222a979ff518f5fbccde6bfd6902e716cb01296a1cee95","sha256:ad06ae231c3cc9f7d6bd180dd2aeb15a857b21a16a9d97dad3b1f6c6873733e7"],"state_sha256":"74e5cbcee2a47f5665a65f25ccd36831c4811d24b441112cc5567aa873a71c44"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vBx+eSw0DEFLqYD4kyH7wngInF4Ild+P++uAsTRg1blvqBX8y/DdFEfNRFdFC1xbRxLreTMX8goF3is5ZCDbCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:28:53.489907Z","bundle_sha256":"b17478f5f449f8c8b09ad3ec1a3a1aef7554477022c0383a25b5d01d8a3bb1e7"}}