{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6PFPMLXAATISBTAJDNW4PIJOON","short_pith_number":"pith:6PFPMLXA","canonical_record":{"source":{"id":"1705.07861","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2017-05-22T17:08:21Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"cc338141c963f4c34a67fd195d6ec560d71d44249c04f1af0d949302aa81790a","abstract_canon_sha256":"13766bf325fe8ace8456b04a6eb898764ef348eacd72e23d4b5cd36adfed490c"},"schema_version":"1.0"},"canonical_sha256":"f3caf62ee004d120cc091b6dc7a12e7349508dc4f6b44e6521864996a24f3c0b","source":{"kind":"arxiv","id":"1705.07861","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07861","created_at":"2026-05-18T00:43:44Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07861v1","created_at":"2026-05-18T00:43:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07861","created_at":"2026-05-18T00:43:44Z"},{"alias_kind":"pith_short_12","alias_value":"6PFPMLXAATIS","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6PFPMLXAATISBTAJ","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6PFPMLXA","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6PFPMLXAATISBTAJDNW4PIJOON","target":"record","payload":{"canonical_record":{"source":{"id":"1705.07861","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2017-05-22T17:08:21Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"cc338141c963f4c34a67fd195d6ec560d71d44249c04f1af0d949302aa81790a","abstract_canon_sha256":"13766bf325fe8ace8456b04a6eb898764ef348eacd72e23d4b5cd36adfed490c"},"schema_version":"1.0"},"canonical_sha256":"f3caf62ee004d120cc091b6dc7a12e7349508dc4f6b44e6521864996a24f3c0b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:44.801602Z","signature_b64":"K6cLx+cKytWbz603iUpAq1pZIVEmpHt1lfN3ZqK4UFHmSWYUAPMWRSCXkwMy5swwVUGXIOmfkqX/Bfpep78bCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3caf62ee004d120cc091b6dc7a12e7349508dc4f6b44e6521864996a24f3c0b","last_reissued_at":"2026-05-18T00:43:44.801009Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:44.801009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.07861","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:43:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"67yelC0PLbDCAWWrCRJdDq7hz/JIIzotbk6+gPEB4mCpqR2xF49QZdk4g/XTH8Pbc6Ifi2wShhQjFDdlUdNSCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:18:43.504425Z"},"content_sha256":"cbf9f9e6c3d85bef54f242fd43571fdc4d2b2a76d4418d517be009499da23ba1","schema_version":"1.0","event_id":"sha256:cbf9f9e6c3d85bef54f242fd43571fdc4d2b2a76d4418d517be009499da23ba1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6PFPMLXAATISBTAJDNW4PIJOON","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Symmetry Breaking in the Congest Model: Time- and Message-Efficient Algorithms for Ruling Sets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Gopal Pandurangan, Peter Robinson, Shreyas Pai, Sriram V. Pemmaraju, Talal Riaz","submitted_at":"2017-05-22T17:08:21Z","abstract_excerpt":"We study local symmetry breaking problems in the CONGEST model, focusing on ruling set problems, which generalize the fundamental Maximal Independent Set (MIS) problem. A $\\beta$-ruling set is an independent set such that every node in the graph is at most $\\beta$ hops from a node in the independent set. Our work is motivated by the following central question: can we break the $\\Theta(\\log n)$ time complexity barrier and the $\\Theta(m)$ message complexity barrier in the CONGEST model for MIS or closely-related symmetry breaking problems? We present the following results:\n  - Time Complexity: W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07861","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:43:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GJF24tvfjRxQZRIkQIyCfyDKPtwKEVIrNnP0rVVz0tKHJ+AGlleRpSZn1kLN0rhyLTC2r5MxT8VzbSMM34RnBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:18:43.505171Z"},"content_sha256":"5f50a441e4683b8670b4acc80b9d3b8118727f022cfe29474737f49e2eec7dce","schema_version":"1.0","event_id":"sha256:5f50a441e4683b8670b4acc80b9d3b8118727f022cfe29474737f49e2eec7dce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6PFPMLXAATISBTAJDNW4PIJOON/bundle.json","state_url":"https://pith.science/pith/6PFPMLXAATISBTAJDNW4PIJOON/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6PFPMLXAATISBTAJDNW4PIJOON/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-06-06T08:18:43Z","links":{"resolver":"https://pith.science/pith/6PFPMLXAATISBTAJDNW4PIJOON","bundle":"https://pith.science/pith/6PFPMLXAATISBTAJDNW4PIJOON/bundle.json","state":"https://pith.science/pith/6PFPMLXAATISBTAJDNW4PIJOON/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6PFPMLXAATISBTAJDNW4PIJOON/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6PFPMLXAATISBTAJDNW4PIJOON","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":"13766bf325fe8ace8456b04a6eb898764ef348eacd72e23d4b5cd36adfed490c","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2017-05-22T17:08:21Z","title_canon_sha256":"cc338141c963f4c34a67fd195d6ec560d71d44249c04f1af0d949302aa81790a"},"schema_version":"1.0","source":{"id":"1705.07861","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07861","created_at":"2026-05-18T00:43:44Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07861v1","created_at":"2026-05-18T00:43:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07861","created_at":"2026-05-18T00:43:44Z"},{"alias_kind":"pith_short_12","alias_value":"6PFPMLXAATIS","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6PFPMLXAATISBTAJ","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6PFPMLXA","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:5f50a441e4683b8670b4acc80b9d3b8118727f022cfe29474737f49e2eec7dce","target":"graph","created_at":"2026-05-18T00:43:44Z","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":"We study local symmetry breaking problems in the CONGEST model, focusing on ruling set problems, which generalize the fundamental Maximal Independent Set (MIS) problem. A $\\beta$-ruling set is an independent set such that every node in the graph is at most $\\beta$ hops from a node in the independent set. Our work is motivated by the following central question: can we break the $\\Theta(\\log n)$ time complexity barrier and the $\\Theta(m)$ message complexity barrier in the CONGEST model for MIS or closely-related symmetry breaking problems? We present the following results:\n  - Time Complexity: W","authors_text":"Gopal Pandurangan, Peter Robinson, Shreyas Pai, Sriram V. Pemmaraju, Talal Riaz","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2017-05-22T17:08:21Z","title":"Symmetry Breaking in the Congest Model: Time- and Message-Efficient Algorithms for Ruling Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07861","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:cbf9f9e6c3d85bef54f242fd43571fdc4d2b2a76d4418d517be009499da23ba1","target":"record","created_at":"2026-05-18T00:43:44Z","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":"13766bf325fe8ace8456b04a6eb898764ef348eacd72e23d4b5cd36adfed490c","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2017-05-22T17:08:21Z","title_canon_sha256":"cc338141c963f4c34a67fd195d6ec560d71d44249c04f1af0d949302aa81790a"},"schema_version":"1.0","source":{"id":"1705.07861","kind":"arxiv","version":1}},"canonical_sha256":"f3caf62ee004d120cc091b6dc7a12e7349508dc4f6b44e6521864996a24f3c0b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f3caf62ee004d120cc091b6dc7a12e7349508dc4f6b44e6521864996a24f3c0b","first_computed_at":"2026-05-18T00:43:44.801009Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:44.801009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K6cLx+cKytWbz603iUpAq1pZIVEmpHt1lfN3ZqK4UFHmSWYUAPMWRSCXkwMy5swwVUGXIOmfkqX/Bfpep78bCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:44.801602Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.07861","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cbf9f9e6c3d85bef54f242fd43571fdc4d2b2a76d4418d517be009499da23ba1","sha256:5f50a441e4683b8670b4acc80b9d3b8118727f022cfe29474737f49e2eec7dce"],"state_sha256":"818777fe50ad837a145cd95ef8edb28294f855d50c1933634f6be558a9180a52"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3wzP6ZAT+M92JM6mTVSTwF0zdymqjjwQqSrtsLpLXe7Gr6L6wk153XgNd+jWZIRXcbzdFJrzOd5G2qh+ZTMsAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T08:18:43.508836Z","bundle_sha256":"5e7b5ff59e219389689c22ce2ac058d7c9680f18ef108f355f3d4e47c753e8e5"}}