{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LKQWC25GQUE4LNIV5LBODGS5U6","short_pith_number":"pith:LKQWC25G","schema_version":"1.0","canonical_sha256":"5aa1616ba68509c5b515eac2e19a5da7b498484270fd0cbd2a33e539a5bf7d03","source":{"kind":"arxiv","id":"1711.00068","version":2},"attestation_state":"computed","paper":{"title":"The Stretch Factor of Hexagon-Delaunay Triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Duru T\\\"urko\\u{g}lu, Ljubomir Perkovi\\'c, Michael Dennis","submitted_at":"2017-10-31T19:36:41Z","abstract_excerpt":"The problem of computing the exact stretch factor (i.e., the tight bound on the worst case stretch factor) of a Delaunay triangulation is one of the longstanding open problems in computational geometry. Over the years, a series of upper and lower bounds on the exact stretch factor have been obtained but the gap between them is still large. An alternative approach to solving the problem is to develop techniques for computing the exact stretch factor of ``easier'' types of Delaunay triangulations, in particular those defined using regular-polygons instead of a circle. Tight bounds exist for Dela"},"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":"1711.00068","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-10-31T19:36:41Z","cross_cats_sorted":[],"title_canon_sha256":"5c580e1d11b436154cd96c168fbe6153ea46ccced551f1d92be0b81191825088","abstract_canon_sha256":"7031166bddf9bfc677e0af7b819e14f4d86aa4c85b3a7f0d719820eb095fb6f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:49:33.535157Z","signature_b64":"A0yzEtPY6Z/LC9vWAA9a17hRuCUuoTkDPAHfMDDlEGyZkah4flx8jq/k6TPySMM0GmkeKmOKPhY9xBOnK2pxDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5aa1616ba68509c5b515eac2e19a5da7b498484270fd0cbd2a33e539a5bf7d03","last_reissued_at":"2026-07-05T00:49:33.534821Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:49:33.534821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Stretch Factor of Hexagon-Delaunay Triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Duru T\\\"urko\\u{g}lu, Ljubomir Perkovi\\'c, Michael Dennis","submitted_at":"2017-10-31T19:36:41Z","abstract_excerpt":"The problem of computing the exact stretch factor (i.e., the tight bound on the worst case stretch factor) of a Delaunay triangulation is one of the longstanding open problems in computational geometry. Over the years, a series of upper and lower bounds on the exact stretch factor have been obtained but the gap between them is still large. An alternative approach to solving the problem is to develop techniques for computing the exact stretch factor of ``easier'' types of Delaunay triangulations, in particular those defined using regular-polygons instead of a circle. Tight bounds exist for Dela"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00068","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1711.00068/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1711.00068","created_at":"2026-07-05T00:49:33.534876+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.00068v2","created_at":"2026-07-05T00:49:33.534876+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00068","created_at":"2026-07-05T00:49:33.534876+00:00"},{"alias_kind":"pith_short_12","alias_value":"LKQWC25GQUE4","created_at":"2026-07-05T00:49:33.534876+00:00"},{"alias_kind":"pith_short_16","alias_value":"LKQWC25GQUE4LNIV","created_at":"2026-07-05T00:49:33.534876+00:00"},{"alias_kind":"pith_short_8","alias_value":"LKQWC25G","created_at":"2026-07-05T00:49:33.534876+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/LKQWC25GQUE4LNIV5LBODGS5U6","json":"https://pith.science/pith/LKQWC25GQUE4LNIV5LBODGS5U6.json","graph_json":"https://pith.science/api/pith-number/LKQWC25GQUE4LNIV5LBODGS5U6/graph.json","events_json":"https://pith.science/api/pith-number/LKQWC25GQUE4LNIV5LBODGS5U6/events.json","paper":"https://pith.science/paper/LKQWC25G"},"agent_actions":{"view_html":"https://pith.science/pith/LKQWC25GQUE4LNIV5LBODGS5U6","download_json":"https://pith.science/pith/LKQWC25GQUE4LNIV5LBODGS5U6.json","view_paper":"https://pith.science/paper/LKQWC25G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.00068&json=true","fetch_graph":"https://pith.science/api/pith-number/LKQWC25GQUE4LNIV5LBODGS5U6/graph.json","fetch_events":"https://pith.science/api/pith-number/LKQWC25GQUE4LNIV5LBODGS5U6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LKQWC25GQUE4LNIV5LBODGS5U6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LKQWC25GQUE4LNIV5LBODGS5U6/action/storage_attestation","attest_author":"https://pith.science/pith/LKQWC25GQUE4LNIV5LBODGS5U6/action/author_attestation","sign_citation":"https://pith.science/pith/LKQWC25GQUE4LNIV5LBODGS5U6/action/citation_signature","submit_replication":"https://pith.science/pith/LKQWC25GQUE4LNIV5LBODGS5U6/action/replication_record"}},"created_at":"2026-07-05T00:49:33.534876+00:00","updated_at":"2026-07-05T00:49:33.534876+00:00"}