{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:Q4IF4E7ZLPSVL7JO355IX7S44X","short_pith_number":"pith:Q4IF4E7Z","schema_version":"1.0","canonical_sha256":"87105e13f95be555fd2edf7a8bfe5ce5e0cf13d3792ccc34599a50277b6fe38d","source":{"kind":"arxiv","id":"1809.10737","version":1},"attestation_state":"computed","paper":{"title":"Plane and Planarity Thresholds for Random Geometric Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.CO"],"primary_cat":"cs.DM","authors_text":"Ahmad Biniaz, Anil Maheshwari, Evangelos Kranakis, Michiel Smid","submitted_at":"2018-09-27T19:36:25Z","abstract_excerpt":"A random geometric graph, $G(n,r)$, is formed by choosing $n$ points independently and uniformly at random in a unit square; two points are connected by a straight-line edge if they are at Euclidean distance at most $r$. For a given constant $k$, we show that $n^{\\frac{-k}{2k-2}}$ is a distance threshold function for $G(n,r)$ to have a connected subgraph on $k$ points. Based on this, we show that $n^{-2/3}$ is a distance threshold for $G(n,r)$ to be plane, and $n^{-5/8}$ is a distance threshold to be planar. We also investigate distance thresholds for $G(n,r)$ to have a non-crossing edge, a cl"},"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":"1809.10737","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-09-27T19:36:25Z","cross_cats_sorted":["cs.CG","math.CO"],"title_canon_sha256":"91836ba353a735371fd282f4b0087d5aa39b251af1f50415448fa670478cdcaa","abstract_canon_sha256":"7462cc525e254ec2e3519720ead9b00ae041c841ddb1cb01a2554b5b50c9ffce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:35.179922Z","signature_b64":"hv7Gprb5RJXnhxiA8ewIFFB4X6BxpdNfYg/Q5hb7xD26dntyDWS5LJ/Z0SNPMHEEz8GRua38OvZIpi+rPe3ICw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87105e13f95be555fd2edf7a8bfe5ce5e0cf13d3792ccc34599a50277b6fe38d","last_reissued_at":"2026-05-18T00:04:35.179529Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:35.179529Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Plane and Planarity Thresholds for Random Geometric Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.CO"],"primary_cat":"cs.DM","authors_text":"Ahmad Biniaz, Anil Maheshwari, Evangelos Kranakis, Michiel Smid","submitted_at":"2018-09-27T19:36:25Z","abstract_excerpt":"A random geometric graph, $G(n,r)$, is formed by choosing $n$ points independently and uniformly at random in a unit square; two points are connected by a straight-line edge if they are at Euclidean distance at most $r$. For a given constant $k$, we show that $n^{\\frac{-k}{2k-2}}$ is a distance threshold function for $G(n,r)$ to have a connected subgraph on $k$ points. Based on this, we show that $n^{-2/3}$ is a distance threshold for $G(n,r)$ to be plane, and $n^{-5/8}$ is a distance threshold to be planar. We also investigate distance thresholds for $G(n,r)$ to have a non-crossing edge, a cl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10737","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":"1809.10737","created_at":"2026-05-18T00:04:35.179585+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.10737v1","created_at":"2026-05-18T00:04:35.179585+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10737","created_at":"2026-05-18T00:04:35.179585+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q4IF4E7ZLPSV","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q4IF4E7ZLPSVL7JO","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q4IF4E7Z","created_at":"2026-05-18T12:32:46.962924+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/Q4IF4E7ZLPSVL7JO355IX7S44X","json":"https://pith.science/pith/Q4IF4E7ZLPSVL7JO355IX7S44X.json","graph_json":"https://pith.science/api/pith-number/Q4IF4E7ZLPSVL7JO355IX7S44X/graph.json","events_json":"https://pith.science/api/pith-number/Q4IF4E7ZLPSVL7JO355IX7S44X/events.json","paper":"https://pith.science/paper/Q4IF4E7Z"},"agent_actions":{"view_html":"https://pith.science/pith/Q4IF4E7ZLPSVL7JO355IX7S44X","download_json":"https://pith.science/pith/Q4IF4E7ZLPSVL7JO355IX7S44X.json","view_paper":"https://pith.science/paper/Q4IF4E7Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.10737&json=true","fetch_graph":"https://pith.science/api/pith-number/Q4IF4E7ZLPSVL7JO355IX7S44X/graph.json","fetch_events":"https://pith.science/api/pith-number/Q4IF4E7ZLPSVL7JO355IX7S44X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q4IF4E7ZLPSVL7JO355IX7S44X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q4IF4E7ZLPSVL7JO355IX7S44X/action/storage_attestation","attest_author":"https://pith.science/pith/Q4IF4E7ZLPSVL7JO355IX7S44X/action/author_attestation","sign_citation":"https://pith.science/pith/Q4IF4E7ZLPSVL7JO355IX7S44X/action/citation_signature","submit_replication":"https://pith.science/pith/Q4IF4E7ZLPSVL7JO355IX7S44X/action/replication_record"}},"created_at":"2026-05-18T00:04:35.179585+00:00","updated_at":"2026-05-18T00:04:35.179585+00:00"}