{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:REU6CDFPPAZHGRLUTFGC27DDZ2","short_pith_number":"pith:REU6CDFP","schema_version":"1.0","canonical_sha256":"8929e10caf7832734574994c2d7c63ce8da7a90dbd2d255fd0cf817ff4d48acc","source":{"kind":"arxiv","id":"1103.4361","version":2},"attestation_state":"computed","paper":{"title":"The Stretch Factor of the Delaunay Triangulation Is Less Than 1.998","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ge Xia","submitted_at":"2011-03-22T19:52:15Z","abstract_excerpt":"Let $S$ be a finite set of points in the Euclidean plane. Let $D$ be a Delaunay triangulation of $S$. The {\\em stretch factor} (also known as {\\em dilation} or {\\em spanning ratio}) of $D$ is the maximum ratio, among all points $p$ and $q$ in $S$, of the shortest path distance from $p$ to $q$ in $D$ over the Euclidean distance $||pq||$. Proving a tight bound on the stretch factor of the Delaunay triangulation has been a long standing open problem in computational geometry.\n  In this paper we prove that the stretch factor of the Delaunay triangulation of a set of points in the plane is less tha"},"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":"1103.4361","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-03-22T19:52:15Z","cross_cats_sorted":[],"title_canon_sha256":"8c494d72726e5a2bfdb1601407952e1a4e5a1f5d05d63b916d48667008b9cc2e","abstract_canon_sha256":"93a3e3be7c79a9dab3a5fee26d3a9dcc9ffce52316988ef7e004dd7ea494f01b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:41.223882Z","signature_b64":"KmtGRKZGk8DbNWfnm9i2skQh95G1LRYdzuSrxx9lqMEJnet2oHrh8K6CdEZDFd8ziysqhx7MhX1uRLE5tqgAAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8929e10caf7832734574994c2d7c63ce8da7a90dbd2d255fd0cf817ff4d48acc","last_reissued_at":"2026-05-18T03:14:41.223402Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:41.223402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Stretch Factor of the Delaunay Triangulation Is Less Than 1.998","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ge Xia","submitted_at":"2011-03-22T19:52:15Z","abstract_excerpt":"Let $S$ be a finite set of points in the Euclidean plane. Let $D$ be a Delaunay triangulation of $S$. The {\\em stretch factor} (also known as {\\em dilation} or {\\em spanning ratio}) of $D$ is the maximum ratio, among all points $p$ and $q$ in $S$, of the shortest path distance from $p$ to $q$ in $D$ over the Euclidean distance $||pq||$. Proving a tight bound on the stretch factor of the Delaunay triangulation has been a long standing open problem in computational geometry.\n  In this paper we prove that the stretch factor of the Delaunay triangulation of a set of points in the plane is less tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.4361","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":"1103.4361","created_at":"2026-05-18T03:14:41.223477+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.4361v2","created_at":"2026-05-18T03:14:41.223477+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.4361","created_at":"2026-05-18T03:14:41.223477+00:00"},{"alias_kind":"pith_short_12","alias_value":"REU6CDFPPAZH","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"REU6CDFPPAZHGRLU","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"REU6CDFP","created_at":"2026-05-18T12:26:41.206345+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/REU6CDFPPAZHGRLUTFGC27DDZ2","json":"https://pith.science/pith/REU6CDFPPAZHGRLUTFGC27DDZ2.json","graph_json":"https://pith.science/api/pith-number/REU6CDFPPAZHGRLUTFGC27DDZ2/graph.json","events_json":"https://pith.science/api/pith-number/REU6CDFPPAZHGRLUTFGC27DDZ2/events.json","paper":"https://pith.science/paper/REU6CDFP"},"agent_actions":{"view_html":"https://pith.science/pith/REU6CDFPPAZHGRLUTFGC27DDZ2","download_json":"https://pith.science/pith/REU6CDFPPAZHGRLUTFGC27DDZ2.json","view_paper":"https://pith.science/paper/REU6CDFP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.4361&json=true","fetch_graph":"https://pith.science/api/pith-number/REU6CDFPPAZHGRLUTFGC27DDZ2/graph.json","fetch_events":"https://pith.science/api/pith-number/REU6CDFPPAZHGRLUTFGC27DDZ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/REU6CDFPPAZHGRLUTFGC27DDZ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/REU6CDFPPAZHGRLUTFGC27DDZ2/action/storage_attestation","attest_author":"https://pith.science/pith/REU6CDFPPAZHGRLUTFGC27DDZ2/action/author_attestation","sign_citation":"https://pith.science/pith/REU6CDFPPAZHGRLUTFGC27DDZ2/action/citation_signature","submit_replication":"https://pith.science/pith/REU6CDFPPAZHGRLUTFGC27DDZ2/action/replication_record"}},"created_at":"2026-05-18T03:14:41.223477+00:00","updated_at":"2026-05-18T03:14:41.223477+00:00"}