{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:SC25INRKTB3I2KX6NC5LPAH5Q7","short_pith_number":"pith:SC25INRK","schema_version":"1.0","canonical_sha256":"90b5d4362a98768d2afe68bab780fd87d8366a89c154df7505af218cc8ec4873","source":{"kind":"arxiv","id":"1108.1926","version":1},"attestation_state":"computed","paper":{"title":"Computing a Maximal Independent Set Using Beeps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Alejandro Cornejo, Bernhard Haeupler, Fabian Kuhn","submitted_at":"2011-08-09T13:42:00Z","abstract_excerpt":"We consider the problem of finding a maximal independent set (MIS) in the discrete beeping model. At each time, a node in the network can either beep (i.e., emit a signal) or be silent. Silent nodes can only differentiate between no neighbor beeping, or at least one neighbor beeping. This basic communication model relies only on carrier-sensing. Furthermore, we assume nothing about the underlying communication graph and allow nodes to wake up (and crash) arbitrarily.\n  We show that if a polynomial upper bound on the size of the network n is known, then with high probability every node becomes "},"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":"1108.1926","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-08-09T13:42:00Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f024f2b1a4bab2c806f2105ca1d5d1339db024378ca100fe03b654143dd518a8","abstract_canon_sha256":"3cd5d38c49368b309a41ecab9a031d9c1c54793aa13c24502728f88c653395ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:50.877416Z","signature_b64":"7na+gW8x+OB8EWa+FnlRInQGvN8ESy3nac0Rnv1yCITbbKZFaew6XPLDvACcCXzELZtq2ow/hLZCDy2kXQTHAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90b5d4362a98768d2afe68bab780fd87d8366a89c154df7505af218cc8ec4873","last_reissued_at":"2026-05-18T04:15:50.876777Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:50.876777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing a Maximal Independent Set Using Beeps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Alejandro Cornejo, Bernhard Haeupler, Fabian Kuhn","submitted_at":"2011-08-09T13:42:00Z","abstract_excerpt":"We consider the problem of finding a maximal independent set (MIS) in the discrete beeping model. At each time, a node in the network can either beep (i.e., emit a signal) or be silent. Silent nodes can only differentiate between no neighbor beeping, or at least one neighbor beeping. This basic communication model relies only on carrier-sensing. Furthermore, we assume nothing about the underlying communication graph and allow nodes to wake up (and crash) arbitrarily.\n  We show that if a polynomial upper bound on the size of the network n is known, then with high probability every node becomes "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.1926","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":"1108.1926","created_at":"2026-05-18T04:15:50.876859+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.1926v1","created_at":"2026-05-18T04:15:50.876859+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1926","created_at":"2026-05-18T04:15:50.876859+00:00"},{"alias_kind":"pith_short_12","alias_value":"SC25INRKTB3I","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"SC25INRKTB3I2KX6","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"SC25INRK","created_at":"2026-05-18T12:26:41.206345+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/SC25INRKTB3I2KX6NC5LPAH5Q7","json":"https://pith.science/pith/SC25INRKTB3I2KX6NC5LPAH5Q7.json","graph_json":"https://pith.science/api/pith-number/SC25INRKTB3I2KX6NC5LPAH5Q7/graph.json","events_json":"https://pith.science/api/pith-number/SC25INRKTB3I2KX6NC5LPAH5Q7/events.json","paper":"https://pith.science/paper/SC25INRK"},"agent_actions":{"view_html":"https://pith.science/pith/SC25INRKTB3I2KX6NC5LPAH5Q7","download_json":"https://pith.science/pith/SC25INRKTB3I2KX6NC5LPAH5Q7.json","view_paper":"https://pith.science/paper/SC25INRK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.1926&json=true","fetch_graph":"https://pith.science/api/pith-number/SC25INRKTB3I2KX6NC5LPAH5Q7/graph.json","fetch_events":"https://pith.science/api/pith-number/SC25INRKTB3I2KX6NC5LPAH5Q7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SC25INRKTB3I2KX6NC5LPAH5Q7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SC25INRKTB3I2KX6NC5LPAH5Q7/action/storage_attestation","attest_author":"https://pith.science/pith/SC25INRKTB3I2KX6NC5LPAH5Q7/action/author_attestation","sign_citation":"https://pith.science/pith/SC25INRKTB3I2KX6NC5LPAH5Q7/action/citation_signature","submit_replication":"https://pith.science/pith/SC25INRKTB3I2KX6NC5LPAH5Q7/action/replication_record"}},"created_at":"2026-05-18T04:15:50.876859+00:00","updated_at":"2026-05-18T04:15:50.876859+00:00"}