{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:KBZP2FJBWPJLUOOC6NESO5RXLA","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":"51ee8df0eeb0f6c15373ed17ca46694f699ce20223c0bc23302f16c5f9c5dd83","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-11-26T11:43:09Z","title_canon_sha256":"0f9fbdc9dc743d5997e043b97650bda6c0d1a13844896ddc0fc05e28dc8044cc"},"schema_version":"1.0","source":{"id":"1211.5918","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.5918","created_at":"2026-05-18T03:13:10Z"},{"alias_kind":"arxiv_version","alias_value":"1211.5918v3","created_at":"2026-05-18T03:13:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5918","created_at":"2026-05-18T03:13:10Z"},{"alias_kind":"pith_short_12","alias_value":"KBZP2FJBWPJL","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KBZP2FJBWPJLUOOC","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KBZP2FJB","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:df1f59951b7470b322959b0305d9e8c820182fc7f0120f2241aec053c8858e25","target":"graph","created_at":"2026-05-18T03:13:10Z","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":"Let S_{n,k} denote the random geometric graph obtained by placing points inside a square of area n according to a Poisson point process of intensity 1 and joining each such point to the k=k(n) points of the process nearest to it.\n  In this paper we show that if Pr(S_{n,k} connected) > n^{-\\gamma_1} then the probability that S_{n,k} contains a pair of `small' components `close' to each other is o(n^{-c_1}) (in a precise sense of `small' and 'close'), for some absolute constants \\gamma_1>0 and c_1 >0. This answers a question of Walters. (A similar result was independently obtained by Balister.)\n","authors_text":"Victor Falgas-Ravry","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-11-26T11:43:09Z","title":"Distribution of components in the k-nearest neighbour random geometric graph for k below the connectivity threshold"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5918","kind":"arxiv","version":3},"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:dfc4850a65e119911fceccd9c8797e92c22fe491dc604b453db586beb5689b23","target":"record","created_at":"2026-05-18T03:13:10Z","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":"51ee8df0eeb0f6c15373ed17ca46694f699ce20223c0bc23302f16c5f9c5dd83","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-11-26T11:43:09Z","title_canon_sha256":"0f9fbdc9dc743d5997e043b97650bda6c0d1a13844896ddc0fc05e28dc8044cc"},"schema_version":"1.0","source":{"id":"1211.5918","kind":"arxiv","version":3}},"canonical_sha256":"5072fd1521b3d2ba39c2f34927763758148117eb13f8181da39ab5c9809d380d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5072fd1521b3d2ba39c2f34927763758148117eb13f8181da39ab5c9809d380d","first_computed_at":"2026-05-18T03:13:10.612285Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:13:10.612285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xRLpAvf3EhahfVZR3SGnQz6ZUkDNlgAHCvtr16zXLFnege0X7gryDkxytyRH1kWAD4JLJpWSEv52glTcGMhGDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:13:10.613035Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.5918","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dfc4850a65e119911fceccd9c8797e92c22fe491dc604b453db586beb5689b23","sha256:df1f59951b7470b322959b0305d9e8c820182fc7f0120f2241aec053c8858e25"],"state_sha256":"9cd8c20cb7ce44247d43abd870eb4c5a042d5456a6269094998a17096c96eb44"}