{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:AHV4CMIOG4GKGPLQQGUO57AIXU","short_pith_number":"pith:AHV4CMIO","canonical_record":{"source":{"id":"1302.5635","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-02-22T16:32:55Z","cross_cats_sorted":[],"title_canon_sha256":"84255be9c6df6e119400a5a06c42fbd6333586127fd97f33d049a0bcb779bd0a","abstract_canon_sha256":"9089ddecbefe4f7dbfc56ffb0baa2ff4ed2e2d81eb8aaa72a3c7256054b3f14b"},"schema_version":"1.0"},"canonical_sha256":"01ebc1310e370ca33d7081a8eefc08bd015ffaf72e48702c617e6955c038f4ac","source":{"kind":"arxiv","id":"1302.5635","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.5635","created_at":"2026-05-18T03:32:30Z"},{"alias_kind":"arxiv_version","alias_value":"1302.5635v2","created_at":"2026-05-18T03:32:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.5635","created_at":"2026-05-18T03:32:30Z"},{"alias_kind":"pith_short_12","alias_value":"AHV4CMIOG4GK","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AHV4CMIOG4GKGPLQ","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AHV4CMIO","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:AHV4CMIOG4GKGPLQQGUO57AIXU","target":"record","payload":{"canonical_record":{"source":{"id":"1302.5635","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-02-22T16:32:55Z","cross_cats_sorted":[],"title_canon_sha256":"84255be9c6df6e119400a5a06c42fbd6333586127fd97f33d049a0bcb779bd0a","abstract_canon_sha256":"9089ddecbefe4f7dbfc56ffb0baa2ff4ed2e2d81eb8aaa72a3c7256054b3f14b"},"schema_version":"1.0"},"canonical_sha256":"01ebc1310e370ca33d7081a8eefc08bd015ffaf72e48702c617e6955c038f4ac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:30.999675Z","signature_b64":"msivZWn686rlXbxcPqAsU2wXDQXEvxjeGQ6OhW0czJnUl6gbqp9SmbsrN3ItNQSXrrCaHUJdo7ZOibD/5jrqCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01ebc1310e370ca33d7081a8eefc08bd015ffaf72e48702c617e6955c038f4ac","last_reissued_at":"2026-05-18T03:32:30.998946Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:30.998946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.5635","source_version":2,"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-18T03:32:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Yb8AFVpPOiJdx+wBA/PH5E3hck4RvJCzuI0OE7IQSV1MBxDX814sh1gupaM2IGxf/hNjPwUZfNBu5MY3aWwAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:45:52.741008Z"},"content_sha256":"ba03a2e3c3e9f5f6bebb0b9cf805a2662a3289d7b3a70cae131669c989d63a0f","schema_version":"1.0","event_id":"sha256:ba03a2e3c3e9f5f6bebb0b9cf805a2662a3289d7b3a70cae131669c989d63a0f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:AHV4CMIOG4GKGPLQQGUO57AIXU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Greedy is as Good as Delaunay (Almost)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Paul Seiferth, Wolfgang Mulzer","submitted_at":"2013-02-22T16:32:55Z","abstract_excerpt":"Let S be a planar point set. Krznaric and Levcopoulos proved that given the Delaunay triangulation DT(S) for S, one can find the greedy triangulation GT(S) in linear time. We provide a (partial) converse of this result: given GT(S), it is possible to compute DT(S) in linear expected time. Thus, these structures are basically equivalent.\n  To obtain our result, we generalize another algorithm by Krznaric and Levcopoulos to find a hierarchical clustering for S in linear time, once DT(S) is known. We show that their algorithm remains (almost) correct for any triangulation of bounded dilation, i.e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.5635","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"},"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-18T03:32:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OUBGSlCTAKPfUvTjNq9TTYEG9F3uXL7mPW1nGVK6w1LSdVvAbpMS50KvpSqE9cHn0tMyv2F+BZ0pN+GN7V9oCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:45:52.741612Z"},"content_sha256":"64f448654d347f6b57fd1cdebc68e2bb253234c66a4ee04dcb874c1c4aa81a8d","schema_version":"1.0","event_id":"sha256:64f448654d347f6b57fd1cdebc68e2bb253234c66a4ee04dcb874c1c4aa81a8d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AHV4CMIOG4GKGPLQQGUO57AIXU/bundle.json","state_url":"https://pith.science/pith/AHV4CMIOG4GKGPLQQGUO57AIXU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AHV4CMIOG4GKGPLQQGUO57AIXU/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-05-30T07:45:52Z","links":{"resolver":"https://pith.science/pith/AHV4CMIOG4GKGPLQQGUO57AIXU","bundle":"https://pith.science/pith/AHV4CMIOG4GKGPLQQGUO57AIXU/bundle.json","state":"https://pith.science/pith/AHV4CMIOG4GKGPLQQGUO57AIXU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AHV4CMIOG4GKGPLQQGUO57AIXU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:AHV4CMIOG4GKGPLQQGUO57AIXU","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":"9089ddecbefe4f7dbfc56ffb0baa2ff4ed2e2d81eb8aaa72a3c7256054b3f14b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-02-22T16:32:55Z","title_canon_sha256":"84255be9c6df6e119400a5a06c42fbd6333586127fd97f33d049a0bcb779bd0a"},"schema_version":"1.0","source":{"id":"1302.5635","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.5635","created_at":"2026-05-18T03:32:30Z"},{"alias_kind":"arxiv_version","alias_value":"1302.5635v2","created_at":"2026-05-18T03:32:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.5635","created_at":"2026-05-18T03:32:30Z"},{"alias_kind":"pith_short_12","alias_value":"AHV4CMIOG4GK","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AHV4CMIOG4GKGPLQ","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AHV4CMIO","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:64f448654d347f6b57fd1cdebc68e2bb253234c66a4ee04dcb874c1c4aa81a8d","target":"graph","created_at":"2026-05-18T03:32:30Z","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":"Let S be a planar point set. Krznaric and Levcopoulos proved that given the Delaunay triangulation DT(S) for S, one can find the greedy triangulation GT(S) in linear time. We provide a (partial) converse of this result: given GT(S), it is possible to compute DT(S) in linear expected time. Thus, these structures are basically equivalent.\n  To obtain our result, we generalize another algorithm by Krznaric and Levcopoulos to find a hierarchical clustering for S in linear time, once DT(S) is known. We show that their algorithm remains (almost) correct for any triangulation of bounded dilation, i.e","authors_text":"Paul Seiferth, Wolfgang Mulzer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-02-22T16:32:55Z","title":"Greedy is as Good as Delaunay (Almost)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.5635","kind":"arxiv","version":2},"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:ba03a2e3c3e9f5f6bebb0b9cf805a2662a3289d7b3a70cae131669c989d63a0f","target":"record","created_at":"2026-05-18T03:32:30Z","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":"9089ddecbefe4f7dbfc56ffb0baa2ff4ed2e2d81eb8aaa72a3c7256054b3f14b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-02-22T16:32:55Z","title_canon_sha256":"84255be9c6df6e119400a5a06c42fbd6333586127fd97f33d049a0bcb779bd0a"},"schema_version":"1.0","source":{"id":"1302.5635","kind":"arxiv","version":2}},"canonical_sha256":"01ebc1310e370ca33d7081a8eefc08bd015ffaf72e48702c617e6955c038f4ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01ebc1310e370ca33d7081a8eefc08bd015ffaf72e48702c617e6955c038f4ac","first_computed_at":"2026-05-18T03:32:30.998946Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:32:30.998946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"msivZWn686rlXbxcPqAsU2wXDQXEvxjeGQ6OhW0czJnUl6gbqp9SmbsrN3ItNQSXrrCaHUJdo7ZOibD/5jrqCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:32:30.999675Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.5635","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba03a2e3c3e9f5f6bebb0b9cf805a2662a3289d7b3a70cae131669c989d63a0f","sha256:64f448654d347f6b57fd1cdebc68e2bb253234c66a4ee04dcb874c1c4aa81a8d"],"state_sha256":"a4c28cc188b23fd96612e7fe7af8ae09ffcac86d3a397d93c542156b17ad6e55"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xac25TMPJBCaHnrhqcBz2y62zZN4kvDktCH2BNs8btzxGddy0V9iSVQ3nhGIl4XDm8yqckVgK6hSf9xL8fh2Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:45:52.744730Z","bundle_sha256":"47445d0f3132386f10c2d21e4ee798e7c5047fc5b0876a16b81700947a750960"}}