{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5Y55NGYTCQH7GH6UKHPPCH7HTE","short_pith_number":"pith:5Y55NGYT","schema_version":"1.0","canonical_sha256":"ee3bd69b13140ff31fd451def11fe799374759008e3b4025dc96d432655b18d6","source":{"kind":"arxiv","id":"1805.07209","version":1},"attestation_state":"computed","paper":{"title":"Deterministic Distributed Ruling Sets of Line Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Fabian Kuhn, Simon Weidner, Yannic Maus","submitted_at":"2018-05-18T13:52:42Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1805.07209","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-18T13:52:42Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"d4622908d35695ed59a3f793dbf9a78e08fe2f8e4df3df9a818b646dbdaa7b21","abstract_canon_sha256":"03cb924d1a98d29f7ec4344bfe576f28dc94a58a552cacfaf6f66531667cb380"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:38.918553Z","signature_b64":"W7INpJSfeqkoMA4u15SYv1NI1QKkjOOd3PmwFaPIAd5uHmK5Y+g2+kCeGNZiJkP7vNxJFvMoPlzI+2cN9UWZCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee3bd69b13140ff31fd451def11fe799374759008e3b4025dc96d432655b18d6","last_reissued_at":"2026-05-18T00:15:38.918037Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:38.918037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic Distributed Ruling Sets of Line Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Fabian Kuhn, Simon Weidner, Yannic Maus","submitted_at":"2018-05-18T13:52:42Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07209","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.07209","created_at":"2026-05-18T00:15:38.918119+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.07209v1","created_at":"2026-05-18T00:15:38.918119+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07209","created_at":"2026-05-18T00:15:38.918119+00:00"},{"alias_kind":"pith_short_12","alias_value":"5Y55NGYTCQH7","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5Y55NGYTCQH7GH6U","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5Y55NGYT","created_at":"2026-05-18T12:32:08.215937+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5Y55NGYTCQH7GH6UKHPPCH7HTE","json":"https://pith.science/pith/5Y55NGYTCQH7GH6UKHPPCH7HTE.json","graph_json":"https://pith.science/api/pith-number/5Y55NGYTCQH7GH6UKHPPCH7HTE/graph.json","events_json":"https://pith.science/api/pith-number/5Y55NGYTCQH7GH6UKHPPCH7HTE/events.json","paper":"https://pith.science/paper/5Y55NGYT"},"agent_actions":{"view_html":"https://pith.science/pith/5Y55NGYTCQH7GH6UKHPPCH7HTE","download_json":"https://pith.science/pith/5Y55NGYTCQH7GH6UKHPPCH7HTE.json","view_paper":"https://pith.science/paper/5Y55NGYT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.07209&json=true","fetch_graph":"https://pith.science/api/pith-number/5Y55NGYTCQH7GH6UKHPPCH7HTE/graph.json","fetch_events":"https://pith.science/api/pith-number/5Y55NGYTCQH7GH6UKHPPCH7HTE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5Y55NGYTCQH7GH6UKHPPCH7HTE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5Y55NGYTCQH7GH6UKHPPCH7HTE/action/storage_attestation","attest_author":"https://pith.science/pith/5Y55NGYTCQH7GH6UKHPPCH7HTE/action/author_attestation","sign_citation":"https://pith.science/pith/5Y55NGYTCQH7GH6UKHPPCH7HTE/action/citation_signature","submit_replication":"https://pith.science/pith/5Y55NGYTCQH7GH6UKHPPCH7HTE/action/replication_record"}},"created_at":"2026-05-18T00:15:38.918119+00:00","updated_at":"2026-05-18T00:15:38.918119+00:00"}