{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:2BNPN6Q6QD7ANXRR73I6D73V6Z","short_pith_number":"pith:2BNPN6Q6","schema_version":"1.0","canonical_sha256":"d05af6fa1e80fe06de31fed1e1ff75f660658f9d953f9969b7c165d9a082e47b","source":{"kind":"arxiv","id":"1206.0150","version":1},"attestation_state":"computed","paper":{"title":"Beeping a Maximal Independent Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Alejandro Cornejo, Bernhard Haeupler, Fabian Kuhn, Noga Alon, Yehuda Afek, Ziv Bar-Joseph","submitted_at":"2012-06-01T11:23:30Z","abstract_excerpt":"We consider the problem of computing a maximal independent set (MIS) in an extremely harsh broadcast model that relies only on carrier sensing. The model consists of an anonymous broadcast network in which nodes have no knowledge about the topology of the network or even an upper bound on its size. Furthermore, it is assumed that an adversary chooses at which time slot each node wakes up. At each time slot a node can either beep, that is, emit a signal, or be silent. At a particular time slot, beeping nodes receive no feedback, while silent nodes can only differentiate between none of its neig"},"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":"1206.0150","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-06-01T11:23:30Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"465a0e6c3e31c7809c059ba0145225851dcebe18a45a1c22247a1cd8017f12df","abstract_canon_sha256":"fd0e21d3e6d9fe9424d1f735f22bc9853360d7f87fab1158f57d924baf89a942"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:26.989598Z","signature_b64":"OZh1zytdJ7Z89jSpWGaddkEczGQCvFuLffESHzaYxY1q1fTCGYz4RWfCLX+SrU4Fe5v1XXxOCCtTgSNKT7wADA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d05af6fa1e80fe06de31fed1e1ff75f660658f9d953f9969b7c165d9a082e47b","last_reissued_at":"2026-05-18T03:54:26.988848Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:26.988848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beeping a Maximal Independent Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Alejandro Cornejo, Bernhard Haeupler, Fabian Kuhn, Noga Alon, Yehuda Afek, Ziv Bar-Joseph","submitted_at":"2012-06-01T11:23:30Z","abstract_excerpt":"We consider the problem of computing a maximal independent set (MIS) in an extremely harsh broadcast model that relies only on carrier sensing. The model consists of an anonymous broadcast network in which nodes have no knowledge about the topology of the network or even an upper bound on its size. Furthermore, it is assumed that an adversary chooses at which time slot each node wakes up. At each time slot a node can either beep, that is, emit a signal, or be silent. At a particular time slot, beeping nodes receive no feedback, while silent nodes can only differentiate between none of its neig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.0150","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":"1206.0150","created_at":"2026-05-18T03:54:26.988965+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.0150v1","created_at":"2026-05-18T03:54:26.988965+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.0150","created_at":"2026-05-18T03:54:26.988965+00:00"},{"alias_kind":"pith_short_12","alias_value":"2BNPN6Q6QD7A","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"2BNPN6Q6QD7ANXRR","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"2BNPN6Q6","created_at":"2026-05-18T12:26:50.516681+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/2BNPN6Q6QD7ANXRR73I6D73V6Z","json":"https://pith.science/pith/2BNPN6Q6QD7ANXRR73I6D73V6Z.json","graph_json":"https://pith.science/api/pith-number/2BNPN6Q6QD7ANXRR73I6D73V6Z/graph.json","events_json":"https://pith.science/api/pith-number/2BNPN6Q6QD7ANXRR73I6D73V6Z/events.json","paper":"https://pith.science/paper/2BNPN6Q6"},"agent_actions":{"view_html":"https://pith.science/pith/2BNPN6Q6QD7ANXRR73I6D73V6Z","download_json":"https://pith.science/pith/2BNPN6Q6QD7ANXRR73I6D73V6Z.json","view_paper":"https://pith.science/paper/2BNPN6Q6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.0150&json=true","fetch_graph":"https://pith.science/api/pith-number/2BNPN6Q6QD7ANXRR73I6D73V6Z/graph.json","fetch_events":"https://pith.science/api/pith-number/2BNPN6Q6QD7ANXRR73I6D73V6Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2BNPN6Q6QD7ANXRR73I6D73V6Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2BNPN6Q6QD7ANXRR73I6D73V6Z/action/storage_attestation","attest_author":"https://pith.science/pith/2BNPN6Q6QD7ANXRR73I6D73V6Z/action/author_attestation","sign_citation":"https://pith.science/pith/2BNPN6Q6QD7ANXRR73I6D73V6Z/action/citation_signature","submit_replication":"https://pith.science/pith/2BNPN6Q6QD7ANXRR73I6D73V6Z/action/replication_record"}},"created_at":"2026-05-18T03:54:26.988965+00:00","updated_at":"2026-05-18T03:54:26.988965+00:00"}