{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:26KIQJ3KPOY6DKHGOMBPLCUVIA","short_pith_number":"pith:26KIQJ3K","canonical_record":{"source":{"id":"1402.1285","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-02-06T09:16:38Z","cross_cats_sorted":["cs.MS","cs.PF"],"title_canon_sha256":"ba485949643a4e785a7c7b2a1d7e4d99871096356637f6157bac59c963f740bb","abstract_canon_sha256":"9730db26b71bb45b4a71b18264c745f7ed36dc6581f3a0068a811b59361e36e4"},"schema_version":"1.0"},"canonical_sha256":"d79488276a7bb1e1a8e67302f58a95402ff974b3d630a8816a49d3ce0c39a607","source":{"kind":"arxiv","id":"1402.1285","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.1285","created_at":"2026-05-18T02:59:59Z"},{"alias_kind":"arxiv_version","alias_value":"1402.1285v1","created_at":"2026-05-18T02:59:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.1285","created_at":"2026-05-18T02:59:59Z"},{"alias_kind":"pith_short_12","alias_value":"26KIQJ3KPOY6","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"26KIQJ3KPOY6DKHG","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"26KIQJ3K","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:26KIQJ3KPOY6DKHGOMBPLCUVIA","target":"record","payload":{"canonical_record":{"source":{"id":"1402.1285","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-02-06T09:16:38Z","cross_cats_sorted":["cs.MS","cs.PF"],"title_canon_sha256":"ba485949643a4e785a7c7b2a1d7e4d99871096356637f6157bac59c963f740bb","abstract_canon_sha256":"9730db26b71bb45b4a71b18264c745f7ed36dc6581f3a0068a811b59361e36e4"},"schema_version":"1.0"},"canonical_sha256":"d79488276a7bb1e1a8e67302f58a95402ff974b3d630a8816a49d3ce0c39a607","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:59.607920Z","signature_b64":"yvJbsHZxi/d7100yah4h9tWTtVE1lCPBo8r56UGJ8UjkMhDGdwh8aIlBT3dP2dLjSCsxVAyWWZQmpuYR15N0BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d79488276a7bb1e1a8e67302f58a95402ff974b3d630a8816a49d3ce0c39a607","last_reissued_at":"2026-05-18T02:59:59.607167Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:59.607167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.1285","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-18T02:59:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1UGtDopSpmBqNGHggIKOPPlQH45aco/w8ZwOi/dXbfcnYwxv0a/IPSdKBnKeDXlvqdWhKQgJpk+i78hcQIZYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:40:49.575098Z"},"content_sha256":"05210e6325fd6111b939b2bfc8b3f353483aa1c4aadb85990a38b0dcc85d7526","schema_version":"1.0","event_id":"sha256:05210e6325fd6111b939b2bfc8b3f353483aa1c4aadb85990a38b0dcc85d7526"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:26KIQJ3KPOY6DKHGOMBPLCUVIA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constructing Performance Models for Dense Linear Algebra Algorithms on Cray XE Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","cs.PF"],"primary_cat":"cs.DC","authors_text":"Evangelos Georganas, Jorge Gonz\\'alez-Dom\\'inguez, Mar\\'ia J. Mart\\'in, Yili Zheng","submitted_at":"2014-02-06T09:16:38Z","abstract_excerpt":"Hiding or minimizing the communication cost is key in order to obtain good performance on large-scale systems. While communication overlapping attempts to hide communications cost, 2.5D communication avoiding algorithms improve performance scalability by reducing the volume of data transfers at the cost of extra memory usage. Both approaches can be used together or separately and the best choice depends on the machine, the algorithm and the problem size. Thus, the development of performance models is crucial to determine the best option for each scenario. In this paper, we present a methodolog"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.1285","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-18T02:59:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jlz3xI+P3VUfqgQvvacxb5n4ulLlwjqcQ6tsq7cgSziS9YyfQytKBOD23PLOqFDPIesMTSGf9sX/KnRc6EkyDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:40:49.575660Z"},"content_sha256":"a81fab861d598f6a649226bd8810e660f75b0c33ee19994f03157d013f5e7399","schema_version":"1.0","event_id":"sha256:a81fab861d598f6a649226bd8810e660f75b0c33ee19994f03157d013f5e7399"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/26KIQJ3KPOY6DKHGOMBPLCUVIA/bundle.json","state_url":"https://pith.science/pith/26KIQJ3KPOY6DKHGOMBPLCUVIA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/26KIQJ3KPOY6DKHGOMBPLCUVIA/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-30T14:40:49Z","links":{"resolver":"https://pith.science/pith/26KIQJ3KPOY6DKHGOMBPLCUVIA","bundle":"https://pith.science/pith/26KIQJ3KPOY6DKHGOMBPLCUVIA/bundle.json","state":"https://pith.science/pith/26KIQJ3KPOY6DKHGOMBPLCUVIA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/26KIQJ3KPOY6DKHGOMBPLCUVIA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:26KIQJ3KPOY6DKHGOMBPLCUVIA","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":"9730db26b71bb45b4a71b18264c745f7ed36dc6581f3a0068a811b59361e36e4","cross_cats_sorted":["cs.MS","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-02-06T09:16:38Z","title_canon_sha256":"ba485949643a4e785a7c7b2a1d7e4d99871096356637f6157bac59c963f740bb"},"schema_version":"1.0","source":{"id":"1402.1285","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.1285","created_at":"2026-05-18T02:59:59Z"},{"alias_kind":"arxiv_version","alias_value":"1402.1285v1","created_at":"2026-05-18T02:59:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.1285","created_at":"2026-05-18T02:59:59Z"},{"alias_kind":"pith_short_12","alias_value":"26KIQJ3KPOY6","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"26KIQJ3KPOY6DKHG","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"26KIQJ3K","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:a81fab861d598f6a649226bd8810e660f75b0c33ee19994f03157d013f5e7399","target":"graph","created_at":"2026-05-18T02:59:59Z","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":"Hiding or minimizing the communication cost is key in order to obtain good performance on large-scale systems. While communication overlapping attempts to hide communications cost, 2.5D communication avoiding algorithms improve performance scalability by reducing the volume of data transfers at the cost of extra memory usage. Both approaches can be used together or separately and the best choice depends on the machine, the algorithm and the problem size. Thus, the development of performance models is crucial to determine the best option for each scenario. In this paper, we present a methodolog","authors_text":"Evangelos Georganas, Jorge Gonz\\'alez-Dom\\'inguez, Mar\\'ia J. Mart\\'in, Yili Zheng","cross_cats":["cs.MS","cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-02-06T09:16:38Z","title":"Constructing Performance Models for Dense Linear Algebra Algorithms on Cray XE Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.1285","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:05210e6325fd6111b939b2bfc8b3f353483aa1c4aadb85990a38b0dcc85d7526","target":"record","created_at":"2026-05-18T02:59:59Z","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":"9730db26b71bb45b4a71b18264c745f7ed36dc6581f3a0068a811b59361e36e4","cross_cats_sorted":["cs.MS","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-02-06T09:16:38Z","title_canon_sha256":"ba485949643a4e785a7c7b2a1d7e4d99871096356637f6157bac59c963f740bb"},"schema_version":"1.0","source":{"id":"1402.1285","kind":"arxiv","version":1}},"canonical_sha256":"d79488276a7bb1e1a8e67302f58a95402ff974b3d630a8816a49d3ce0c39a607","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d79488276a7bb1e1a8e67302f58a95402ff974b3d630a8816a49d3ce0c39a607","first_computed_at":"2026-05-18T02:59:59.607167Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:59.607167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yvJbsHZxi/d7100yah4h9tWTtVE1lCPBo8r56UGJ8UjkMhDGdwh8aIlBT3dP2dLjSCsxVAyWWZQmpuYR15N0BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:59.607920Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.1285","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05210e6325fd6111b939b2bfc8b3f353483aa1c4aadb85990a38b0dcc85d7526","sha256:a81fab861d598f6a649226bd8810e660f75b0c33ee19994f03157d013f5e7399"],"state_sha256":"37a3e4186b6d99477030476bc4e748ab7dba75f30f65410c7ee122d8fd8ccfef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ebcdKkMNFdeDf8+o13CVzU9xgc1ivrXs+MQhoP+zb+YbhLQa6U+2oxzRkuh+hYi1uzX98HZMqWRPg56j90J5CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T14:40:49.579208Z","bundle_sha256":"170336ffb4cdf9e0eb6ee14e28c435e73a057b706d7ac4c6c6393b1cb2c66a74"}}