{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5Y55NGYTCQH7GH6UKHPPCH7HTE","short_pith_number":"pith:5Y55NGYT","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"},"canonical_sha256":"ee3bd69b13140ff31fd451def11fe799374759008e3b4025dc96d432655b18d6","source":{"kind":"arxiv","id":"1805.07209","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5Y55NGYTCQH7GH6UKHPPCH7HTE","target":"record","payload":{"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"},"canonical_sha256":"ee3bd69b13140ff31fd451def11fe799374759008e3b4025dc96d432655b18d6","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"},"source_kind":"arxiv","source_id":"1805.07209","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:15:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YqnieBzJN6OhOep17qS/f6SttLd9K7J4qNvr45TknSvXl4Jvbw/JQ6+1snqBKcVtRoF1WPiX/hcRKx6QarStDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:20:46.741269Z"},"content_sha256":"ec694bf515680ae8773782ec0fc0418196410177898f419a56367efa9e13c447","schema_version":"1.0","event_id":"sha256:ec694bf515680ae8773782ec0fc0418196410177898f419a56367efa9e13c447"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5Y55NGYTCQH7GH6UKHPPCH7HTE","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:15:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CJpSLWJeF8hOYw10OUcnnPTgW5d8i61+Pe+0RQbClMpHLglC55vaTMLgSPF0nN7utOZJhWUGWM0cz13Pl8jkAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:20:46.741969Z"},"content_sha256":"18747b3aab937ec8da5bb5b8741a1e27a4aebf0ad63f4e78f2d63b7430d64e21","schema_version":"1.0","event_id":"sha256:18747b3aab937ec8da5bb5b8741a1e27a4aebf0ad63f4e78f2d63b7430d64e21"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5Y55NGYTCQH7GH6UKHPPCH7HTE/bundle.json","state_url":"https://pith.science/pith/5Y55NGYTCQH7GH6UKHPPCH7HTE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5Y55NGYTCQH7GH6UKHPPCH7HTE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T06:20:46Z","links":{"resolver":"https://pith.science/pith/5Y55NGYTCQH7GH6UKHPPCH7HTE","bundle":"https://pith.science/pith/5Y55NGYTCQH7GH6UKHPPCH7HTE/bundle.json","state":"https://pith.science/pith/5Y55NGYTCQH7GH6UKHPPCH7HTE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5Y55NGYTCQH7GH6UKHPPCH7HTE/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B2sJIoSln9Zz5p5lHxfAbXmklWLrkBPlXaOF6WUPNtjTsJYsrpzTzbpn33g7E7YiHbGuvsGFuNhhENDYQ/CFBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T06:20:46.745996Z","bundle_sha256":"9d93bd4d62283ca9a155fc3754f79eb76e0ef077b109fa97bb4ce2910f2c64f9"}}