{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:46G7FXRUVN7X452HHK2VC5HQH7","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":"fa3ad53dceeec9cb19cd5f9f34505b758a7b623c6dc62ccc12bad304802c20a8","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-10T11:53:00Z","title_canon_sha256":"feb0d746b10c324cd34a3ba4cfebdd1e3ba31e6d93cf0f1080222a4bab48e4d9"},"schema_version":"1.0","source":{"id":"2606.11974","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.11974","created_at":"2026-06-11T01:10:40Z"},{"alias_kind":"arxiv_version","alias_value":"2606.11974v1","created_at":"2026-06-11T01:10:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.11974","created_at":"2026-06-11T01:10:40Z"},{"alias_kind":"pith_short_12","alias_value":"46G7FXRUVN7X","created_at":"2026-06-11T01:10:40Z"},{"alias_kind":"pith_short_16","alias_value":"46G7FXRUVN7X452H","created_at":"2026-06-11T01:10:40Z"},{"alias_kind":"pith_short_8","alias_value":"46G7FXRU","created_at":"2026-06-11T01:10:40Z"}],"graph_snapshots":[{"event_id":"sha256:8fbce95e1d76f419ad4db3a1a78b1a318917125ff8ec06e2d67cdd4f32849543","target":"graph","created_at":"2026-06-11T01:10:40Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.11974/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a graph $G=(V,E)$, a $\\beta$-ruling set is a subset of nodes $S\\subseteq V$ that is independent, and each node in $V$ is at distance at most $\\beta$ from some node in $S$. In this paper, we present almost optimal distributed algorithms for finding $2$-ruling sets in the classical \\LOCAL model. Our main contribution is a randomized algorithm that w.h.p.\\ computes a $2$-ruling set on any $n$-node graph with bounded arboricity in $O(\\log \\log n)$ rounds. In fact, the algorithm works up to arboricity $O(\\log\\log n)$, improves exponentially over the prior state of the art that can be achieved","authors_text":"Jara Uitto, Malte Baumecker, Rustam Latypov, Yannic Maus","cross_cats":["cs.DC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-10T11:53:00Z","title":"Near-Optimal Distributed 2-Ruling Sets on Graphs with Low Arboricity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.11974","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:5e4e3f669a2c80365f9f476409f959795c95666dc4e334034203875a3f0a2b08","target":"record","created_at":"2026-06-11T01:10:40Z","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":"fa3ad53dceeec9cb19cd5f9f34505b758a7b623c6dc62ccc12bad304802c20a8","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-10T11:53:00Z","title_canon_sha256":"feb0d746b10c324cd34a3ba4cfebdd1e3ba31e6d93cf0f1080222a4bab48e4d9"},"schema_version":"1.0","source":{"id":"2606.11974","kind":"arxiv","version":1}},"canonical_sha256":"e78df2de34ab7f7e77473ab55174f03ffdfa5cd16cea357ab20885363d72a656","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e78df2de34ab7f7e77473ab55174f03ffdfa5cd16cea357ab20885363d72a656","first_computed_at":"2026-06-11T01:10:40.449012Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-11T01:10:40.449012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F8cgGG0XEJaM9AbZxfoJypD5A5JrVNqsb8F/yc27jzO1/IXUcwyXIABeju3yfIGD2266kiWfa/SHzwWKAaiIBw==","signature_status":"signed_v1","signed_at":"2026-06-11T01:10:40.450137Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.11974","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e4e3f669a2c80365f9f476409f959795c95666dc4e334034203875a3f0a2b08","sha256:8fbce95e1d76f419ad4db3a1a78b1a318917125ff8ec06e2d67cdd4f32849543"],"state_sha256":"7ba13175c85819035685a42544546a3b54ee168f527a249dd1d6cd5339719db2"}