{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BCE5JW4Z65AB4Z4SQ4W63EBCWJ","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":"75f526a61b2b6ac7ff2e8fe0908f4843b87f310460160c8638c01e660a6d7c0b","cross_cats_sorted":["cs.DM","cs.DS","math.PR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-13T17:22:00Z","title_canon_sha256":"cb310ec02fab7b5e0bd292773794201163f66be97d7b5a4b42d898c19cbc815d"},"schema_version":"1.0","source":{"id":"1711.04712","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04712","created_at":"2026-05-18T00:30:35Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04712v1","created_at":"2026-05-18T00:30:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04712","created_at":"2026-05-18T00:30:35Z"},{"alias_kind":"pith_short_12","alias_value":"BCE5JW4Z65AB","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BCE5JW4Z65AB4Z4S","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BCE5JW4Z","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:a00c7213cfc40f2f2c5ad16f22f3b1bee6b7597f939bdbc13f48f0f5cf2d60aa","target":"graph","created_at":"2026-05-18T00:30: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":"If we pick $n$ random points uniformly in $[0,1]^d$ and connect each point to its $k-$nearest neighbors, then it is well known that there exists a giant connected component with high probability. We prove that in $[0,1]^d$ it suffices to connect every point to $ c_{d,1} \\log{\\log{n}}$ points chosen randomly among its $ c_{d,2} \\log{n}-$nearest neighbors to ensure a giant component of size $n - o(n)$ with high probability. This construction yields a much sparser random graph with $\\sim n \\log\\log{n}$ instead of $\\sim n \\log{n}$ edges that has comparable connectivity properties. This result has ","authors_text":"Gal Mishne, George C. Linderman, Stefan Steinerberger, Yuval Kluger","cross_cats":["cs.DM","cs.DS","math.PR","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-13T17:22:00Z","title":"Randomized Near Neighbor Graphs, Giant Components, and Applications in Data Science"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04712","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:cbcbf4da03e868597692c0f253ab0d411447089f06a83c41b517932527b9b455","target":"record","created_at":"2026-05-18T00:30: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":"75f526a61b2b6ac7ff2e8fe0908f4843b87f310460160c8638c01e660a6d7c0b","cross_cats_sorted":["cs.DM","cs.DS","math.PR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-13T17:22:00Z","title_canon_sha256":"cb310ec02fab7b5e0bd292773794201163f66be97d7b5a4b42d898c19cbc815d"},"schema_version":"1.0","source":{"id":"1711.04712","kind":"arxiv","version":1}},"canonical_sha256":"0889d4db99f7401e6792872ded9022b268333b38e7776bc9565f38c5b2bb168b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0889d4db99f7401e6792872ded9022b268333b38e7776bc9565f38c5b2bb168b","first_computed_at":"2026-05-18T00:30:35.872987Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:35.872987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SGTPi115YxTaCsqDAc5cqjbpu3qvZJtEBT6ENw2h1AVv9/GioraMtX3HmWwJrlAYrdfGvb7l6QQcU2DhfyFcCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:35.873486Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.04712","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cbcbf4da03e868597692c0f253ab0d411447089f06a83c41b517932527b9b455","sha256:a00c7213cfc40f2f2c5ad16f22f3b1bee6b7597f939bdbc13f48f0f5cf2d60aa"],"state_sha256":"fdcc89ab560de960e92a54e349948cf7347fedd2aff0468c01b9b4918a2b5e16"}