{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:FDK4OQEHHJTNQMW2NPVKWJX2MQ","short_pith_number":"pith:FDK4OQEH","schema_version":"1.0","canonical_sha256":"28d5c740873a66d832da6beaab26fa643447412d0a17149f249372893dec8b72","source":{"kind":"arxiv","id":"1207.3099","version":1},"attestation_state":"computed","paper":{"title":"Super-Fast 3-Ruling Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Kishore Kothapalli, Sriram Pemmaraju","submitted_at":"2012-07-12T21:02:17Z","abstract_excerpt":"A $t$-ruling set of a graph $G = (V, E)$ is a vertex-subset $S \\subseteq V$ that is independent and satisfies the property that every vertex $v \\in V$ is at a distance of at most $t$ from some vertex in $S$. A \\textit{maximal independent set (MIS)} is a 1-ruling set. The problem of computing an MIS on a network is a fundamental problem in distributed algorithms and the fastest algorithm for this problem is the $O(\\log n)$-round algorithm due to Luby (SICOMP 1986) and Alon et al. (J. Algorithms 1986) from more than 25 years ago. Since then the problem has resisted all efforts to yield to a sub-"},"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":"1207.3099","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-07-12T21:02:17Z","cross_cats_sorted":[],"title_canon_sha256":"ba306dbe576dc4f2ba2aa378596e6c43799e181dd722eb3423dc9ad4b0d6b392","abstract_canon_sha256":"f75fbcdcec6523875dc305170830e3a067bf78b0ac556318dc6f96bd8e772dd5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:12.452014Z","signature_b64":"sgGi0U05B/angOrJEpd/B8uPTek+E0/niiSswIhBmJvBVZF8PADl2xGbkB/m5vnBGof0ZzCjkg2K0ME5FUaDBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28d5c740873a66d832da6beaab26fa643447412d0a17149f249372893dec8b72","last_reissued_at":"2026-05-18T03:51:12.451436Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:12.451436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Super-Fast 3-Ruling Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Kishore Kothapalli, Sriram Pemmaraju","submitted_at":"2012-07-12T21:02:17Z","abstract_excerpt":"A $t$-ruling set of a graph $G = (V, E)$ is a vertex-subset $S \\subseteq V$ that is independent and satisfies the property that every vertex $v \\in V$ is at a distance of at most $t$ from some vertex in $S$. A \\textit{maximal independent set (MIS)} is a 1-ruling set. The problem of computing an MIS on a network is a fundamental problem in distributed algorithms and the fastest algorithm for this problem is the $O(\\log n)$-round algorithm due to Luby (SICOMP 1986) and Alon et al. (J. Algorithms 1986) from more than 25 years ago. Since then the problem has resisted all efforts to yield to a sub-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3099","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":"1207.3099","created_at":"2026-05-18T03:51:12.451529+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.3099v1","created_at":"2026-05-18T03:51:12.451529+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3099","created_at":"2026-05-18T03:51:12.451529+00:00"},{"alias_kind":"pith_short_12","alias_value":"FDK4OQEHHJTN","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"FDK4OQEHHJTNQMW2","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"FDK4OQEH","created_at":"2026-05-18T12:27:06.952714+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/FDK4OQEHHJTNQMW2NPVKWJX2MQ","json":"https://pith.science/pith/FDK4OQEHHJTNQMW2NPVKWJX2MQ.json","graph_json":"https://pith.science/api/pith-number/FDK4OQEHHJTNQMW2NPVKWJX2MQ/graph.json","events_json":"https://pith.science/api/pith-number/FDK4OQEHHJTNQMW2NPVKWJX2MQ/events.json","paper":"https://pith.science/paper/FDK4OQEH"},"agent_actions":{"view_html":"https://pith.science/pith/FDK4OQEHHJTNQMW2NPVKWJX2MQ","download_json":"https://pith.science/pith/FDK4OQEHHJTNQMW2NPVKWJX2MQ.json","view_paper":"https://pith.science/paper/FDK4OQEH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.3099&json=true","fetch_graph":"https://pith.science/api/pith-number/FDK4OQEHHJTNQMW2NPVKWJX2MQ/graph.json","fetch_events":"https://pith.science/api/pith-number/FDK4OQEHHJTNQMW2NPVKWJX2MQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FDK4OQEHHJTNQMW2NPVKWJX2MQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FDK4OQEHHJTNQMW2NPVKWJX2MQ/action/storage_attestation","attest_author":"https://pith.science/pith/FDK4OQEHHJTNQMW2NPVKWJX2MQ/action/author_attestation","sign_citation":"https://pith.science/pith/FDK4OQEHHJTNQMW2NPVKWJX2MQ/action/citation_signature","submit_replication":"https://pith.science/pith/FDK4OQEHHJTNQMW2NPVKWJX2MQ/action/replication_record"}},"created_at":"2026-05-18T03:51:12.451529+00:00","updated_at":"2026-05-18T03:51:12.451529+00:00"}