{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:KBZP2FJBWPJLUOOC6NESO5RXLA","short_pith_number":"pith:KBZP2FJB","canonical_record":{"source":{"id":"1211.5918","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-11-26T11:43:09Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0f9fbdc9dc743d5997e043b97650bda6c0d1a13844896ddc0fc05e28dc8044cc","abstract_canon_sha256":"51ee8df0eeb0f6c15373ed17ca46694f699ce20223c0bc23302f16c5f9c5dd83"},"schema_version":"1.0"},"canonical_sha256":"5072fd1521b3d2ba39c2f34927763758148117eb13f8181da39ab5c9809d380d","source":{"kind":"arxiv","id":"1211.5918","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:KBZP2FJBWPJLUOOC6NESO5RXLA","target":"record","payload":{"canonical_record":{"source":{"id":"1211.5918","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-11-26T11:43:09Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0f9fbdc9dc743d5997e043b97650bda6c0d1a13844896ddc0fc05e28dc8044cc","abstract_canon_sha256":"51ee8df0eeb0f6c15373ed17ca46694f699ce20223c0bc23302f16c5f9c5dd83"},"schema_version":"1.0"},"canonical_sha256":"5072fd1521b3d2ba39c2f34927763758148117eb13f8181da39ab5c9809d380d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:10.613035Z","signature_b64":"xRLpAvf3EhahfVZR3SGnQz6ZUkDNlgAHCvtr16zXLFnege0X7gryDkxytyRH1kWAD4JLJpWSEv52glTcGMhGDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5072fd1521b3d2ba39c2f34927763758148117eb13f8181da39ab5c9809d380d","last_reissued_at":"2026-05-18T03:13:10.612285Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:10.612285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.5918","source_version":3,"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-18T03:13:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xbTi4A1Z7qWOGzXcrK/NNT2jKsXa0qn679LcjYx4xizrlbiAwqgaE7mxcFeaBSCKy85epzxGGRQYtC2lxbeHCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:08:56.470487Z"},"content_sha256":"dfc4850a65e119911fceccd9c8797e92c22fe491dc604b453db586beb5689b23","schema_version":"1.0","event_id":"sha256:dfc4850a65e119911fceccd9c8797e92c22fe491dc604b453db586beb5689b23"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:KBZP2FJBWPJLUOOC6NESO5RXLA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distribution of components in the k-nearest neighbour random geometric graph for k below the connectivity threshold","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Victor Falgas-Ravry","submitted_at":"2012-11-26T11:43:09Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5918","kind":"arxiv","version":3},"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-18T03:13:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2ivrXS3LgX7ETHYnOsN29otHtaRfYkGAnmhR/ojE4Nc/w2A5juDC4nih8YIDJ5+UCRVJ+l926j/NrT54csgdDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:08:56.471032Z"},"content_sha256":"df1f59951b7470b322959b0305d9e8c820182fc7f0120f2241aec053c8858e25","schema_version":"1.0","event_id":"sha256:df1f59951b7470b322959b0305d9e8c820182fc7f0120f2241aec053c8858e25"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KBZP2FJBWPJLUOOC6NESO5RXLA/bundle.json","state_url":"https://pith.science/pith/KBZP2FJBWPJLUOOC6NESO5RXLA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KBZP2FJBWPJLUOOC6NESO5RXLA/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-06-03T01:08:56Z","links":{"resolver":"https://pith.science/pith/KBZP2FJBWPJLUOOC6NESO5RXLA","bundle":"https://pith.science/pith/KBZP2FJBWPJLUOOC6NESO5RXLA/bundle.json","state":"https://pith.science/pith/KBZP2FJBWPJLUOOC6NESO5RXLA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KBZP2FJBWPJLUOOC6NESO5RXLA/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h4jOPJwWH/6Z+Ts4OtvD1m1GT0zmRFNp2ZOLaYR3Zhk7qC/dm/JoWWNynEq2iKspgljS+BJW+zYU1+hKK57cCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T01:08:56.473626Z","bundle_sha256":"735312ac17af373f3b4c129d43d6a59628c87e667793eaa5f8fa102a056bc367"}}