{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:EPG73MHF3KOJEQAU5EWOMF3B4B","short_pith_number":"pith:EPG73MHF","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"},"canonical_sha256":"23cdfdb0e5da9c924014e92ce61761e058c0aab0dc2d4cb46e03608e20ecc47a","source":{"kind":"arxiv","id":"1902.07554","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.07554","created_at":"2026-05-17T23:53:07Z"},{"alias_kind":"arxiv_version","alias_value":"1902.07554v1","created_at":"2026-05-17T23:53:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07554","created_at":"2026-05-17T23:53:07Z"},{"alias_kind":"pith_short_12","alias_value":"EPG73MHF3KOJ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EPG73MHF3KOJEQAU","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EPG73MHF","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:EPG73MHF3KOJEQAU5EWOMF3B4B","target":"record","payload":{"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"},"canonical_sha256":"23cdfdb0e5da9c924014e92ce61761e058c0aab0dc2d4cb46e03608e20ecc47a","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"},"source_kind":"arxiv","source_id":"1902.07554","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:53:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Z7+9xCQD729IofDl1cSZYKD1tu4yr6UTHAqPxtufwnP45GkJPSpw4y5l1poB6HU5W/V493Q6kvXkS2ArlsmDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T02:34:04.291610Z"},"content_sha256":"67480f797d5839f67507866f9a9d12809d48f16eed7386884800ec75cbff6e91","schema_version":"1.0","event_id":"sha256:67480f797d5839f67507866f9a9d12809d48f16eed7386884800ec75cbff6e91"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:EPG73MHF3KOJEQAU5EWOMF3B4B","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:53:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R1d8CDimfjoKoo8eBEttCmbPqrf2MPtBug72lG5RHazBKvqWmmESGTaxwnwDJ5/JaS7JLvQ3UVz5vnnFCAX1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T02:34:04.292096Z"},"content_sha256":"1f4237306b3652dc6bd06f2888342acde0ab4318e39bfefe6364fda4ec727348","schema_version":"1.0","event_id":"sha256:1f4237306b3652dc6bd06f2888342acde0ab4318e39bfefe6364fda4ec727348"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EPG73MHF3KOJEQAU5EWOMF3B4B/bundle.json","state_url":"https://pith.science/pith/EPG73MHF3KOJEQAU5EWOMF3B4B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EPG73MHF3KOJEQAU5EWOMF3B4B/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-26T02:34:04Z","links":{"resolver":"https://pith.science/pith/EPG73MHF3KOJEQAU5EWOMF3B4B","bundle":"https://pith.science/pith/EPG73MHF3KOJEQAU5EWOMF3B4B/bundle.json","state":"https://pith.science/pith/EPG73MHF3KOJEQAU5EWOMF3B4B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EPG73MHF3KOJEQAU5EWOMF3B4B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:EPG73MHF3KOJEQAU5EWOMF3B4B","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"21eacc2ebc7b93d55d660a99a57947c1585e9f1f53f9d19d30d9b552b521b2d8","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-20T13:47:57Z","title_canon_sha256":"c9c68375dadcd700549c31d3ad11b537d2f7a6fa51c3cc52f142ce15cf32a12e"},"schema_version":"1.0","source":{"id":"1902.07554","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.07554","created_at":"2026-05-17T23:53:07Z"},{"alias_kind":"arxiv_version","alias_value":"1902.07554v1","created_at":"2026-05-17T23:53:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07554","created_at":"2026-05-17T23:53:07Z"},{"alias_kind":"pith_short_12","alias_value":"EPG73MHF3KOJ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EPG73MHF3KOJEQAU","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EPG73MHF","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:1f4237306b3652dc6bd06f2888342acde0ab4318e39bfefe6364fda4ec727348","target":"graph","created_at":"2026-05-17T23:53:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Daniel Funke, Peter Sanders, Vincent Winkler","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-20T13:47:57Z","title":"Load-Balancing for Parallel Delaunay Triangulations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07554","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:67480f797d5839f67507866f9a9d12809d48f16eed7386884800ec75cbff6e91","target":"record","created_at":"2026-05-17T23:53:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"21eacc2ebc7b93d55d660a99a57947c1585e9f1f53f9d19d30d9b552b521b2d8","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-20T13:47:57Z","title_canon_sha256":"c9c68375dadcd700549c31d3ad11b537d2f7a6fa51c3cc52f142ce15cf32a12e"},"schema_version":"1.0","source":{"id":"1902.07554","kind":"arxiv","version":1}},"canonical_sha256":"23cdfdb0e5da9c924014e92ce61761e058c0aab0dc2d4cb46e03608e20ecc47a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"23cdfdb0e5da9c924014e92ce61761e058c0aab0dc2d4cb46e03608e20ecc47a","first_computed_at":"2026-05-17T23:53:07.507916Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:07.507916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U3CSyJ9OZgOGZvDjxrKKgbxZuNoClUubYQWeD3VLoxk1Lf6rQXoaDsqiymNMh9O6RzkaG6lIRYh4dVBEaM/xBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:07.508604Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.07554","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67480f797d5839f67507866f9a9d12809d48f16eed7386884800ec75cbff6e91","sha256:1f4237306b3652dc6bd06f2888342acde0ab4318e39bfefe6364fda4ec727348"],"state_sha256":"b5b9999da1251c4f9f912424934159dfb0a2cee2698585954ebc9d8532fee04f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X8yzmaw+LEMrW/ZFYw5Tii2ClhagVZmuLXDMOaZ5oHFitya2zDDBQcyUCHdy5i8GdD/9xIQMq2Ey++/HqHYKBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T02:34:04.294692Z","bundle_sha256":"3e8e09ada38bd43a68a6d7d610d689d1b70a05491c648695bf7178e8b415fd1d"}}