{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:EPG73MHF3KOJEQAU5EWOMF3B4B","short_pith_number":"pith:EPG73MHF","schema_version":"1.0","canonical_sha256":"23cdfdb0e5da9c924014e92ce61761e058c0aab0dc2d4cb46e03608e20ecc47a","source":{"kind":"arxiv","id":"1902.07554","version":1},"attestation_state":"computed","paper":{"title":"Load-Balancing for Parallel Delaunay Triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Daniel Funke, Peter Sanders, Vincent Winkler","submitted_at":"2019-02-20T13:47:57Z","abstract_excerpt":"Computing the Delaunay triangulation (DT) of a given point set in $\\mathbb{R}^D$ is one of the fundamental operations in computational geometry. Recently, Funke and Sanders (2017) presented a divide-and-conquer DT algorithm that merges two partial triangulations by re-triangulating a small subset of their vertices - the border vertices - and combining the three triangulations efficiently via parallel hash table lookups. The input point division should therefore yield roughly equal-sized partitions for good load-balancing and also result in a small number of border vertices for fast merging. In"},"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":"1902.07554","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-20T13:47:57Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"c9c68375dadcd700549c31d3ad11b537d2f7a6fa51c3cc52f142ce15cf32a12e","abstract_canon_sha256":"21eacc2ebc7b93d55d660a99a57947c1585e9f1f53f9d19d30d9b552b521b2d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:07.508604Z","signature_b64":"U3CSyJ9OZgOGZvDjxrKKgbxZuNoClUubYQWeD3VLoxk1Lf6rQXoaDsqiymNMh9O6RzkaG6lIRYh4dVBEaM/xBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23cdfdb0e5da9c924014e92ce61761e058c0aab0dc2d4cb46e03608e20ecc47a","last_reissued_at":"2026-05-17T23:53:07.507916Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:07.507916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Load-Balancing for Parallel Delaunay Triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Daniel Funke, Peter Sanders, Vincent Winkler","submitted_at":"2019-02-20T13:47:57Z","abstract_excerpt":"Computing the Delaunay triangulation (DT) of a given point set in $\\mathbb{R}^D$ is one of the fundamental operations in computational geometry. Recently, Funke and Sanders (2017) presented a divide-and-conquer DT algorithm that merges two partial triangulations by re-triangulating a small subset of their vertices - the border vertices - and combining the three triangulations efficiently via parallel hash table lookups. The input point division should therefore yield roughly equal-sized partitions for good load-balancing and also result in a small number of border vertices for fast merging. In"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07554","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":"1902.07554","created_at":"2026-05-17T23:53:07.508042+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.07554v1","created_at":"2026-05-17T23:53:07.508042+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07554","created_at":"2026-05-17T23:53:07.508042+00:00"},{"alias_kind":"pith_short_12","alias_value":"EPG73MHF3KOJ","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"EPG73MHF3KOJEQAU","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"EPG73MHF","created_at":"2026-05-18T12:33:15.570797+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/EPG73MHF3KOJEQAU5EWOMF3B4B","json":"https://pith.science/pith/EPG73MHF3KOJEQAU5EWOMF3B4B.json","graph_json":"https://pith.science/api/pith-number/EPG73MHF3KOJEQAU5EWOMF3B4B/graph.json","events_json":"https://pith.science/api/pith-number/EPG73MHF3KOJEQAU5EWOMF3B4B/events.json","paper":"https://pith.science/paper/EPG73MHF"},"agent_actions":{"view_html":"https://pith.science/pith/EPG73MHF3KOJEQAU5EWOMF3B4B","download_json":"https://pith.science/pith/EPG73MHF3KOJEQAU5EWOMF3B4B.json","view_paper":"https://pith.science/paper/EPG73MHF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.07554&json=true","fetch_graph":"https://pith.science/api/pith-number/EPG73MHF3KOJEQAU5EWOMF3B4B/graph.json","fetch_events":"https://pith.science/api/pith-number/EPG73MHF3KOJEQAU5EWOMF3B4B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EPG73MHF3KOJEQAU5EWOMF3B4B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EPG73MHF3KOJEQAU5EWOMF3B4B/action/storage_attestation","attest_author":"https://pith.science/pith/EPG73MHF3KOJEQAU5EWOMF3B4B/action/author_attestation","sign_citation":"https://pith.science/pith/EPG73MHF3KOJEQAU5EWOMF3B4B/action/citation_signature","submit_replication":"https://pith.science/pith/EPG73MHF3KOJEQAU5EWOMF3B4B/action/replication_record"}},"created_at":"2026-05-17T23:53:07.508042+00:00","updated_at":"2026-05-17T23:53:07.508042+00:00"}