{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LZSN4XPAXYYR6LLAXYLTFVJHDU","short_pith_number":"pith:LZSN4XPA","canonical_record":{"source":{"id":"1806.02030","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-06-06T06:49:15Z","cross_cats_sorted":[],"title_canon_sha256":"7069e5fe2e5a4eb0986209f00875bbaac5573cc91296a7765e1cddbeaec2e47f","abstract_canon_sha256":"da553b55920c746cb137231040f55d0da4f2ebcde282486fe648496547f53669"},"schema_version":"1.0"},"canonical_sha256":"5e64de5de0be311f2d60be1732d5271d262a1359d4508d80d39c5c3aa8f41ef7","source":{"kind":"arxiv","id":"1806.02030","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.02030","created_at":"2026-05-18T00:14:02Z"},{"alias_kind":"arxiv_version","alias_value":"1806.02030v1","created_at":"2026-05-18T00:14:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02030","created_at":"2026-05-18T00:14:02Z"},{"alias_kind":"pith_short_12","alias_value":"LZSN4XPAXYYR","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LZSN4XPAXYYR6LLA","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LZSN4XPA","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LZSN4XPAXYYR6LLAXYLTFVJHDU","target":"record","payload":{"canonical_record":{"source":{"id":"1806.02030","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-06-06T06:49:15Z","cross_cats_sorted":[],"title_canon_sha256":"7069e5fe2e5a4eb0986209f00875bbaac5573cc91296a7765e1cddbeaec2e47f","abstract_canon_sha256":"da553b55920c746cb137231040f55d0da4f2ebcde282486fe648496547f53669"},"schema_version":"1.0"},"canonical_sha256":"5e64de5de0be311f2d60be1732d5271d262a1359d4508d80d39c5c3aa8f41ef7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:02.935429Z","signature_b64":"WODThOIa/BiwvM0c2BSuHlJAg7S3VLDC+LOdEFfEUP78u4iu4DveEWjcP+Ai80FJYVLm/rw3Z0QD9uEfB3qjAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e64de5de0be311f2d60be1732d5271d262a1359d4508d80d39c5c3aa8f41ef7","last_reissued_at":"2026-05-18T00:14:02.934603Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:02.934603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.02030","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:14:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O6ghVhiegJoK1YBgUJ1Cg3ZkPL6UPKAHgocOIamkCkACtuHfQhf7uDvxqY+OEQWl+0MfNlU03shkiw6n3r6RBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:23:28.750561Z"},"content_sha256":"97151f859b6e514b366690a40f8b87231a16234af81b34cd149cb15fe8fc8276","schema_version":"1.0","event_id":"sha256:97151f859b6e514b366690a40f8b87231a16234af81b34cd149cb15fe8fc8276"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LZSN4XPAXYYR6LLAXYLTFVJHDU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving Performance Models for Irregular Point-to-Point Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Amanda Bienz, Luke N. Olson, William D. Gropp","submitted_at":"2018-06-06T06:49:15Z","abstract_excerpt":"Parallel applications are often unable to take full advantage of emerging parallel architectures due to scaling limitations, which arise due to inter-process communication. Performance models are used to analyze the sources of communication costs. However, traditional models for point-to-point communication fail to capture the full cost of many irregular operations, such as sparse matrix methods. In this paper, a node-aware based model is presented. Furthermore, the model is extended to include communication queue search time as well as an additional parameter estimating network contention. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02030","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:14:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vjDHUo9T5NOjyphKOgAn7MyMv+uA5MzLq/x+sqAPCdM5R9DKCVdj6126WssOW8yZW39yetKLNQf97b5jJN9FCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:23:28.751187Z"},"content_sha256":"fb09c8190c6713d3657c778d526fe16401482f4185eeb60f3f347c68f7319258","schema_version":"1.0","event_id":"sha256:fb09c8190c6713d3657c778d526fe16401482f4185eeb60f3f347c68f7319258"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LZSN4XPAXYYR6LLAXYLTFVJHDU/bundle.json","state_url":"https://pith.science/pith/LZSN4XPAXYYR6LLAXYLTFVJHDU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LZSN4XPAXYYR6LLAXYLTFVJHDU/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-06-02T05:23:28Z","links":{"resolver":"https://pith.science/pith/LZSN4XPAXYYR6LLAXYLTFVJHDU","bundle":"https://pith.science/pith/LZSN4XPAXYYR6LLAXYLTFVJHDU/bundle.json","state":"https://pith.science/pith/LZSN4XPAXYYR6LLAXYLTFVJHDU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LZSN4XPAXYYR6LLAXYLTFVJHDU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LZSN4XPAXYYR6LLAXYLTFVJHDU","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":"da553b55920c746cb137231040f55d0da4f2ebcde282486fe648496547f53669","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-06-06T06:49:15Z","title_canon_sha256":"7069e5fe2e5a4eb0986209f00875bbaac5573cc91296a7765e1cddbeaec2e47f"},"schema_version":"1.0","source":{"id":"1806.02030","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.02030","created_at":"2026-05-18T00:14:02Z"},{"alias_kind":"arxiv_version","alias_value":"1806.02030v1","created_at":"2026-05-18T00:14:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02030","created_at":"2026-05-18T00:14:02Z"},{"alias_kind":"pith_short_12","alias_value":"LZSN4XPAXYYR","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LZSN4XPAXYYR6LLA","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LZSN4XPA","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:fb09c8190c6713d3657c778d526fe16401482f4185eeb60f3f347c68f7319258","target":"graph","created_at":"2026-05-18T00:14:02Z","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":"Parallel applications are often unable to take full advantage of emerging parallel architectures due to scaling limitations, which arise due to inter-process communication. Performance models are used to analyze the sources of communication costs. However, traditional models for point-to-point communication fail to capture the full cost of many irregular operations, such as sparse matrix methods. In this paper, a node-aware based model is presented. Furthermore, the model is extended to include communication queue search time as well as an additional parameter estimating network contention. Th","authors_text":"Amanda Bienz, Luke N. Olson, William D. Gropp","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-06-06T06:49:15Z","title":"Improving Performance Models for Irregular Point-to-Point Communication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02030","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:97151f859b6e514b366690a40f8b87231a16234af81b34cd149cb15fe8fc8276","target":"record","created_at":"2026-05-18T00:14:02Z","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":"da553b55920c746cb137231040f55d0da4f2ebcde282486fe648496547f53669","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-06-06T06:49:15Z","title_canon_sha256":"7069e5fe2e5a4eb0986209f00875bbaac5573cc91296a7765e1cddbeaec2e47f"},"schema_version":"1.0","source":{"id":"1806.02030","kind":"arxiv","version":1}},"canonical_sha256":"5e64de5de0be311f2d60be1732d5271d262a1359d4508d80d39c5c3aa8f41ef7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e64de5de0be311f2d60be1732d5271d262a1359d4508d80d39c5c3aa8f41ef7","first_computed_at":"2026-05-18T00:14:02.934603Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:02.934603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WODThOIa/BiwvM0c2BSuHlJAg7S3VLDC+LOdEFfEUP78u4iu4DveEWjcP+Ai80FJYVLm/rw3Z0QD9uEfB3qjAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:02.935429Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.02030","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97151f859b6e514b366690a40f8b87231a16234af81b34cd149cb15fe8fc8276","sha256:fb09c8190c6713d3657c778d526fe16401482f4185eeb60f3f347c68f7319258"],"state_sha256":"03a7f543fcc254ab6816b5b1d56ce0a5371c7cf464faff7eb32ca00035257b56"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tOSu25lXHJBYigoUVQoOfIQiVz56VJk3cIp/GWIkObLaMYa9aJuSL7m1xedgvi3I4Upqiz0C1xXcqyzy7CPSAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T05:23:28.754281Z","bundle_sha256":"234b47f079688b84b42caf6596df30c641de451af8a0ed8fb1db352fe15a8e71"}}