{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:L2E45S25UBZED7PJBN327E4WZH","short_pith_number":"pith:L2E45S25","canonical_record":{"source":{"id":"1506.02226","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-06-07T06:30:27Z","cross_cats_sorted":[],"title_canon_sha256":"12608f4cd3d76026dbdc0de49c9120197b3af6e1447679c608e81323f25d9b88","abstract_canon_sha256":"df0a7ec86e782eaef78f3a7c87ac9da0bdbd70511199f48fc9399aea64f69e20"},"schema_version":"1.0"},"canonical_sha256":"5e89cecb5da07241fde90b77af9396c9d508800680b441451b3d7cae1b569170","source":{"kind":"arxiv","id":"1506.02226","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02226","created_at":"2026-05-18T01:55:51Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02226v1","created_at":"2026-05-18T01:55:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02226","created_at":"2026-05-18T01:55:51Z"},{"alias_kind":"pith_short_12","alias_value":"L2E45S25UBZE","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"L2E45S25UBZED7PJ","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"L2E45S25","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:L2E45S25UBZED7PJBN327E4WZH","target":"record","payload":{"canonical_record":{"source":{"id":"1506.02226","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-06-07T06:30:27Z","cross_cats_sorted":[],"title_canon_sha256":"12608f4cd3d76026dbdc0de49c9120197b3af6e1447679c608e81323f25d9b88","abstract_canon_sha256":"df0a7ec86e782eaef78f3a7c87ac9da0bdbd70511199f48fc9399aea64f69e20"},"schema_version":"1.0"},"canonical_sha256":"5e89cecb5da07241fde90b77af9396c9d508800680b441451b3d7cae1b569170","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:51.799410Z","signature_b64":"+I/QBPqwbzlRqGGM9K5OSMJULMz967bEuUSItkuNNxeFQ191t7wtPe6n2VTKWqHNPw7hp81n6GU5aoJnuHGIDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e89cecb5da07241fde90b77af9396c9d508800680b441451b3d7cae1b569170","last_reissued_at":"2026-05-18T01:55:51.798902Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:51.798902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.02226","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-18T01:55:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IDJdNlaZ/79yGYamnwcxo+SDhoOQGPsFKYfZ0+DLbJLOF9jfC/9GioPk6CTGkoqtjRfMQwNwc77TitcV9QKEBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:15:30.292094Z"},"content_sha256":"d44740fa512bfd8d860ec05c238fe5aad3bd7933715d532e370fc8387dcf3f2d","schema_version":"1.0","event_id":"sha256:d44740fa512bfd8d860ec05c238fe5aad3bd7933715d532e370fc8387dcf3f2d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:L2E45S25UBZED7PJBN327E4WZH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Design and optimization of DBSCAN Algorithm based on CUDA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Bingchen Wang, Chenglong Zhang, Lei Song, Lianhe Zhao, Yu Dou, Zihao Yu","submitted_at":"2015-06-07T06:30:27Z","abstract_excerpt":"DBSCAN is a very classic algorithm for data clus- tering, which is widely used in many fields. However, with the data scale growing much more bigger than before, the traditional serial algorithm can not meet the performance requirement. Recently, parallel computing based on CUDA has developed very fast and has great advantage on big data. This paper summarizes the algorithms proposed before and improves the performance of the old DBSCAN algorithm by using CUDA and parallel computing. The algorithm uses shared memory as much as possible compared with other algorithms and it has very good scalab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02226","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-18T01:55:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F33XkuBO45c53cv96saiAHFcCAJTOPlLVwKezxpWUGRyR//3LjJNwvXUTU8Nx/aIbRPEV5aHW+C/T75RkaFdBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:15:30.292463Z"},"content_sha256":"44e9025d6ed7adb8357744024e54ed1401edf41a25474e7c5f3a3a26c07a56e2","schema_version":"1.0","event_id":"sha256:44e9025d6ed7adb8357744024e54ed1401edf41a25474e7c5f3a3a26c07a56e2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L2E45S25UBZED7PJBN327E4WZH/bundle.json","state_url":"https://pith.science/pith/L2E45S25UBZED7PJBN327E4WZH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L2E45S25UBZED7PJBN327E4WZH/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-30T15:15:30Z","links":{"resolver":"https://pith.science/pith/L2E45S25UBZED7PJBN327E4WZH","bundle":"https://pith.science/pith/L2E45S25UBZED7PJBN327E4WZH/bundle.json","state":"https://pith.science/pith/L2E45S25UBZED7PJBN327E4WZH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L2E45S25UBZED7PJBN327E4WZH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:L2E45S25UBZED7PJBN327E4WZH","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":"df0a7ec86e782eaef78f3a7c87ac9da0bdbd70511199f48fc9399aea64f69e20","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-06-07T06:30:27Z","title_canon_sha256":"12608f4cd3d76026dbdc0de49c9120197b3af6e1447679c608e81323f25d9b88"},"schema_version":"1.0","source":{"id":"1506.02226","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02226","created_at":"2026-05-18T01:55:51Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02226v1","created_at":"2026-05-18T01:55:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02226","created_at":"2026-05-18T01:55:51Z"},{"alias_kind":"pith_short_12","alias_value":"L2E45S25UBZE","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"L2E45S25UBZED7PJ","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"L2E45S25","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:44e9025d6ed7adb8357744024e54ed1401edf41a25474e7c5f3a3a26c07a56e2","target":"graph","created_at":"2026-05-18T01:55:51Z","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":"DBSCAN is a very classic algorithm for data clus- tering, which is widely used in many fields. However, with the data scale growing much more bigger than before, the traditional serial algorithm can not meet the performance requirement. Recently, parallel computing based on CUDA has developed very fast and has great advantage on big data. This paper summarizes the algorithms proposed before and improves the performance of the old DBSCAN algorithm by using CUDA and parallel computing. The algorithm uses shared memory as much as possible compared with other algorithms and it has very good scalab","authors_text":"Bingchen Wang, Chenglong Zhang, Lei Song, Lianhe Zhao, Yu Dou, Zihao Yu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-06-07T06:30:27Z","title":"Design and optimization of DBSCAN Algorithm based on CUDA"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02226","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:d44740fa512bfd8d860ec05c238fe5aad3bd7933715d532e370fc8387dcf3f2d","target":"record","created_at":"2026-05-18T01:55:51Z","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":"df0a7ec86e782eaef78f3a7c87ac9da0bdbd70511199f48fc9399aea64f69e20","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-06-07T06:30:27Z","title_canon_sha256":"12608f4cd3d76026dbdc0de49c9120197b3af6e1447679c608e81323f25d9b88"},"schema_version":"1.0","source":{"id":"1506.02226","kind":"arxiv","version":1}},"canonical_sha256":"5e89cecb5da07241fde90b77af9396c9d508800680b441451b3d7cae1b569170","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e89cecb5da07241fde90b77af9396c9d508800680b441451b3d7cae1b569170","first_computed_at":"2026-05-18T01:55:51.798902Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:55:51.798902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+I/QBPqwbzlRqGGM9K5OSMJULMz967bEuUSItkuNNxeFQ191t7wtPe6n2VTKWqHNPw7hp81n6GU5aoJnuHGIDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:55:51.799410Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.02226","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d44740fa512bfd8d860ec05c238fe5aad3bd7933715d532e370fc8387dcf3f2d","sha256:44e9025d6ed7adb8357744024e54ed1401edf41a25474e7c5f3a3a26c07a56e2"],"state_sha256":"b040771f6f37ad3627e844344af80da784ba01d084ad2bb7c3765d9dea2f0ad9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c+Es+MhJ6EpvTPYiQulYNSyCH4NYOBdIs8JupMO7FkXvf2m+wuf0EB+6djxZRoGU7+Jk7MrlD+dLAfgMBBWSCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T15:15:30.294422Z","bundle_sha256":"c23154e26a42f8676f0a076321bdef627d89e5498f02fb5a98975804f8d6bcd0"}}