{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:6HH7ISARMOWL6RBBVMMSHUWUX5","short_pith_number":"pith:6HH7ISAR","schema_version":"1.0","canonical_sha256":"f1cff4481163acbf4421ab1923d2d4bf422d80cae5a8ef7f8bdf68fef6e84936","source":{"kind":"arxiv","id":"2002.10083","version":1},"attestation_state":"computed","paper":{"title":"Optimizing High Performance Markov Clustering for Pre-Exascale Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ariful Azad, Ayd{\\i}n Bulu\\c{c}, Md Taufique Hussain, Oguz Selvitopi","submitted_at":"2020-02-24T05:39:51Z","abstract_excerpt":"HipMCL is a high-performance distributed memory implementation of the popular Markov Cluster Algorithm (MCL) and can cluster large-scale networks within hours using a few thousand CPU-equipped nodes. It relies on sparse matrix computations and heavily makes use of the sparse matrix-sparse matrix multiplication kernel (SpGEMM). The existing parallel algorithms in HipMCL are not scalable to Exascale architectures, both due to their communication costs dominating the runtime at large concurrencies and also due to their inability to take advantage of accelerators that are increasingly popular.\n  I"},"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":"2002.10083","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-02-24T05:39:51Z","cross_cats_sorted":[],"title_canon_sha256":"5f45eb2bcc55a9f7b3dfea061d60869dc790f4253f670cb479d3d5ec801deba5","abstract_canon_sha256":"7e89fb6ff6b9f991725d66434ba73c67733192b3356e08366ecef74a03b55b85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:43:22.197136Z","signature_b64":"KQ/GafX9r/6V8QDAmrQ2lv92a1I89/oncdwgiAFe1uQqPJjn9umZfVPaE5eemYkAlAnHXWQZt7PJfglvZXKjAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1cff4481163acbf4421ab1923d2d4bf422d80cae5a8ef7f8bdf68fef6e84936","last_reissued_at":"2026-07-05T00:43:22.196667Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:43:22.196667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing High Performance Markov Clustering for Pre-Exascale Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ariful Azad, Ayd{\\i}n Bulu\\c{c}, Md Taufique Hussain, Oguz Selvitopi","submitted_at":"2020-02-24T05:39:51Z","abstract_excerpt":"HipMCL is a high-performance distributed memory implementation of the popular Markov Cluster Algorithm (MCL) and can cluster large-scale networks within hours using a few thousand CPU-equipped nodes. It relies on sparse matrix computations and heavily makes use of the sparse matrix-sparse matrix multiplication kernel (SpGEMM). The existing parallel algorithms in HipMCL are not scalable to Exascale architectures, both due to their communication costs dominating the runtime at large concurrencies and also due to their inability to take advantage of accelerators that are increasingly popular.\n  I"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.10083","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2002.10083/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2002.10083","created_at":"2026-07-05T00:43:22.196727+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.10083v1","created_at":"2026-07-05T00:43:22.196727+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.10083","created_at":"2026-07-05T00:43:22.196727+00:00"},{"alias_kind":"pith_short_12","alias_value":"6HH7ISARMOWL","created_at":"2026-07-05T00:43:22.196727+00:00"},{"alias_kind":"pith_short_16","alias_value":"6HH7ISARMOWL6RBB","created_at":"2026-07-05T00:43:22.196727+00:00"},{"alias_kind":"pith_short_8","alias_value":"6HH7ISAR","created_at":"2026-07-05T00:43:22.196727+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/6HH7ISARMOWL6RBBVMMSHUWUX5","json":"https://pith.science/pith/6HH7ISARMOWL6RBBVMMSHUWUX5.json","graph_json":"https://pith.science/api/pith-number/6HH7ISARMOWL6RBBVMMSHUWUX5/graph.json","events_json":"https://pith.science/api/pith-number/6HH7ISARMOWL6RBBVMMSHUWUX5/events.json","paper":"https://pith.science/paper/6HH7ISAR"},"agent_actions":{"view_html":"https://pith.science/pith/6HH7ISARMOWL6RBBVMMSHUWUX5","download_json":"https://pith.science/pith/6HH7ISARMOWL6RBBVMMSHUWUX5.json","view_paper":"https://pith.science/paper/6HH7ISAR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.10083&json=true","fetch_graph":"https://pith.science/api/pith-number/6HH7ISARMOWL6RBBVMMSHUWUX5/graph.json","fetch_events":"https://pith.science/api/pith-number/6HH7ISARMOWL6RBBVMMSHUWUX5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6HH7ISARMOWL6RBBVMMSHUWUX5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6HH7ISARMOWL6RBBVMMSHUWUX5/action/storage_attestation","attest_author":"https://pith.science/pith/6HH7ISARMOWL6RBBVMMSHUWUX5/action/author_attestation","sign_citation":"https://pith.science/pith/6HH7ISARMOWL6RBBVMMSHUWUX5/action/citation_signature","submit_replication":"https://pith.science/pith/6HH7ISARMOWL6RBBVMMSHUWUX5/action/replication_record"}},"created_at":"2026-07-05T00:43:22.196727+00:00","updated_at":"2026-07-05T00:43:22.196727+00:00"}