{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:SC25INRKTB3I2KX6NC5LPAH5Q7","short_pith_number":"pith:SC25INRK","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"},"canonical_sha256":"90b5d4362a98768d2afe68bab780fd87d8366a89c154df7505af218cc8ec4873","source":{"kind":"arxiv","id":"1108.1926","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.1926","created_at":"2026-05-18T04:15:50Z"},{"alias_kind":"arxiv_version","alias_value":"1108.1926v1","created_at":"2026-05-18T04:15:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1926","created_at":"2026-05-18T04:15:50Z"},{"alias_kind":"pith_short_12","alias_value":"SC25INRKTB3I","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SC25INRKTB3I2KX6","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SC25INRK","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:SC25INRKTB3I2KX6NC5LPAH5Q7","target":"record","payload":{"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"},"canonical_sha256":"90b5d4362a98768d2afe68bab780fd87d8366a89c154df7505af218cc8ec4873","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"},"source_kind":"arxiv","source_id":"1108.1926","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-18T04:15:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ik5Ckuri09nkNfkV1idzQwT4XJV/E29iXsWvif3bfKplfiiXNw+IIqGnozebhrGISyxVOAMtnkN0q6Q86q/2CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:18:02.801887Z"},"content_sha256":"6e0b1d3769373a36926ba902b89caac40a41afbb3a9a63ee1ecf39ccd455dd24","schema_version":"1.0","event_id":"sha256:6e0b1d3769373a36926ba902b89caac40a41afbb3a9a63ee1ecf39ccd455dd24"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:SC25INRKTB3I2KX6NC5LPAH5Q7","target":"graph","payload":{"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"},"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-18T04:15:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S2KE5qhwP/vDRA3O7Q8mjHzpLhY1t3spEHXO2uL/2Al5nImmmolZrwDBq+JmCH9+I4UCmeGEhwiqnGLP8xzOBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:18:02.802551Z"},"content_sha256":"2dbc3346ba234bf52c4ab2bd8acd98baef1cb9aa1ad0f11596a62942b1c52e1e","schema_version":"1.0","event_id":"sha256:2dbc3346ba234bf52c4ab2bd8acd98baef1cb9aa1ad0f11596a62942b1c52e1e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SC25INRKTB3I2KX6NC5LPAH5Q7/bundle.json","state_url":"https://pith.science/pith/SC25INRKTB3I2KX6NC5LPAH5Q7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SC25INRKTB3I2KX6NC5LPAH5Q7/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-05-26T11:18:02Z","links":{"resolver":"https://pith.science/pith/SC25INRKTB3I2KX6NC5LPAH5Q7","bundle":"https://pith.science/pith/SC25INRKTB3I2KX6NC5LPAH5Q7/bundle.json","state":"https://pith.science/pith/SC25INRKTB3I2KX6NC5LPAH5Q7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SC25INRKTB3I2KX6NC5LPAH5Q7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:SC25INRKTB3I2KX6NC5LPAH5Q7","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":"3cd5d38c49368b309a41ecab9a031d9c1c54793aa13c24502728f88c653395ac","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-08-09T13:42:00Z","title_canon_sha256":"f024f2b1a4bab2c806f2105ca1d5d1339db024378ca100fe03b654143dd518a8"},"schema_version":"1.0","source":{"id":"1108.1926","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.1926","created_at":"2026-05-18T04:15:50Z"},{"alias_kind":"arxiv_version","alias_value":"1108.1926v1","created_at":"2026-05-18T04:15:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1926","created_at":"2026-05-18T04:15:50Z"},{"alias_kind":"pith_short_12","alias_value":"SC25INRKTB3I","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SC25INRKTB3I2KX6","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SC25INRK","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:2dbc3346ba234bf52c4ab2bd8acd98baef1cb9aa1ad0f11596a62942b1c52e1e","target":"graph","created_at":"2026-05-18T04:15:50Z","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 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 ","authors_text":"Alejandro Cornejo, Bernhard Haeupler, Fabian Kuhn","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-08-09T13:42:00Z","title":"Computing a Maximal Independent Set Using Beeps"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.1926","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:6e0b1d3769373a36926ba902b89caac40a41afbb3a9a63ee1ecf39ccd455dd24","target":"record","created_at":"2026-05-18T04:15:50Z","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":"3cd5d38c49368b309a41ecab9a031d9c1c54793aa13c24502728f88c653395ac","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-08-09T13:42:00Z","title_canon_sha256":"f024f2b1a4bab2c806f2105ca1d5d1339db024378ca100fe03b654143dd518a8"},"schema_version":"1.0","source":{"id":"1108.1926","kind":"arxiv","version":1}},"canonical_sha256":"90b5d4362a98768d2afe68bab780fd87d8366a89c154df7505af218cc8ec4873","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90b5d4362a98768d2afe68bab780fd87d8366a89c154df7505af218cc8ec4873","first_computed_at":"2026-05-18T04:15:50.876777Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:15:50.876777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7na+gW8x+OB8EWa+FnlRInQGvN8ESy3nac0Rnv1yCITbbKZFaew6XPLDvACcCXzELZtq2ow/hLZCDy2kXQTHAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:15:50.877416Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.1926","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e0b1d3769373a36926ba902b89caac40a41afbb3a9a63ee1ecf39ccd455dd24","sha256:2dbc3346ba234bf52c4ab2bd8acd98baef1cb9aa1ad0f11596a62942b1c52e1e"],"state_sha256":"85dfeb931d5812c6226e1292de59d97010a2a0143b21c024528673dea307b861"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t8maqNlaaewLUCTr30BsXMhR7JO9oSiYGxVMzBbuv6NtW/SjFTsr36Tw1xjXi12QcBRivvjW5m1CL/9nffaYBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:18:02.806209Z","bundle_sha256":"6bd729572f241a6a3c6c096670fbe9daf4c026ea05b0e450ff06a5b70c67b0d9"}}