{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:5KI6JYHND6V6Z3VJFFAOUEO6DV","short_pith_number":"pith:5KI6JYHN","schema_version":"1.0","canonical_sha256":"ea91e4e0ed1fabeceea92940ea11de1d5757010829fa45379777577296591473","source":{"kind":"arxiv","id":"1404.4757","version":1},"attestation_state":"computed","paper":{"title":"On the relation between graph distance and Euclidean distance in random geometric graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Dieter Mitsche, Guillem Perarnau, Josep D\\'iaz, Xavier P\\'erez-Gim\\'enez","submitted_at":"2014-04-18T12:11:43Z","abstract_excerpt":"Given any two vertices u, v of a random geometric graph, denote by d_E(u,v) their Euclidean distance and by d_G(u,v) their graph distance. The problem of finding upper bounds on d_G(u,v) in terms of d_E(u,v) has received a lot of attention in the literature. In this paper, we improve these upper bounds for values of r=omega(sqrt(log n)) (i.e. for r above the connectivity threshold). Our result also improves the best-known estimates on the diameter of random geometric graphs. We also provide a lower bound on d_G(u,v) in terms of d_E(u,v)."},"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":"1404.4757","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-04-18T12:11:43Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"ec7fd7bae5782beca775cc9b2a2be3628c47702278ec457eb7c5f3ffc9166b4f","abstract_canon_sha256":"29be472727dd067c31b101b5c6a24cfa0f682afbd38a928783c5c263015c43ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:55.082799Z","signature_b64":"DxDqKXxK9fPHyoEkQkXCNlEOBac5Tu4xxSjQge8r39ihksk8g1NP+EZciT/6n2ui/hK9av0kkDDe3LOQhN0NAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea91e4e0ed1fabeceea92940ea11de1d5757010829fa45379777577296591473","last_reissued_at":"2026-05-18T02:53:55.082044Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:55.082044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the relation between graph distance and Euclidean distance in random geometric graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Dieter Mitsche, Guillem Perarnau, Josep D\\'iaz, Xavier P\\'erez-Gim\\'enez","submitted_at":"2014-04-18T12:11:43Z","abstract_excerpt":"Given any two vertices u, v of a random geometric graph, denote by d_E(u,v) their Euclidean distance and by d_G(u,v) their graph distance. The problem of finding upper bounds on d_G(u,v) in terms of d_E(u,v) has received a lot of attention in the literature. In this paper, we improve these upper bounds for values of r=omega(sqrt(log n)) (i.e. for r above the connectivity threshold). Our result also improves the best-known estimates on the diameter of random geometric graphs. We also provide a lower bound on d_G(u,v) in terms of d_E(u,v)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4757","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":"1404.4757","created_at":"2026-05-18T02:53:55.082147+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.4757v1","created_at":"2026-05-18T02:53:55.082147+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4757","created_at":"2026-05-18T02:53:55.082147+00:00"},{"alias_kind":"pith_short_12","alias_value":"5KI6JYHND6V6","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"5KI6JYHND6V6Z3VJ","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"5KI6JYHN","created_at":"2026-05-18T12:28:14.216126+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/5KI6JYHND6V6Z3VJFFAOUEO6DV","json":"https://pith.science/pith/5KI6JYHND6V6Z3VJFFAOUEO6DV.json","graph_json":"https://pith.science/api/pith-number/5KI6JYHND6V6Z3VJFFAOUEO6DV/graph.json","events_json":"https://pith.science/api/pith-number/5KI6JYHND6V6Z3VJFFAOUEO6DV/events.json","paper":"https://pith.science/paper/5KI6JYHN"},"agent_actions":{"view_html":"https://pith.science/pith/5KI6JYHND6V6Z3VJFFAOUEO6DV","download_json":"https://pith.science/pith/5KI6JYHND6V6Z3VJFFAOUEO6DV.json","view_paper":"https://pith.science/paper/5KI6JYHN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.4757&json=true","fetch_graph":"https://pith.science/api/pith-number/5KI6JYHND6V6Z3VJFFAOUEO6DV/graph.json","fetch_events":"https://pith.science/api/pith-number/5KI6JYHND6V6Z3VJFFAOUEO6DV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5KI6JYHND6V6Z3VJFFAOUEO6DV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5KI6JYHND6V6Z3VJFFAOUEO6DV/action/storage_attestation","attest_author":"https://pith.science/pith/5KI6JYHND6V6Z3VJFFAOUEO6DV/action/author_attestation","sign_citation":"https://pith.science/pith/5KI6JYHND6V6Z3VJFFAOUEO6DV/action/citation_signature","submit_replication":"https://pith.science/pith/5KI6JYHND6V6Z3VJFFAOUEO6DV/action/replication_record"}},"created_at":"2026-05-18T02:53:55.082147+00:00","updated_at":"2026-05-18T02:53:55.082147+00:00"}