{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:3X7LLLKVKEZMLQ56KYBI4LF5TC","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":"9a8d2ab19273e78e19853274ee38218cc406d0a42d6ce57d6b672f19067f9d3f","cross_cats_sorted":["cs.DM","cs.NI","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-03-02T05:50:54Z","title_canon_sha256":"4c126349510741039141f80b5ac1673792ee1bec57a6ba354a37609dbae28263"},"schema_version":"1.0","source":{"id":"1103.0351","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.0351","created_at":"2026-05-18T04:27:35Z"},{"alias_kind":"arxiv_version","alias_value":"1103.0351v1","created_at":"2026-05-18T04:27:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0351","created_at":"2026-05-18T04:27:35Z"},{"alias_kind":"pith_short_12","alias_value":"3X7LLLKVKEZM","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"3X7LLLKVKEZMLQ56","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"3X7LLLKV","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:7bef6684fd6685792f7e64deaa8d171f9a90cbf1ead97ba6be4a6bbe508345b8","target":"graph","created_at":"2026-05-18T04:27:35Z","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 the connectivity properties of random Bluetooth graphs that model certain \"ad hoc\" wireless networks. The graphs are obtained as \"irrigation subgraphs\" of the well-known random geometric graph model. There are two parameters that control the model: the radius $r$ that determines the \"visible neighbors\" of each node and the number of edges $c$ that each node is allowed to send to these. The randomness comes from the underlying distribution of data points in space and from the choices of each vertex. We prove that no connectivity can take place with high probability for a range of param","authors_text":"G\\'abor Lugosi, Luc Devroye, Nicolas Broutin, Nicolas Fraiman","cross_cats":["cs.DM","cs.NI","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-03-02T05:50:54Z","title":"Connectivity threshold for Bluetooth graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0351","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:7dfce8b2adf93a1659214850dddc1fbcb923227ed9a9e9c8d6eb44fb71609dbb","target":"record","created_at":"2026-05-18T04:27:35Z","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":"9a8d2ab19273e78e19853274ee38218cc406d0a42d6ce57d6b672f19067f9d3f","cross_cats_sorted":["cs.DM","cs.NI","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-03-02T05:50:54Z","title_canon_sha256":"4c126349510741039141f80b5ac1673792ee1bec57a6ba354a37609dbae28263"},"schema_version":"1.0","source":{"id":"1103.0351","kind":"arxiv","version":1}},"canonical_sha256":"ddfeb5ad555132c5c3be56028e2cbd98bc9b4bf4f131e4c7efe57f6f86de0373","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ddfeb5ad555132c5c3be56028e2cbd98bc9b4bf4f131e4c7efe57f6f86de0373","first_computed_at":"2026-05-18T04:27:35.176122Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:27:35.176122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4BK5yQ9bVenbRVrkDUpNpoG/n/ojPOxJE1Q2iIYgsSspQ4PTmRC+k1LzZVnd97xvdvXibL8Z7yybmR70I07DCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:27:35.177047Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.0351","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7dfce8b2adf93a1659214850dddc1fbcb923227ed9a9e9c8d6eb44fb71609dbb","sha256:7bef6684fd6685792f7e64deaa8d171f9a90cbf1ead97ba6be4a6bbe508345b8"],"state_sha256":"3296e59541e34515920cd6a653f4356a83bb321e99900b8d04073721dda8f608"}