{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZXFJ5TTFEX3P536Z27UTF5YEOB","short_pith_number":"pith:ZXFJ5TTF","schema_version":"1.0","canonical_sha256":"cdca9ece6525f6feefd9d7e932f704705553e1f13c93d1eca384bbb98c0ac54b","source":{"kind":"arxiv","id":"1402.3696","version":1},"attestation_state":"computed","paper":{"title":"Connectivity of sparse Bluetooth networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.NI","math.CO"],"primary_cat":"math.PR","authors_text":"G\\'abor Lugosi, Luc Devroye, Nicolas Broutin","submitted_at":"2014-02-15T14:27:12Z","abstract_excerpt":"Consider a random geometric graph defined on $n$ vertices uniformly distributed in the $d$-dimensional unit torus. Two vertices are connected if their distance is less than a \"visibility radius\" $r_n$. We consider {\\sl Bluetooth networks} that are locally sparsified random geometric graphs. Each vertex selects $c$ of its neighbors in the random geometric graph at random and connects only to the selected points. We show that if the visibility radius is at least of the order of $n^{-(1-\\delta)/d}$ for some $\\delta > 0$, then a constant value of $c$ is sufficient for the graph to be connected, wi"},"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":"1402.3696","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-02-15T14:27:12Z","cross_cats_sorted":["cs.DM","cs.NI","math.CO"],"title_canon_sha256":"60e43793927138df27f8fe20e41be30b73daab7c73d4d87f781f8118c111f6e7","abstract_canon_sha256":"c0c19503a54fba91d06c2462b7827b926e2f2288fd9f735956a9761d3d5956db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:55.792909Z","signature_b64":"WCLXbZMejCQOxvtskdCcs5KRnk76ncJoP4qSH7bN8OyeOBYzRDlLgGG4jf05YoBvBs3SNGv/70zJygrofxlZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdca9ece6525f6feefd9d7e932f704705553e1f13c93d1eca384bbb98c0ac54b","last_reissued_at":"2026-05-18T02:58:55.792376Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:55.792376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Connectivity of sparse Bluetooth networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.NI","math.CO"],"primary_cat":"math.PR","authors_text":"G\\'abor Lugosi, Luc Devroye, Nicolas Broutin","submitted_at":"2014-02-15T14:27:12Z","abstract_excerpt":"Consider a random geometric graph defined on $n$ vertices uniformly distributed in the $d$-dimensional unit torus. Two vertices are connected if their distance is less than a \"visibility radius\" $r_n$. We consider {\\sl Bluetooth networks} that are locally sparsified random geometric graphs. Each vertex selects $c$ of its neighbors in the random geometric graph at random and connects only to the selected points. We show that if the visibility radius is at least of the order of $n^{-(1-\\delta)/d}$ for some $\\delta > 0$, then a constant value of $c$ is sufficient for the graph to be connected, wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3696","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":"1402.3696","created_at":"2026-05-18T02:58:55.792466+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.3696v1","created_at":"2026-05-18T02:58:55.792466+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3696","created_at":"2026-05-18T02:58:55.792466+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZXFJ5TTFEX3P","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZXFJ5TTFEX3P536Z","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZXFJ5TTF","created_at":"2026-05-18T12:28:59.999130+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/ZXFJ5TTFEX3P536Z27UTF5YEOB","json":"https://pith.science/pith/ZXFJ5TTFEX3P536Z27UTF5YEOB.json","graph_json":"https://pith.science/api/pith-number/ZXFJ5TTFEX3P536Z27UTF5YEOB/graph.json","events_json":"https://pith.science/api/pith-number/ZXFJ5TTFEX3P536Z27UTF5YEOB/events.json","paper":"https://pith.science/paper/ZXFJ5TTF"},"agent_actions":{"view_html":"https://pith.science/pith/ZXFJ5TTFEX3P536Z27UTF5YEOB","download_json":"https://pith.science/pith/ZXFJ5TTFEX3P536Z27UTF5YEOB.json","view_paper":"https://pith.science/paper/ZXFJ5TTF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.3696&json=true","fetch_graph":"https://pith.science/api/pith-number/ZXFJ5TTFEX3P536Z27UTF5YEOB/graph.json","fetch_events":"https://pith.science/api/pith-number/ZXFJ5TTFEX3P536Z27UTF5YEOB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZXFJ5TTFEX3P536Z27UTF5YEOB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZXFJ5TTFEX3P536Z27UTF5YEOB/action/storage_attestation","attest_author":"https://pith.science/pith/ZXFJ5TTFEX3P536Z27UTF5YEOB/action/author_attestation","sign_citation":"https://pith.science/pith/ZXFJ5TTFEX3P536Z27UTF5YEOB/action/citation_signature","submit_replication":"https://pith.science/pith/ZXFJ5TTFEX3P536Z27UTF5YEOB/action/replication_record"}},"created_at":"2026-05-18T02:58:55.792466+00:00","updated_at":"2026-05-18T02:58:55.792466+00:00"}