{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QZZU4CUPVARNAY4UUHMW3TLUZG","short_pith_number":"pith:QZZU4CUP","canonical_record":{"source":{"id":"1702.08607","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-02-28T02:18:54Z","cross_cats_sorted":[],"title_canon_sha256":"5470142947a5a2f114c7b6412ac2b15673b81334131e7cdcb829dd09552d291e","abstract_canon_sha256":"1d874cfed8c560574611c68783ddf50452f818e5a36bd900d34331fe6b312dc2"},"schema_version":"1.0"},"canonical_sha256":"86734e0a8fa822d06394a1d96dcd74c9a12fccb7c405aeae95775f1810b52f76","source":{"kind":"arxiv","id":"1702.08607","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08607","created_at":"2026-05-18T00:49:48Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08607v1","created_at":"2026-05-18T00:49:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08607","created_at":"2026-05-18T00:49:48Z"},{"alias_kind":"pith_short_12","alias_value":"QZZU4CUPVARN","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QZZU4CUPVARNAY4U","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QZZU4CUP","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QZZU4CUPVARNAY4UUHMW3TLUZG","target":"record","payload":{"canonical_record":{"source":{"id":"1702.08607","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-02-28T02:18:54Z","cross_cats_sorted":[],"title_canon_sha256":"5470142947a5a2f114c7b6412ac2b15673b81334131e7cdcb829dd09552d291e","abstract_canon_sha256":"1d874cfed8c560574611c68783ddf50452f818e5a36bd900d34331fe6b312dc2"},"schema_version":"1.0"},"canonical_sha256":"86734e0a8fa822d06394a1d96dcd74c9a12fccb7c405aeae95775f1810b52f76","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:48.278780Z","signature_b64":"L6XbzxeTYqLTqIrLUZojxFEvby/+b+mtWxuT7/MZ/pvlhj3eW7/npbUqNt21yjT7+Imrz0Gl7icYWU2y/3kZCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86734e0a8fa822d06394a1d96dcd74c9a12fccb7c405aeae95775f1810b52f76","last_reissued_at":"2026-05-18T00:49:48.278207Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:48.278207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.08607","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-18T00:49:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2aPa6HXBBh+YfnkWIRY63ncHQpQzGFqcClR9G89vbCb1cVWUSf4Z0j0/plAmLOVhoN+1pLTt79sT/bXkrqgqDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:19:46.143885Z"},"content_sha256":"9a0e6388f3c1588570b5c804634a195189d3cd0bda2f03b3217fa585f9ac7f26","schema_version":"1.0","event_id":"sha256:9a0e6388f3c1588570b5c804634a195189d3cd0bda2f03b3217fa585f9ac7f26"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QZZU4CUPVARNAY4UUHMW3TLUZG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster DB-scan and HDB-scan in Low-Dimensional Euclidean Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ade Gunawan, Marcel Roeloffzen, Mark de Berg","submitted_at":"2017-02-28T02:18:54Z","abstract_excerpt":"We present a new algorithm for the widely used density-based clustering method DBscan. Our algorithm computes the DBscan-clustering in $O(n\\log n)$ time in $\\mathbb{R}^2$, irrespective of the scale parameter $\\varepsilon$ (and assuming the second parameter MinPts is set to a fixed constant, as is the case in practice). Experiments show that the new algorithm is not only fast in theory, but that a slightly simplified version is competitive in practice and much less sensitive to the choice of $\\varepsilon$ than the original DBscan algorithm. We also present an $O(n\\log n)$ randomized algorithm f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08607","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-18T00:49:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+nf/AutfsdLTNjYHa7v2eIBmnymStPioztUbs54OimcN5cC1XPt9a4uCxW7GBlREADjngA6mYoia2BTCs2m/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:19:46.144231Z"},"content_sha256":"b690132a5eefb83ed9e33ee129ff3af7735f023c3aa5572084e663e4a83e69f0","schema_version":"1.0","event_id":"sha256:b690132a5eefb83ed9e33ee129ff3af7735f023c3aa5572084e663e4a83e69f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QZZU4CUPVARNAY4UUHMW3TLUZG/bundle.json","state_url":"https://pith.science/pith/QZZU4CUPVARNAY4UUHMW3TLUZG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QZZU4CUPVARNAY4UUHMW3TLUZG/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-02T02:19:46Z","links":{"resolver":"https://pith.science/pith/QZZU4CUPVARNAY4UUHMW3TLUZG","bundle":"https://pith.science/pith/QZZU4CUPVARNAY4UUHMW3TLUZG/bundle.json","state":"https://pith.science/pith/QZZU4CUPVARNAY4UUHMW3TLUZG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QZZU4CUPVARNAY4UUHMW3TLUZG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QZZU4CUPVARNAY4UUHMW3TLUZG","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":"1d874cfed8c560574611c68783ddf50452f818e5a36bd900d34331fe6b312dc2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-02-28T02:18:54Z","title_canon_sha256":"5470142947a5a2f114c7b6412ac2b15673b81334131e7cdcb829dd09552d291e"},"schema_version":"1.0","source":{"id":"1702.08607","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08607","created_at":"2026-05-18T00:49:48Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08607v1","created_at":"2026-05-18T00:49:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08607","created_at":"2026-05-18T00:49:48Z"},{"alias_kind":"pith_short_12","alias_value":"QZZU4CUPVARN","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QZZU4CUPVARNAY4U","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QZZU4CUP","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:b690132a5eefb83ed9e33ee129ff3af7735f023c3aa5572084e663e4a83e69f0","target":"graph","created_at":"2026-05-18T00:49:48Z","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 for the widely used density-based clustering method DBscan. Our algorithm computes the DBscan-clustering in $O(n\\log n)$ time in $\\mathbb{R}^2$, irrespective of the scale parameter $\\varepsilon$ (and assuming the second parameter MinPts is set to a fixed constant, as is the case in practice). Experiments show that the new algorithm is not only fast in theory, but that a slightly simplified version is competitive in practice and much less sensitive to the choice of $\\varepsilon$ than the original DBscan algorithm. We also present an $O(n\\log n)$ randomized algorithm f","authors_text":"Ade Gunawan, Marcel Roeloffzen, Mark de Berg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-02-28T02:18:54Z","title":"Faster DB-scan and HDB-scan in Low-Dimensional Euclidean Spaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08607","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:9a0e6388f3c1588570b5c804634a195189d3cd0bda2f03b3217fa585f9ac7f26","target":"record","created_at":"2026-05-18T00:49:48Z","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":"1d874cfed8c560574611c68783ddf50452f818e5a36bd900d34331fe6b312dc2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-02-28T02:18:54Z","title_canon_sha256":"5470142947a5a2f114c7b6412ac2b15673b81334131e7cdcb829dd09552d291e"},"schema_version":"1.0","source":{"id":"1702.08607","kind":"arxiv","version":1}},"canonical_sha256":"86734e0a8fa822d06394a1d96dcd74c9a12fccb7c405aeae95775f1810b52f76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86734e0a8fa822d06394a1d96dcd74c9a12fccb7c405aeae95775f1810b52f76","first_computed_at":"2026-05-18T00:49:48.278207Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:48.278207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L6XbzxeTYqLTqIrLUZojxFEvby/+b+mtWxuT7/MZ/pvlhj3eW7/npbUqNt21yjT7+Imrz0Gl7icYWU2y/3kZCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:48.278780Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.08607","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a0e6388f3c1588570b5c804634a195189d3cd0bda2f03b3217fa585f9ac7f26","sha256:b690132a5eefb83ed9e33ee129ff3af7735f023c3aa5572084e663e4a83e69f0"],"state_sha256":"cfc00eeee08e8ebf99bbb2c64e2ad398bd8b3a4ab4cd576aeb94950957b854ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C9uI7VwApXpbZHLsAgLoSoQugNXN+rgjubDPv3w9wf4uagIgHgH2ze1mFMRmKPz5n9Go6gf/PGWxcgsjlrQRDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T02:19:46.146102Z","bundle_sha256":"9e907f06702a2453802e31b1d8ffafb8a5b12d8d9371ee7c4a20d58f581f1722"}}