{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Q4IF4E7ZLPSVL7JO355IX7S44X","short_pith_number":"pith:Q4IF4E7Z","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"},"canonical_sha256":"87105e13f95be555fd2edf7a8bfe5ce5e0cf13d3792ccc34599a50277b6fe38d","source":{"kind":"arxiv","id":"1809.10737","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.10737","created_at":"2026-05-18T00:04:35Z"},{"alias_kind":"arxiv_version","alias_value":"1809.10737v1","created_at":"2026-05-18T00:04:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10737","created_at":"2026-05-18T00:04:35Z"},{"alias_kind":"pith_short_12","alias_value":"Q4IF4E7ZLPSV","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"Q4IF4E7ZLPSVL7JO","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"Q4IF4E7Z","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Q4IF4E7ZLPSVL7JO355IX7S44X","target":"record","payload":{"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"},"canonical_sha256":"87105e13f95be555fd2edf7a8bfe5ce5e0cf13d3792ccc34599a50277b6fe38d","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"},"source_kind":"arxiv","source_id":"1809.10737","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-18T00:04:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cX3OiaK0FH6cO4Dt5pt6SfLXCFZQQr5wzmZ2HcuG07rPp7zLOSoZQpKckBfaf767Xto2mggGxXjwUxAhjgopBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:41:16.614726Z"},"content_sha256":"a29cb825b3588bc2f34620c5782a2d8f1b680a7389f1d01524e809a357496ea3","schema_version":"1.0","event_id":"sha256:a29cb825b3588bc2f34620c5782a2d8f1b680a7389f1d01524e809a357496ea3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Q4IF4E7ZLPSVL7JO355IX7S44X","target":"graph","payload":{"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"},"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-18T00:04:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KCN437BWN5fxT428/U0f4ykXv1Hty8gTQRaYcpQ7bveLPl5JGwdsl52I4UJzElDkNy0U6mVcaSzQ7uU1C+o0Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:41:16.615071Z"},"content_sha256":"d823a0aeaf08669ea6bc29b15e5393bd748687fa1090b4b88c5f166c8b02ea6f","schema_version":"1.0","event_id":"sha256:d823a0aeaf08669ea6bc29b15e5393bd748687fa1090b4b88c5f166c8b02ea6f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q4IF4E7ZLPSVL7JO355IX7S44X/bundle.json","state_url":"https://pith.science/pith/Q4IF4E7ZLPSVL7JO355IX7S44X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q4IF4E7ZLPSVL7JO355IX7S44X/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-05T10:41:16Z","links":{"resolver":"https://pith.science/pith/Q4IF4E7ZLPSVL7JO355IX7S44X","bundle":"https://pith.science/pith/Q4IF4E7ZLPSVL7JO355IX7S44X/bundle.json","state":"https://pith.science/pith/Q4IF4E7ZLPSVL7JO355IX7S44X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q4IF4E7ZLPSVL7JO355IX7S44X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Q4IF4E7ZLPSVL7JO355IX7S44X","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":"7462cc525e254ec2e3519720ead9b00ae041c841ddb1cb01a2554b5b50c9ffce","cross_cats_sorted":["cs.CG","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-09-27T19:36:25Z","title_canon_sha256":"91836ba353a735371fd282f4b0087d5aa39b251af1f50415448fa670478cdcaa"},"schema_version":"1.0","source":{"id":"1809.10737","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.10737","created_at":"2026-05-18T00:04:35Z"},{"alias_kind":"arxiv_version","alias_value":"1809.10737v1","created_at":"2026-05-18T00:04:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10737","created_at":"2026-05-18T00:04:35Z"},{"alias_kind":"pith_short_12","alias_value":"Q4IF4E7ZLPSV","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"Q4IF4E7ZLPSVL7JO","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"Q4IF4E7Z","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:d823a0aeaf08669ea6bc29b15e5393bd748687fa1090b4b88c5f166c8b02ea6f","target":"graph","created_at":"2026-05-18T00:04: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":"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","authors_text":"Ahmad Biniaz, Anil Maheshwari, Evangelos Kranakis, Michiel Smid","cross_cats":["cs.CG","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-09-27T19:36:25Z","title":"Plane and Planarity Thresholds for Random Geometric Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10737","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:a29cb825b3588bc2f34620c5782a2d8f1b680a7389f1d01524e809a357496ea3","target":"record","created_at":"2026-05-18T00:04: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":"7462cc525e254ec2e3519720ead9b00ae041c841ddb1cb01a2554b5b50c9ffce","cross_cats_sorted":["cs.CG","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-09-27T19:36:25Z","title_canon_sha256":"91836ba353a735371fd282f4b0087d5aa39b251af1f50415448fa670478cdcaa"},"schema_version":"1.0","source":{"id":"1809.10737","kind":"arxiv","version":1}},"canonical_sha256":"87105e13f95be555fd2edf7a8bfe5ce5e0cf13d3792ccc34599a50277b6fe38d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"87105e13f95be555fd2edf7a8bfe5ce5e0cf13d3792ccc34599a50277b6fe38d","first_computed_at":"2026-05-18T00:04:35.179529Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:35.179529Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hv7Gprb5RJXnhxiA8ewIFFB4X6BxpdNfYg/Q5hb7xD26dntyDWS5LJ/Z0SNPMHEEz8GRua38OvZIpi+rPe3ICw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:35.179922Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.10737","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a29cb825b3588bc2f34620c5782a2d8f1b680a7389f1d01524e809a357496ea3","sha256:d823a0aeaf08669ea6bc29b15e5393bd748687fa1090b4b88c5f166c8b02ea6f"],"state_sha256":"3165ca6e0605d99786a9bc02d7bb29bb5b575057ecab711a782e275cc1b42eae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"opO7zIqr+5d8puuL0eDQmc5C3pXWDW51cvbHEK1yTrCYaJD1piIxayi/qQUtpmcIMUwAS0uorojdlEnDqpomCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T10:41:16.617077Z","bundle_sha256":"0539e287f666104eff6551c1de9efb25d8266317783fc74920f6fccb75111601"}}