{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MBOPSPYCJYTHGW4OMZ5K5CVRG7","short_pith_number":"pith:MBOPSPYC","schema_version":"1.0","canonical_sha256":"605cf93f024e26735b8e667aae8ab137cbf428fc0501dd37c87e7488d5c19cd9","source":{"kind":"arxiv","id":"1305.4170","version":2},"attestation_state":"computed","paper":{"title":"Average Stretch Factor: How Low Does It Go?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.MG"],"primary_cat":"cs.CG","authors_text":"Michiel Smid, Pat Morin, Vida Dujmovic","submitted_at":"2013-05-17T19:55:03Z","abstract_excerpt":"In a geometric graph, $G$, the \\emph{stretch factor} between two vertices, $u$ and $w$, is the ratio between the Euclidean length of the shortest path from $u$ to $w$ in $G$ and the Euclidean distance between $u$ and $w$. The \\emph{average stretch factor} of $G$ is the average stretch factor taken over all pairs of vertices in $G$. We show that, for any constant dimension, $d$, and any set, $V$, of $n$ points in $\\mathbb{R}^d$, there exists a geometric graph with vertex set $V$, that has $O(n)$ edges, and that has average stretch factor $1+ o_n(1)$. More precisely, the average stretch factor o"},"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":"1305.4170","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-05-17T19:55:03Z","cross_cats_sorted":["cs.NI","math.MG"],"title_canon_sha256":"059ce23057954ad06d02e12ef31245d79ddb8e0da20c29bd8e79256f869dbb35","abstract_canon_sha256":"91e3c18c773c30f3798d1d7709949e497a4229df5b5e47b5ab36a86043ba0c55"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:03.216265Z","signature_b64":"HGDPDlAbdOdkeAOinG1sxd5gVxfn8wKEi+8M6oXV/Cmrz71Adyxd763BivjyHo6PdhjIW3BGa8xq5IRtawQABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"605cf93f024e26735b8e667aae8ab137cbf428fc0501dd37c87e7488d5c19cd9","last_reissued_at":"2026-05-18T03:06:03.215846Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:03.215846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Average Stretch Factor: How Low Does It Go?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.MG"],"primary_cat":"cs.CG","authors_text":"Michiel Smid, Pat Morin, Vida Dujmovic","submitted_at":"2013-05-17T19:55:03Z","abstract_excerpt":"In a geometric graph, $G$, the \\emph{stretch factor} between two vertices, $u$ and $w$, is the ratio between the Euclidean length of the shortest path from $u$ to $w$ in $G$ and the Euclidean distance between $u$ and $w$. The \\emph{average stretch factor} of $G$ is the average stretch factor taken over all pairs of vertices in $G$. We show that, for any constant dimension, $d$, and any set, $V$, of $n$ points in $\\mathbb{R}^d$, there exists a geometric graph with vertex set $V$, that has $O(n)$ edges, and that has average stretch factor $1+ o_n(1)$. More precisely, the average stretch factor o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4170","kind":"arxiv","version":2},"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":"1305.4170","created_at":"2026-05-18T03:06:03.215907+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.4170v2","created_at":"2026-05-18T03:06:03.215907+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4170","created_at":"2026-05-18T03:06:03.215907+00:00"},{"alias_kind":"pith_short_12","alias_value":"MBOPSPYCJYTH","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"MBOPSPYCJYTHGW4O","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"MBOPSPYC","created_at":"2026-05-18T12:27:51.066281+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/MBOPSPYCJYTHGW4OMZ5K5CVRG7","json":"https://pith.science/pith/MBOPSPYCJYTHGW4OMZ5K5CVRG7.json","graph_json":"https://pith.science/api/pith-number/MBOPSPYCJYTHGW4OMZ5K5CVRG7/graph.json","events_json":"https://pith.science/api/pith-number/MBOPSPYCJYTHGW4OMZ5K5CVRG7/events.json","paper":"https://pith.science/paper/MBOPSPYC"},"agent_actions":{"view_html":"https://pith.science/pith/MBOPSPYCJYTHGW4OMZ5K5CVRG7","download_json":"https://pith.science/pith/MBOPSPYCJYTHGW4OMZ5K5CVRG7.json","view_paper":"https://pith.science/paper/MBOPSPYC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.4170&json=true","fetch_graph":"https://pith.science/api/pith-number/MBOPSPYCJYTHGW4OMZ5K5CVRG7/graph.json","fetch_events":"https://pith.science/api/pith-number/MBOPSPYCJYTHGW4OMZ5K5CVRG7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MBOPSPYCJYTHGW4OMZ5K5CVRG7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MBOPSPYCJYTHGW4OMZ5K5CVRG7/action/storage_attestation","attest_author":"https://pith.science/pith/MBOPSPYCJYTHGW4OMZ5K5CVRG7/action/author_attestation","sign_citation":"https://pith.science/pith/MBOPSPYCJYTHGW4OMZ5K5CVRG7/action/citation_signature","submit_replication":"https://pith.science/pith/MBOPSPYCJYTHGW4OMZ5K5CVRG7/action/replication_record"}},"created_at":"2026-05-18T03:06:03.215907+00:00","updated_at":"2026-05-18T03:06:03.215907+00:00"}