{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:UNHL5AMXPH7JYL6RH7PI6XGII5","short_pith_number":"pith:UNHL5AMX","canonical_record":{"source":{"id":"1304.0524","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-04-02T03:53:46Z","cross_cats_sorted":[],"title_canon_sha256":"b79e1dcc0ef296691780b975b7e6145c462168b821abb18115cce99d36982c85","abstract_canon_sha256":"e7c53cbbf4ed15d17576d9676070f22d6f9f95febe2967f9b392cd6391189a4e"},"schema_version":"1.0"},"canonical_sha256":"a34ebe819779fe9c2fd13fde8f5cc847561fe0d05346285d29a0a646ae2137a0","source":{"kind":"arxiv","id":"1304.0524","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.0524","created_at":"2026-05-18T03:29:15Z"},{"alias_kind":"arxiv_version","alias_value":"1304.0524v1","created_at":"2026-05-18T03:29:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0524","created_at":"2026-05-18T03:29:15Z"},{"alias_kind":"pith_short_12","alias_value":"UNHL5AMXPH7J","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UNHL5AMXPH7JYL6R","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UNHL5AMX","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:UNHL5AMXPH7JYL6RH7PI6XGII5","target":"record","payload":{"canonical_record":{"source":{"id":"1304.0524","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-04-02T03:53:46Z","cross_cats_sorted":[],"title_canon_sha256":"b79e1dcc0ef296691780b975b7e6145c462168b821abb18115cce99d36982c85","abstract_canon_sha256":"e7c53cbbf4ed15d17576d9676070f22d6f9f95febe2967f9b392cd6391189a4e"},"schema_version":"1.0"},"canonical_sha256":"a34ebe819779fe9c2fd13fde8f5cc847561fe0d05346285d29a0a646ae2137a0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:15.170158Z","signature_b64":"3Zv/IVfSecjK+IIwcdfxBhkdEVaNKeK1CvhyHoPytJWKlOBkB3aNOPf0KI6MQXyINZ+A/3t5WGmTpSUcCMjjAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a34ebe819779fe9c2fd13fde8f5cc847561fe0d05346285d29a0a646ae2137a0","last_reissued_at":"2026-05-18T03:29:15.169483Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:15.169483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.0524","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-18T03:29:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZExKZhVa/ihfVZHi7HuiTueDRcV9olxHibSK/bx29AEFARgbrhnr4Kd/j6s1+m1NfulMIrmDuzavT+QdL4HJCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:22:33.398059Z"},"content_sha256":"4069e59bb73d1e44fd28eeaa982a141ac7195169166bb45e54feff6e260b36a2","schema_version":"1.0","event_id":"sha256:4069e59bb73d1e44fd28eeaa982a141ac7195169166bb45e54feff6e260b36a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:UNHL5AMXPH7JYL6RH7PI6XGII5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Fast Algorithm for Well-Spaced Points and Approximate Delaunay Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ameya Velingker, Donald R. Sheehy, Gary L. Miller","submitted_at":"2013-04-02T03:53:46Z","abstract_excerpt":"We present a new algorithm that produces a well-spaced superset of points conforming to a given input set in any dimension with guaranteed optimal output size. We also provide an approximate Delaunay graph on the output points. Our algorithm runs in expected time $O(2^{O(d)}(n\\log n + m))$, where $n$ is the input size, $m$ is the output point set size, and $d$ is the ambient dimension. The constants only depend on the desired element quality bounds.\n  To gain this new efficiency, the algorithm approximately maintains the Voronoi diagram of the current set of points by storing a superset of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0524","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-18T03:29:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WsPLVmcEU3AghLGMDAL1TW6KOXRU80XK7bmXe7UjQbjNaDQX7K4mgQSRhAevNXU6H6oMD+E5+Z6BFtcjIfZSAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:22:33.398757Z"},"content_sha256":"d14e924fa53fef8439f2829d2540a5352fe9b126d8c267374af5e95cf4780190","schema_version":"1.0","event_id":"sha256:d14e924fa53fef8439f2829d2540a5352fe9b126d8c267374af5e95cf4780190"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UNHL5AMXPH7JYL6RH7PI6XGII5/bundle.json","state_url":"https://pith.science/pith/UNHL5AMXPH7JYL6RH7PI6XGII5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UNHL5AMXPH7JYL6RH7PI6XGII5/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-26T03:22:33Z","links":{"resolver":"https://pith.science/pith/UNHL5AMXPH7JYL6RH7PI6XGII5","bundle":"https://pith.science/pith/UNHL5AMXPH7JYL6RH7PI6XGII5/bundle.json","state":"https://pith.science/pith/UNHL5AMXPH7JYL6RH7PI6XGII5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UNHL5AMXPH7JYL6RH7PI6XGII5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:UNHL5AMXPH7JYL6RH7PI6XGII5","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":"e7c53cbbf4ed15d17576d9676070f22d6f9f95febe2967f9b392cd6391189a4e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-04-02T03:53:46Z","title_canon_sha256":"b79e1dcc0ef296691780b975b7e6145c462168b821abb18115cce99d36982c85"},"schema_version":"1.0","source":{"id":"1304.0524","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.0524","created_at":"2026-05-18T03:29:15Z"},{"alias_kind":"arxiv_version","alias_value":"1304.0524v1","created_at":"2026-05-18T03:29:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0524","created_at":"2026-05-18T03:29:15Z"},{"alias_kind":"pith_short_12","alias_value":"UNHL5AMXPH7J","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UNHL5AMXPH7JYL6R","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UNHL5AMX","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:d14e924fa53fef8439f2829d2540a5352fe9b126d8c267374af5e95cf4780190","target":"graph","created_at":"2026-05-18T03:29:15Z","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":"We present a new algorithm that produces a well-spaced superset of points conforming to a given input set in any dimension with guaranteed optimal output size. We also provide an approximate Delaunay graph on the output points. Our algorithm runs in expected time $O(2^{O(d)}(n\\log n + m))$, where $n$ is the input size, $m$ is the output point set size, and $d$ is the ambient dimension. The constants only depend on the desired element quality bounds.\n  To gain this new efficiency, the algorithm approximately maintains the Voronoi diagram of the current set of points by storing a superset of the","authors_text":"Ameya Velingker, Donald R. Sheehy, Gary L. Miller","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-04-02T03:53:46Z","title":"A Fast Algorithm for Well-Spaced Points and Approximate Delaunay Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0524","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:4069e59bb73d1e44fd28eeaa982a141ac7195169166bb45e54feff6e260b36a2","target":"record","created_at":"2026-05-18T03:29:15Z","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":"e7c53cbbf4ed15d17576d9676070f22d6f9f95febe2967f9b392cd6391189a4e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-04-02T03:53:46Z","title_canon_sha256":"b79e1dcc0ef296691780b975b7e6145c462168b821abb18115cce99d36982c85"},"schema_version":"1.0","source":{"id":"1304.0524","kind":"arxiv","version":1}},"canonical_sha256":"a34ebe819779fe9c2fd13fde8f5cc847561fe0d05346285d29a0a646ae2137a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a34ebe819779fe9c2fd13fde8f5cc847561fe0d05346285d29a0a646ae2137a0","first_computed_at":"2026-05-18T03:29:15.169483Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:15.169483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3Zv/IVfSecjK+IIwcdfxBhkdEVaNKeK1CvhyHoPytJWKlOBkB3aNOPf0KI6MQXyINZ+A/3t5WGmTpSUcCMjjAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:15.170158Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.0524","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4069e59bb73d1e44fd28eeaa982a141ac7195169166bb45e54feff6e260b36a2","sha256:d14e924fa53fef8439f2829d2540a5352fe9b126d8c267374af5e95cf4780190"],"state_sha256":"8ff40ec4b9b9fcd9894ff28900801367458aa3e076e507d5032ba9c2be3cd6d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tdA9vG8tL9ZsaCUINdgss43aXBeSkEEPi0Jx0AFZgceAWnRRvKSKW513XGIfKAXjL/GiEN6XNneN3m4S05WHBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T03:22:33.402191Z","bundle_sha256":"2cfeeecd3b63603d44c1c210f9965c6bc3d3c2e4ce7971ca8b0348d6d7836ebc"}}