{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ZXFJ5TTFEX3P536Z27UTF5YEOB","short_pith_number":"pith:ZXFJ5TTF","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"},"canonical_sha256":"cdca9ece6525f6feefd9d7e932f704705553e1f13c93d1eca384bbb98c0ac54b","source":{"kind":"arxiv","id":"1402.3696","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.3696","created_at":"2026-05-18T02:58:55Z"},{"alias_kind":"arxiv_version","alias_value":"1402.3696v1","created_at":"2026-05-18T02:58:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3696","created_at":"2026-05-18T02:58:55Z"},{"alias_kind":"pith_short_12","alias_value":"ZXFJ5TTFEX3P","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZXFJ5TTFEX3P536Z","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZXFJ5TTF","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ZXFJ5TTFEX3P536Z27UTF5YEOB","target":"record","payload":{"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"},"canonical_sha256":"cdca9ece6525f6feefd9d7e932f704705553e1f13c93d1eca384bbb98c0ac54b","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"},"source_kind":"arxiv","source_id":"1402.3696","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-18T02:58:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hg1ZMywkKiYyoQGxlRcr8ghOSCWdvVoVzIH+gHnWGPMCwe7AiFgLPlIGTrbTq57Ccx07AoT5aICyLlNMjmHwAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T00:38:37.224212Z"},"content_sha256":"7bc8b8f75237ae1483a06eda2f3006a3c991d4b401bf14fe1823ba97cb451f34","schema_version":"1.0","event_id":"sha256:7bc8b8f75237ae1483a06eda2f3006a3c991d4b401bf14fe1823ba97cb451f34"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ZXFJ5TTFEX3P536Z27UTF5YEOB","target":"graph","payload":{"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"},"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-18T02:58:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O2IVCk2Ecm9oV5VaFPj7i6HmPHIGWUAA3wZOETFJ47ewORuNhBZBncMdcVmj+K8lc8Drz52HRFRM+xu3s+KfBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T00:38:37.224876Z"},"content_sha256":"3e710f782187a9c58aadb35311f5bda494460e0f062965ef5795edc570e71298","schema_version":"1.0","event_id":"sha256:3e710f782187a9c58aadb35311f5bda494460e0f062965ef5795edc570e71298"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZXFJ5TTFEX3P536Z27UTF5YEOB/bundle.json","state_url":"https://pith.science/pith/ZXFJ5TTFEX3P536Z27UTF5YEOB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZXFJ5TTFEX3P536Z27UTF5YEOB/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-23T00:38:37Z","links":{"resolver":"https://pith.science/pith/ZXFJ5TTFEX3P536Z27UTF5YEOB","bundle":"https://pith.science/pith/ZXFJ5TTFEX3P536Z27UTF5YEOB/bundle.json","state":"https://pith.science/pith/ZXFJ5TTFEX3P536Z27UTF5YEOB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZXFJ5TTFEX3P536Z27UTF5YEOB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZXFJ5TTFEX3P536Z27UTF5YEOB","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":"c0c19503a54fba91d06c2462b7827b926e2f2288fd9f735956a9761d3d5956db","cross_cats_sorted":["cs.DM","cs.NI","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-02-15T14:27:12Z","title_canon_sha256":"60e43793927138df27f8fe20e41be30b73daab7c73d4d87f781f8118c111f6e7"},"schema_version":"1.0","source":{"id":"1402.3696","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.3696","created_at":"2026-05-18T02:58:55Z"},{"alias_kind":"arxiv_version","alias_value":"1402.3696v1","created_at":"2026-05-18T02:58:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3696","created_at":"2026-05-18T02:58:55Z"},{"alias_kind":"pith_short_12","alias_value":"ZXFJ5TTFEX3P","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZXFJ5TTFEX3P536Z","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZXFJ5TTF","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:3e710f782187a9c58aadb35311f5bda494460e0f062965ef5795edc570e71298","target":"graph","created_at":"2026-05-18T02:58:55Z","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":"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","authors_text":"G\\'abor Lugosi, Luc Devroye, Nicolas Broutin","cross_cats":["cs.DM","cs.NI","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-02-15T14:27:12Z","title":"Connectivity of sparse Bluetooth networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3696","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:7bc8b8f75237ae1483a06eda2f3006a3c991d4b401bf14fe1823ba97cb451f34","target":"record","created_at":"2026-05-18T02:58:55Z","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":"c0c19503a54fba91d06c2462b7827b926e2f2288fd9f735956a9761d3d5956db","cross_cats_sorted":["cs.DM","cs.NI","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-02-15T14:27:12Z","title_canon_sha256":"60e43793927138df27f8fe20e41be30b73daab7c73d4d87f781f8118c111f6e7"},"schema_version":"1.0","source":{"id":"1402.3696","kind":"arxiv","version":1}},"canonical_sha256":"cdca9ece6525f6feefd9d7e932f704705553e1f13c93d1eca384bbb98c0ac54b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cdca9ece6525f6feefd9d7e932f704705553e1f13c93d1eca384bbb98c0ac54b","first_computed_at":"2026-05-18T02:58:55.792376Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:55.792376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WCLXbZMejCQOxvtskdCcs5KRnk76ncJoP4qSH7bN8OyeOBYzRDlLgGG4jf05YoBvBs3SNGv/70zJygrofxlZDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:55.792909Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.3696","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7bc8b8f75237ae1483a06eda2f3006a3c991d4b401bf14fe1823ba97cb451f34","sha256:3e710f782187a9c58aadb35311f5bda494460e0f062965ef5795edc570e71298"],"state_sha256":"c3cad1720ed4048b86716ea8bf35c2153d21344e5888d96b2311d68c02ee8584"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kigm551D7nFc0CsrGYgkYitbkq7S4b+PH0/MN/7ahF9Dt+5xXl/XxwgcoxrPGQ1B+Q/83tbEWWRbGDu7w0MVDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T00:38:37.228455Z","bundle_sha256":"264fcaca0b4fbb54acd7261b365029af722e87e170fef42f5c065d69917b087f"}}