{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5IBXBRSGOCTNJIB37IC5MVIE5W","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":"7dbb714ca39c75b8ec2414320d5874088064d4f454107bea42595d5cc0da2480","cross_cats_sorted":["cs.DM","cs.MS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-09-22T15:01:30Z","title_canon_sha256":"1d9b165cf57fd46c3bac934f1d7f91a079660499f9e227d5bb1aed955fd8b5cb"},"schema_version":"1.0","source":{"id":"1609.07008","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.07008","created_at":"2026-05-18T00:38:21Z"},{"alias_kind":"arxiv_version","alias_value":"1609.07008v2","created_at":"2026-05-18T00:38:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07008","created_at":"2026-05-18T00:38:21Z"},{"alias_kind":"pith_short_12","alias_value":"5IBXBRSGOCTN","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5IBXBRSGOCTNJIB3","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5IBXBRSG","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:2f387220ba43dd72fa78761c527ea1ebfeb57716e3c2765fa1753a306de73f96","target":"graph","created_at":"2026-05-18T00:38:21Z","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":"Betweenness centrality (BC) is a crucial graph problem that measures the significance of a vertex by the number of shortest paths leading through it. We propose Maximal Frontier Betweenness Centrality (MFBC): a succinct BC algorithm based on novel sparse matrix multiplication routines that performs a factor of $p^{1/3}$ less communication on $p$ processors than the best known alternatives, for graphs with $n$ vertices and average degree $k=n/p^{2/3}$. We formulate, implement, and prove the correctness of MFBC for weighted graphs by leveraging monoids instead of semirings, which enables a surpr","authors_text":"Edgar Solomonik, Flavio Vella, Maciej Besta, Torsten Hoefler","cross_cats":["cs.DM","cs.MS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-09-22T15:01:30Z","title":"Scaling betweenness centrality using communication-efficient sparse matrix multiplication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07008","kind":"arxiv","version":2},"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:f5b38d15eac088bee5e9d2a12081feae94c0fc3c0c7d4255f1a28260424b0c05","target":"record","created_at":"2026-05-18T00:38:21Z","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":"7dbb714ca39c75b8ec2414320d5874088064d4f454107bea42595d5cc0da2480","cross_cats_sorted":["cs.DM","cs.MS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-09-22T15:01:30Z","title_canon_sha256":"1d9b165cf57fd46c3bac934f1d7f91a079660499f9e227d5bb1aed955fd8b5cb"},"schema_version":"1.0","source":{"id":"1609.07008","kind":"arxiv","version":2}},"canonical_sha256":"ea0370c64670a6d4a03bfa05d65504ed9a8e9f5f79e43c901df82e1603e6f2fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea0370c64670a6d4a03bfa05d65504ed9a8e9f5f79e43c901df82e1603e6f2fc","first_computed_at":"2026-05-18T00:38:21.212106Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:21.212106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l1cMPAtwybvWI3jnGkBLB2sHENQzWV9EUtFcqBdiRlpV55+oWsrlzZf4xn2+kEylOlv8Msux8g0J0BgPThaHBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:21.212664Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.07008","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f5b38d15eac088bee5e9d2a12081feae94c0fc3c0c7d4255f1a28260424b0c05","sha256:2f387220ba43dd72fa78761c527ea1ebfeb57716e3c2765fa1753a306de73f96"],"state_sha256":"77286f9dd639efef69e3ec2f1d8e3efdc55493508ce6c17f5c181c9e05b7ea0c"}