{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5RBP6JGL2C6OHE6422B6F4ELYA","short_pith_number":"pith:5RBP6JGL","schema_version":"1.0","canonical_sha256":"ec42ff24cbd0bce393dcd683e2f08bc039603323f40100f45192c6cc45f34722","source":{"kind":"arxiv","id":"1704.07133","version":1},"attestation_state":"computed","paper":{"title":"Beeping a Maximal Independent Set Fast","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Nancy Lynch, Stephan Holzer","submitted_at":"2017-04-24T10:42:37Z","abstract_excerpt":"We adapt a recent algorithm by Ghaffari [SODA'16] for computing a Maximal Independent Set in the LOCAL model, so that it works in the significantly weaker BEEP model. For networks with maximum degree $\\Delta$, our algorithm terminates locally within time $O((\\log \\Delta + \\log (1/\\epsilon)) \\cdot \\log(1/\\epsilon))$, with probability at least $1 - \\epsilon$. The key idea of the modification is to replace explicit messages about transmission probabilities with estimates based on the number of received messages.\n  After the successful introduction (and implicit use) of local analysis, e.g., by Ba"},"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":"1704.07133","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-04-24T10:42:37Z","cross_cats_sorted":[],"title_canon_sha256":"6ac6a713bf2b93cc3de8141877e852fc39d123fae1a9757405b27ea8f8229896","abstract_canon_sha256":"9b6c69c8a892a32c8201d8745bc2578c26839f08e18e795afa8271e9db57dcfb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:53.467125Z","signature_b64":"9VDHdj/TJh0Yh5GZMaL04IBd3uf06SdGlfXrcshWqVJUh6wnHc25G6nbvrTzLOx4O30qOx+Msjg0myfHWJxIAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec42ff24cbd0bce393dcd683e2f08bc039603323f40100f45192c6cc45f34722","last_reissued_at":"2026-05-18T00:45:53.466546Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:53.466546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beeping a Maximal Independent Set Fast","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Nancy Lynch, Stephan Holzer","submitted_at":"2017-04-24T10:42:37Z","abstract_excerpt":"We adapt a recent algorithm by Ghaffari [SODA'16] for computing a Maximal Independent Set in the LOCAL model, so that it works in the significantly weaker BEEP model. For networks with maximum degree $\\Delta$, our algorithm terminates locally within time $O((\\log \\Delta + \\log (1/\\epsilon)) \\cdot \\log(1/\\epsilon))$, with probability at least $1 - \\epsilon$. The key idea of the modification is to replace explicit messages about transmission probabilities with estimates based on the number of received messages.\n  After the successful introduction (and implicit use) of local analysis, e.g., by Ba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.07133","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":"1704.07133","created_at":"2026-05-18T00:45:53.466630+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.07133v1","created_at":"2026-05-18T00:45:53.466630+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07133","created_at":"2026-05-18T00:45:53.466630+00:00"},{"alias_kind":"pith_short_12","alias_value":"5RBP6JGL2C6O","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"5RBP6JGL2C6OHE64","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"5RBP6JGL","created_at":"2026-05-18T12:31:00.734936+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/5RBP6JGL2C6OHE6422B6F4ELYA","json":"https://pith.science/pith/5RBP6JGL2C6OHE6422B6F4ELYA.json","graph_json":"https://pith.science/api/pith-number/5RBP6JGL2C6OHE6422B6F4ELYA/graph.json","events_json":"https://pith.science/api/pith-number/5RBP6JGL2C6OHE6422B6F4ELYA/events.json","paper":"https://pith.science/paper/5RBP6JGL"},"agent_actions":{"view_html":"https://pith.science/pith/5RBP6JGL2C6OHE6422B6F4ELYA","download_json":"https://pith.science/pith/5RBP6JGL2C6OHE6422B6F4ELYA.json","view_paper":"https://pith.science/paper/5RBP6JGL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.07133&json=true","fetch_graph":"https://pith.science/api/pith-number/5RBP6JGL2C6OHE6422B6F4ELYA/graph.json","fetch_events":"https://pith.science/api/pith-number/5RBP6JGL2C6OHE6422B6F4ELYA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5RBP6JGL2C6OHE6422B6F4ELYA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5RBP6JGL2C6OHE6422B6F4ELYA/action/storage_attestation","attest_author":"https://pith.science/pith/5RBP6JGL2C6OHE6422B6F4ELYA/action/author_attestation","sign_citation":"https://pith.science/pith/5RBP6JGL2C6OHE6422B6F4ELYA/action/citation_signature","submit_replication":"https://pith.science/pith/5RBP6JGL2C6OHE6422B6F4ELYA/action/replication_record"}},"created_at":"2026-05-18T00:45:53.466630+00:00","updated_at":"2026-05-18T00:45:53.466630+00:00"}