{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:HRF7WAKWA27R3TZJW5YRMVLWKQ","short_pith_number":"pith:HRF7WAKW","schema_version":"1.0","canonical_sha256":"3c4bfb015606bf1dcf29b7711655765421006432d3195d0d50f482753d9aedd6","source":{"kind":"arxiv","id":"1409.5466","version":1},"attestation_state":"computed","paper":{"title":"Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ahmad Biniaz, Anil Maheshwari, Michiel Smid","submitted_at":"2014-09-18T21:17:17Z","abstract_excerpt":"We consider an extension of the triangular-distance Delaunay graphs (TD-Delaunay) on a set $P$ of points in the plane. In TD-Delaunay, the convex distance is defined by a fixed-oriented equilateral triangle $\\triangledown$, and there is an edge between two points in $P$ if and only if there is an empty homothet of $\\triangledown$ having the two points on its boundary. We consider higher-order triangular-distance Delaunay graphs, namely $k$-TD, which contains an edge between two points if the interior of the homothet of $\\triangledown$ having the two points on its boundary contains at most $k$ "},"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":"1409.5466","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-09-18T21:17:17Z","cross_cats_sorted":[],"title_canon_sha256":"8a5f7bff93190eb32f5c578653ff296be9d9fb3d92338850ec4ba985b6b7b262","abstract_canon_sha256":"d011fcf66a65e88b86a13bf93c2da3bb843945c0dfc2cf069473c24b61db2f93"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:27.502379Z","signature_b64":"qHa9aqjmy3fReBUuKm0Z5efyaNEjo2INAzFNVjMr0P7/92MBosJAX4B0AFk/xOLb59HR6b1CBwsB12LOfy0BAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c4bfb015606bf1dcf29b7711655765421006432d3195d0d50f482753d9aedd6","last_reissued_at":"2026-05-18T02:42:27.501629Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:27.501629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ahmad Biniaz, Anil Maheshwari, Michiel Smid","submitted_at":"2014-09-18T21:17:17Z","abstract_excerpt":"We consider an extension of the triangular-distance Delaunay graphs (TD-Delaunay) on a set $P$ of points in the plane. In TD-Delaunay, the convex distance is defined by a fixed-oriented equilateral triangle $\\triangledown$, and there is an edge between two points in $P$ if and only if there is an empty homothet of $\\triangledown$ having the two points on its boundary. We consider higher-order triangular-distance Delaunay graphs, namely $k$-TD, which contains an edge between two points if the interior of the homothet of $\\triangledown$ having the two points on its boundary contains at most $k$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.5466","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":"1409.5466","created_at":"2026-05-18T02:42:27.501761+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.5466v1","created_at":"2026-05-18T02:42:27.501761+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.5466","created_at":"2026-05-18T02:42:27.501761+00:00"},{"alias_kind":"pith_short_12","alias_value":"HRF7WAKWA27R","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"HRF7WAKWA27R3TZJ","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"HRF7WAKW","created_at":"2026-05-18T12:28:30.664211+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/HRF7WAKWA27R3TZJW5YRMVLWKQ","json":"https://pith.science/pith/HRF7WAKWA27R3TZJW5YRMVLWKQ.json","graph_json":"https://pith.science/api/pith-number/HRF7WAKWA27R3TZJW5YRMVLWKQ/graph.json","events_json":"https://pith.science/api/pith-number/HRF7WAKWA27R3TZJW5YRMVLWKQ/events.json","paper":"https://pith.science/paper/HRF7WAKW"},"agent_actions":{"view_html":"https://pith.science/pith/HRF7WAKWA27R3TZJW5YRMVLWKQ","download_json":"https://pith.science/pith/HRF7WAKWA27R3TZJW5YRMVLWKQ.json","view_paper":"https://pith.science/paper/HRF7WAKW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.5466&json=true","fetch_graph":"https://pith.science/api/pith-number/HRF7WAKWA27R3TZJW5YRMVLWKQ/graph.json","fetch_events":"https://pith.science/api/pith-number/HRF7WAKWA27R3TZJW5YRMVLWKQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HRF7WAKWA27R3TZJW5YRMVLWKQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HRF7WAKWA27R3TZJW5YRMVLWKQ/action/storage_attestation","attest_author":"https://pith.science/pith/HRF7WAKWA27R3TZJW5YRMVLWKQ/action/author_attestation","sign_citation":"https://pith.science/pith/HRF7WAKWA27R3TZJW5YRMVLWKQ/action/citation_signature","submit_replication":"https://pith.science/pith/HRF7WAKWA27R3TZJW5YRMVLWKQ/action/replication_record"}},"created_at":"2026-05-18T02:42:27.501761+00:00","updated_at":"2026-05-18T02:42:27.501761+00:00"}