{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Y65IISP6WJRKW672IR22AP2SE2","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":"e8816ec360cb9679109555a16865ec2ebae7cd6dc8a68c85a363a25a7f4c6719","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-01-16T06:22:32Z","title_canon_sha256":"28f9edb925b9a605ca6bd3bf6a07cbea72580a5c10899cb92b9859fa0483c567"},"schema_version":"1.0","source":{"id":"1801.05127","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.05127","created_at":"2026-05-18T00:15:46Z"},{"alias_kind":"arxiv_version","alias_value":"1801.05127v3","created_at":"2026-05-18T00:15:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05127","created_at":"2026-05-18T00:15:46Z"},{"alias_kind":"pith_short_12","alias_value":"Y65IISP6WJRK","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Y65IISP6WJRKW672","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Y65IISP6","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:6b190ed1f1db72236fddfcc560df554c27a41ef9fdf5e4ea89bcc74bff54c937","target":"graph","created_at":"2026-05-18T00:15:46Z","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":"Distributed graph algorithms that separately optimize for either the number of rounds used or the total number of messages sent have been studied extensively. However, algorithms simultaneously efficient with respect to both measures have been elusive. For example, only very recently was it shown that for Minimum Spanning Tree (MST), an optimal message and round complexity is achievable (up to polylog terms) by a single algorithm in the CONGEST model of communication.\n  In this paper we provide algorithms that are simultaneously round- and message-optimal for a number of well-studied distribut","authors_text":"Bernhard Haeupler, David Wajc, D. Ellis Hershkowitz","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-01-16T06:22:32Z","title":"Round- and Message-Optimal Distributed Graph Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05127","kind":"arxiv","version":3},"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:2e8165a81aee0b6b6a7c14b47c0126826b3dc53bd568a8530850005c21beaa9e","target":"record","created_at":"2026-05-18T00:15:46Z","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":"e8816ec360cb9679109555a16865ec2ebae7cd6dc8a68c85a363a25a7f4c6719","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-01-16T06:22:32Z","title_canon_sha256":"28f9edb925b9a605ca6bd3bf6a07cbea72580a5c10899cb92b9859fa0483c567"},"schema_version":"1.0","source":{"id":"1801.05127","kind":"arxiv","version":3}},"canonical_sha256":"c7ba8449feb262ab7bfa4475a03f522696da91b94c4a6213a99fa7d299f6b271","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c7ba8449feb262ab7bfa4475a03f522696da91b94c4a6213a99fa7d299f6b271","first_computed_at":"2026-05-18T00:15:46.708018Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:46.708018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"loVr2Nqgo2dH9GvgEO/RlpG+ASY93yaVWmQ3eSSH5hLojzUG/AVhmHam4/+J0p0QbO9eH1HOuPvu10y2xu6TCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:46.708560Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.05127","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e8165a81aee0b6b6a7c14b47c0126826b3dc53bd568a8530850005c21beaa9e","sha256:6b190ed1f1db72236fddfcc560df554c27a41ef9fdf5e4ea89bcc74bff54c937"],"state_sha256":"77f1ea4d4479e0fa29d39c4b53ca040f5b7ad0b52fc5c1bd5e52068ded690210"}