{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5Y55NGYTCQH7GH6UKHPPCH7HTE","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":"03cb924d1a98d29f7ec4344bfe576f28dc94a58a552cacfaf6f66531667cb380","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-18T13:52:42Z","title_canon_sha256":"d4622908d35695ed59a3f793dbf9a78e08fe2f8e4df3df9a818b646dbdaa7b21"},"schema_version":"1.0","source":{"id":"1805.07209","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.07209","created_at":"2026-05-18T00:15:38Z"},{"alias_kind":"arxiv_version","alias_value":"1805.07209v1","created_at":"2026-05-18T00:15:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07209","created_at":"2026-05-18T00:15:38Z"},{"alias_kind":"pith_short_12","alias_value":"5Y55NGYTCQH7","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5Y55NGYTCQH7GH6U","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5Y55NGYT","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:18747b3aab937ec8da5bb5b8741a1e27a4aebf0ad63f4e78f2d63b7430d64e21","target":"graph","created_at":"2026-05-18T00:15:38Z","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":"An $(\\alpha,\\beta)$-ruling set of a graph $G=(V,E)$ is a set $R\\subseteq V$ such that for any node $v\\in V$ there is a node $u\\in R$ in distance at most $\\beta$ from $v$ and such that any two nodes in $R$ are at distance at least $\\alpha$ from each other. The concept of ruling sets can naturally be extended to edges, i.e., a subset $F\\subseteq E$ is an $(\\alpha,\\beta)$-ruling edge set of a graph $G=(V,E)$ if the corresponding nodes form an $(\\alpha,\\beta)$-ruling set in the line graph of $G$. This paper presents a simple deterministic, distributed algorithm, in the $\\mathsf{CONGEST}$ model, fo","authors_text":"Fabian Kuhn, Simon Weidner, Yannic Maus","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-18T13:52:42Z","title":"Deterministic Distributed Ruling Sets of Line Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07209","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:ec694bf515680ae8773782ec0fc0418196410177898f419a56367efa9e13c447","target":"record","created_at":"2026-05-18T00:15:38Z","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":"03cb924d1a98d29f7ec4344bfe576f28dc94a58a552cacfaf6f66531667cb380","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-18T13:52:42Z","title_canon_sha256":"d4622908d35695ed59a3f793dbf9a78e08fe2f8e4df3df9a818b646dbdaa7b21"},"schema_version":"1.0","source":{"id":"1805.07209","kind":"arxiv","version":1}},"canonical_sha256":"ee3bd69b13140ff31fd451def11fe799374759008e3b4025dc96d432655b18d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee3bd69b13140ff31fd451def11fe799374759008e3b4025dc96d432655b18d6","first_computed_at":"2026-05-18T00:15:38.918037Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:38.918037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W7INpJSfeqkoMA4u15SYv1NI1QKkjOOd3PmwFaPIAd5uHmK5Y+g2+kCeGNZiJkP7vNxJFvMoPlzI+2cN9UWZCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:38.918553Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.07209","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec694bf515680ae8773782ec0fc0418196410177898f419a56367efa9e13c447","sha256:18747b3aab937ec8da5bb5b8741a1e27a4aebf0ad63f4e78f2d63b7430d64e21"],"state_sha256":"c17b9554750224c4115fa1a75b7b920f76953e36fb793e8a57d389ded4b1608d"}