{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LZSN4XPAXYYR6LLAXYLTFVJHDU","short_pith_number":"pith:LZSN4XPA","schema_version":"1.0","canonical_sha256":"5e64de5de0be311f2d60be1732d5271d262a1359d4508d80d39c5c3aa8f41ef7","source":{"kind":"arxiv","id":"1806.02030","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.02030","created_at":"2026-05-18T00:14:02.934739+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.02030v1","created_at":"2026-05-18T00:14:02.934739+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02030","created_at":"2026-05-18T00:14:02.934739+00:00"},{"alias_kind":"pith_short_12","alias_value":"LZSN4XPAXYYR","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LZSN4XPAXYYR6LLA","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LZSN4XPA","created_at":"2026-05-18T12:32:37.024351+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/LZSN4XPAXYYR6LLAXYLTFVJHDU","json":"https://pith.science/pith/LZSN4XPAXYYR6LLAXYLTFVJHDU.json","graph_json":"https://pith.science/api/pith-number/LZSN4XPAXYYR6LLAXYLTFVJHDU/graph.json","events_json":"https://pith.science/api/pith-number/LZSN4XPAXYYR6LLAXYLTFVJHDU/events.json","paper":"https://pith.science/paper/LZSN4XPA"},"agent_actions":{"view_html":"https://pith.science/pith/LZSN4XPAXYYR6LLAXYLTFVJHDU","download_json":"https://pith.science/pith/LZSN4XPAXYYR6LLAXYLTFVJHDU.json","view_paper":"https://pith.science/paper/LZSN4XPA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.02030&json=true","fetch_graph":"https://pith.science/api/pith-number/LZSN4XPAXYYR6LLAXYLTFVJHDU/graph.json","fetch_events":"https://pith.science/api/pith-number/LZSN4XPAXYYR6LLAXYLTFVJHDU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LZSN4XPAXYYR6LLAXYLTFVJHDU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LZSN4XPAXYYR6LLAXYLTFVJHDU/action/storage_attestation","attest_author":"https://pith.science/pith/LZSN4XPAXYYR6LLAXYLTFVJHDU/action/author_attestation","sign_citation":"https://pith.science/pith/LZSN4XPAXYYR6LLAXYLTFVJHDU/action/citation_signature","submit_replication":"https://pith.science/pith/LZSN4XPAXYYR6LLAXYLTFVJHDU/action/replication_record"}},"created_at":"2026-05-18T00:14:02.934739+00:00","updated_at":"2026-05-18T00:14:02.934739+00:00"}