{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LO6ITJ3VF6CNPUZLQVFK4SYMUY","short_pith_number":"pith:LO6ITJ3V","schema_version":"1.0","canonical_sha256":"5bbc89a7752f84d7d32b854aae4b0ca6090bac1205c14225948542145e9757f8","source":{"kind":"arxiv","id":"1711.01034","version":1},"attestation_state":"computed","paper":{"title":"PS-DBSCAN: An Efficient Parallel DBSCAN Algorithm Based on Platform Of AI (PAI)","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DB","authors_text":"Cen Chen, Jun Huang, Minghui Qiu, Wei Chu, Xu Hu","submitted_at":"2017-11-03T06:36:20Z","abstract_excerpt":"We present PS-DBSCAN, a communication efficient parallel DBSCAN algorithm that combines the disjoint-set data structure and Parameter Server framework in Platform of AI (PAI). Since data points within the same cluster may be distributed over different workers which result in several disjoint-sets, merging them incurs large communication costs. In our algorithm, we employ a fast global union approach to union the disjoint-sets to alleviate the communication burden. Experiments over the datasets of different scales demonstrate that PS-DBSCAN outperforms the PDSDBSCAN with 2-10 times speedup on c"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1711.01034","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2017-11-03T06:36:20Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"52f885153c887e09b230d1518c0c7cb889db6ef9efbd65c78f4f6087e0f1c65b","abstract_canon_sha256":"06c37a5ab61de50ccde6a77c95a35989e9b0d692d18941dc1a7dfe05b427185a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:24.241168Z","signature_b64":"TWC06yZvF2JeyLVlhBQJx6zrpqg1LFyPJ5t7/tvuYD/0y2zry4iHYwlQOAChRb28XLeJ0XqbNqmEsAktLBP6CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bbc89a7752f84d7d32b854aae4b0ca6090bac1205c14225948542145e9757f8","last_reissued_at":"2026-05-18T00:31:24.240701Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:24.240701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PS-DBSCAN: An Efficient Parallel DBSCAN Algorithm Based on Platform Of AI (PAI)","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DB","authors_text":"Cen Chen, Jun Huang, Minghui Qiu, Wei Chu, Xu Hu","submitted_at":"2017-11-03T06:36:20Z","abstract_excerpt":"We present PS-DBSCAN, a communication efficient parallel DBSCAN algorithm that combines the disjoint-set data structure and Parameter Server framework in Platform of AI (PAI). Since data points within the same cluster may be distributed over different workers which result in several disjoint-sets, merging them incurs large communication costs. In our algorithm, we employ a fast global union approach to union the disjoint-sets to alleviate the communication burden. Experiments over the datasets of different scales demonstrate that PS-DBSCAN outperforms the PDSDBSCAN with 2-10 times speedup on c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01034","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.01034","created_at":"2026-05-18T00:31:24.240779+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.01034v1","created_at":"2026-05-18T00:31:24.240779+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01034","created_at":"2026-05-18T00:31:24.240779+00:00"},{"alias_kind":"pith_short_12","alias_value":"LO6ITJ3VF6CN","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LO6ITJ3VF6CNPUZL","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LO6ITJ3V","created_at":"2026-05-18T12:31:28.150371+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LO6ITJ3VF6CNPUZLQVFK4SYMUY","json":"https://pith.science/pith/LO6ITJ3VF6CNPUZLQVFK4SYMUY.json","graph_json":"https://pith.science/api/pith-number/LO6ITJ3VF6CNPUZLQVFK4SYMUY/graph.json","events_json":"https://pith.science/api/pith-number/LO6ITJ3VF6CNPUZLQVFK4SYMUY/events.json","paper":"https://pith.science/paper/LO6ITJ3V"},"agent_actions":{"view_html":"https://pith.science/pith/LO6ITJ3VF6CNPUZLQVFK4SYMUY","download_json":"https://pith.science/pith/LO6ITJ3VF6CNPUZLQVFK4SYMUY.json","view_paper":"https://pith.science/paper/LO6ITJ3V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.01034&json=true","fetch_graph":"https://pith.science/api/pith-number/LO6ITJ3VF6CNPUZLQVFK4SYMUY/graph.json","fetch_events":"https://pith.science/api/pith-number/LO6ITJ3VF6CNPUZLQVFK4SYMUY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LO6ITJ3VF6CNPUZLQVFK4SYMUY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LO6ITJ3VF6CNPUZLQVFK4SYMUY/action/storage_attestation","attest_author":"https://pith.science/pith/LO6ITJ3VF6CNPUZLQVFK4SYMUY/action/author_attestation","sign_citation":"https://pith.science/pith/LO6ITJ3VF6CNPUZLQVFK4SYMUY/action/citation_signature","submit_replication":"https://pith.science/pith/LO6ITJ3VF6CNPUZLQVFK4SYMUY/action/replication_record"}},"created_at":"2026-05-18T00:31:24.240779+00:00","updated_at":"2026-05-18T00:31:24.240779+00:00"}