{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FC24DSSEN3JWXI63I445ZFIJHV","short_pith_number":"pith:FC24DSSE","schema_version":"1.0","canonical_sha256":"28b5c1ca446ed36ba3db4739dc95093d439d62a186dc0516d2d0468765240941","source":{"kind":"arxiv","id":"1407.3242","version":1},"attestation_state":"computed","paper":{"title":"Density Adaptive Parallel Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"Marcello La Rocca","submitted_at":"2014-07-11T18:24:15Z","abstract_excerpt":"In this paper we are going to introduce a new nearest neighbours based approach to clustering, and compare it with previous solutions; the resulting algorithm, which takes inspiration from both DBscan and minimum spanning tree approaches, is deterministic but proves simpler, faster and doesnt require to set in advance a value for k, the number of clusters."},"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":"1407.3242","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-11T18:24:15Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"41e541bebc68582eebb065c99dd9ebe3972dae52252cb40043e63725abd4e356","abstract_canon_sha256":"e8d53ec7e2d0bc1c75da4c5b142215540b569e3ee2e8c00a7acec70de9df79c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:51.629940Z","signature_b64":"actc9d9bnY7OTffzJT9ysFyNZ6IEVvU1LPLQDLAJFuX1YfCXGsW2lNLVd7DBowO3mFH3Ps+C/+ycqZ6pvXrLAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28b5c1ca446ed36ba3db4739dc95093d439d62a186dc0516d2d0468765240941","last_reissued_at":"2026-05-18T02:47:51.629344Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:51.629344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Density Adaptive Parallel Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"Marcello La Rocca","submitted_at":"2014-07-11T18:24:15Z","abstract_excerpt":"In this paper we are going to introduce a new nearest neighbours based approach to clustering, and compare it with previous solutions; the resulting algorithm, which takes inspiration from both DBscan and minimum spanning tree approaches, is deterministic but proves simpler, faster and doesnt require to set in advance a value for k, the number of clusters."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3242","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":"1407.3242","created_at":"2026-05-18T02:47:51.629443+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.3242v1","created_at":"2026-05-18T02:47:51.629443+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3242","created_at":"2026-05-18T02:47:51.629443+00:00"},{"alias_kind":"pith_short_12","alias_value":"FC24DSSEN3JW","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FC24DSSEN3JWXI63","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FC24DSSE","created_at":"2026-05-18T12:28:28.263976+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/FC24DSSEN3JWXI63I445ZFIJHV","json":"https://pith.science/pith/FC24DSSEN3JWXI63I445ZFIJHV.json","graph_json":"https://pith.science/api/pith-number/FC24DSSEN3JWXI63I445ZFIJHV/graph.json","events_json":"https://pith.science/api/pith-number/FC24DSSEN3JWXI63I445ZFIJHV/events.json","paper":"https://pith.science/paper/FC24DSSE"},"agent_actions":{"view_html":"https://pith.science/pith/FC24DSSEN3JWXI63I445ZFIJHV","download_json":"https://pith.science/pith/FC24DSSEN3JWXI63I445ZFIJHV.json","view_paper":"https://pith.science/paper/FC24DSSE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.3242&json=true","fetch_graph":"https://pith.science/api/pith-number/FC24DSSEN3JWXI63I445ZFIJHV/graph.json","fetch_events":"https://pith.science/api/pith-number/FC24DSSEN3JWXI63I445ZFIJHV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FC24DSSEN3JWXI63I445ZFIJHV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FC24DSSEN3JWXI63I445ZFIJHV/action/storage_attestation","attest_author":"https://pith.science/pith/FC24DSSEN3JWXI63I445ZFIJHV/action/author_attestation","sign_citation":"https://pith.science/pith/FC24DSSEN3JWXI63I445ZFIJHV/action/citation_signature","submit_replication":"https://pith.science/pith/FC24DSSEN3JWXI63I445ZFIJHV/action/replication_record"}},"created_at":"2026-05-18T02:47:51.629443+00:00","updated_at":"2026-05-18T02:47:51.629443+00:00"}