{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PCOUWNX4D63MPQ7BGX252JVP7M","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":"ad6965954aee21b418fc7675c858c734e4b4303e79234db6a6f153d5d5b00cf0","cross_cats_sorted":["cs.MS","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-10-26T00:26:44Z","title_canon_sha256":"40f2361a1426740f30d25f603130f170ed0df2ef513aae98a014b5a3f1782036"},"schema_version":"1.0","source":{"id":"1610.08128","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.08128","created_at":"2026-05-18T01:01:09Z"},{"alias_kind":"arxiv_version","alias_value":"1610.08128v1","created_at":"2026-05-18T01:01:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08128","created_at":"2026-05-18T01:01:09Z"},{"alias_kind":"pith_short_12","alias_value":"PCOUWNX4D63M","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PCOUWNX4D63MPQ7B","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PCOUWNX4","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:b76b526470181889888fc7e94b1670d0c4e4f69f7332007a57499872ea504aaa","target":"graph","created_at":"2026-05-18T01:01:09Z","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":"Ordering vertices of a graph is key to minimize fill-in and data structure size in sparse direct solvers, maximize locality in iterative solvers, and improve performance in graph algorithms. Except for naturally parallelizable ordering methods such as nested dissection, many important ordering methods have not been efficiently mapped to distributed-memory architectures. In this paper, we present the first-ever distributed-memory implementation of the reverse Cuthill-McKee (RCM) algorithm for reducing the profile of a sparse matrix. Our parallelization uses a two-dimensional sparse matrix decom","authors_text":"Ariful Azad, Aydin Buluc, Esmond G. Ng, Mathias Jacquelin","cross_cats":["cs.MS","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-10-26T00:26:44Z","title":"The Reverse Cuthill-McKee Algorithm in Distributed-Memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08128","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:b53b4f6868b8a417b1b4c8cd94493857830831bfc08858639e1301ac80a5c41e","target":"record","created_at":"2026-05-18T01:01:09Z","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":"ad6965954aee21b418fc7675c858c734e4b4303e79234db6a6f153d5d5b00cf0","cross_cats_sorted":["cs.MS","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-10-26T00:26:44Z","title_canon_sha256":"40f2361a1426740f30d25f603130f170ed0df2ef513aae98a014b5a3f1782036"},"schema_version":"1.0","source":{"id":"1610.08128","kind":"arxiv","version":1}},"canonical_sha256":"789d4b36fc1fb6c7c3e135f5dd26affb2e53e4c7b261f72481bac4247a62243a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"789d4b36fc1fb6c7c3e135f5dd26affb2e53e4c7b261f72481bac4247a62243a","first_computed_at":"2026-05-18T01:01:09.478754Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:09.478754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A6cmRqPXmZVIAJEEhoAmIN5zlDJVtdglLIhl6hAkgS7KFfOwdzAd2uXbaOT7IQN1cp/Xv9lsdmrMYUspR5/ZDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:09.479387Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.08128","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b53b4f6868b8a417b1b4c8cd94493857830831bfc08858639e1301ac80a5c41e","sha256:b76b526470181889888fc7e94b1670d0c4e4f69f7332007a57499872ea504aaa"],"state_sha256":"c8f89643c42e52f4eb87c0638f6d9652162fc5ef724cd8d1e2a5fb5ff47777df"}