{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:L7VJRCUWSKX6Y2RTRFDQZCXKAO","short_pith_number":"pith:L7VJRCUW","canonical_record":{"source":{"id":"1811.07615","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2018-11-19T11:11:14Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6892fa9f2761b9d58a22a4fa99c82b9da0f7c49fc291d36add96e17ffc1b9204","abstract_canon_sha256":"d0fe0aa65be97f47de04c2154f712dbfb8774b3b89a10caf75791bcf4230c960"},"schema_version":"1.0"},"canonical_sha256":"5fea988a9692afec6a3389470c8aea03aeb092ae4990874396c2a8a7df33d140","source":{"kind":"arxiv","id":"1811.07615","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.07615","created_at":"2026-05-18T00:00:23Z"},{"alias_kind":"arxiv_version","alias_value":"1811.07615v1","created_at":"2026-05-18T00:00:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07615","created_at":"2026-05-18T00:00:23Z"},{"alias_kind":"pith_short_12","alias_value":"L7VJRCUWSKX6","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"L7VJRCUWSKX6Y2RT","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"L7VJRCUW","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:L7VJRCUWSKX6Y2RTRFDQZCXKAO","target":"record","payload":{"canonical_record":{"source":{"id":"1811.07615","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2018-11-19T11:11:14Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6892fa9f2761b9d58a22a4fa99c82b9da0f7c49fc291d36add96e17ffc1b9204","abstract_canon_sha256":"d0fe0aa65be97f47de04c2154f712dbfb8774b3b89a10caf75791bcf4230c960"},"schema_version":"1.0"},"canonical_sha256":"5fea988a9692afec6a3389470c8aea03aeb092ae4990874396c2a8a7df33d140","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:23.960698Z","signature_b64":"r/564pvho5LcDSMRWgVcPB0Vo0T8ZkwURg7ogrcwoRGlggVgsvr1FO2uma81RP9iJewbgRcX10paGEoQNrJcCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fea988a9692afec6a3389470c8aea03aeb092ae4990874396c2a8a7df33d140","last_reissued_at":"2026-05-18T00:00:23.960104Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:23.960104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.07615","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:00:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XEFkP+tKurNy84EdMKRlcCMsAzBbf4td0UAR1hQC7EjXOf8ywkM8KTQ2vhJSAwMWVLGuk6wbfGTlbY+w9Js8AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:43:28.343983Z"},"content_sha256":"1a2ae68132098a045cc037fe5161420c0892c4f79b89dac7f17c5b00495e5c93","schema_version":"1.0","event_id":"sha256:1a2ae68132098a045cc037fe5161420c0892c4f79b89dac7f17c5b00495e5c93"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:L7VJRCUWSKX6Y2RTRFDQZCXKAO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An efficient density-based clustering algorithm using reverse nearest neighbour","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Renato Cordeiro de Amorim, Stiphen Chowdhury","submitted_at":"2018-11-19T11:11:14Z","abstract_excerpt":"Density-based clustering is the task of discovering high-density regions of entities (clusters) that are separated from each other by contiguous regions of low-density. DBSCAN is, arguably, the most popular density-based clustering algorithm. However, its cluster recovery capabilities depend on the combination of the two parameters. In this paper we present a new density-based clustering algorithm which uses reverse nearest neighbour (RNN) and has a single parameter. We also show that it is possible to estimate a good value for this parameter using a clustering validity index. The RNN queries "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07615","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:00:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QF/mXo9FstZ4FLMzZ5R4qn2vu6b6V35V9oGfqperz58/hQYLFCiPbutQrd72xe7707hoU3ax6naIm3QVhMxJAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:43:28.344801Z"},"content_sha256":"000da8cf35b8b338a458ab82e2aea8c2963aac2da9006cc431627936f4a65f7b","schema_version":"1.0","event_id":"sha256:000da8cf35b8b338a458ab82e2aea8c2963aac2da9006cc431627936f4a65f7b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L7VJRCUWSKX6Y2RTRFDQZCXKAO/bundle.json","state_url":"https://pith.science/pith/L7VJRCUWSKX6Y2RTRFDQZCXKAO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L7VJRCUWSKX6Y2RTRFDQZCXKAO/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-08T15:43:28Z","links":{"resolver":"https://pith.science/pith/L7VJRCUWSKX6Y2RTRFDQZCXKAO","bundle":"https://pith.science/pith/L7VJRCUWSKX6Y2RTRFDQZCXKAO/bundle.json","state":"https://pith.science/pith/L7VJRCUWSKX6Y2RTRFDQZCXKAO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L7VJRCUWSKX6Y2RTRFDQZCXKAO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:L7VJRCUWSKX6Y2RTRFDQZCXKAO","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":"d0fe0aa65be97f47de04c2154f712dbfb8774b3b89a10caf75791bcf4230c960","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2018-11-19T11:11:14Z","title_canon_sha256":"6892fa9f2761b9d58a22a4fa99c82b9da0f7c49fc291d36add96e17ffc1b9204"},"schema_version":"1.0","source":{"id":"1811.07615","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.07615","created_at":"2026-05-18T00:00:23Z"},{"alias_kind":"arxiv_version","alias_value":"1811.07615v1","created_at":"2026-05-18T00:00:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07615","created_at":"2026-05-18T00:00:23Z"},{"alias_kind":"pith_short_12","alias_value":"L7VJRCUWSKX6","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"L7VJRCUWSKX6Y2RT","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"L7VJRCUW","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:000da8cf35b8b338a458ab82e2aea8c2963aac2da9006cc431627936f4a65f7b","target":"graph","created_at":"2026-05-18T00:00:23Z","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":"Density-based clustering is the task of discovering high-density regions of entities (clusters) that are separated from each other by contiguous regions of low-density. DBSCAN is, arguably, the most popular density-based clustering algorithm. However, its cluster recovery capabilities depend on the combination of the two parameters. In this paper we present a new density-based clustering algorithm which uses reverse nearest neighbour (RNN) and has a single parameter. We also show that it is possible to estimate a good value for this parameter using a clustering validity index. The RNN queries ","authors_text":"Renato Cordeiro de Amorim, Stiphen Chowdhury","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2018-11-19T11:11:14Z","title":"An efficient density-based clustering algorithm using reverse nearest neighbour"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07615","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:1a2ae68132098a045cc037fe5161420c0892c4f79b89dac7f17c5b00495e5c93","target":"record","created_at":"2026-05-18T00:00:23Z","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":"d0fe0aa65be97f47de04c2154f712dbfb8774b3b89a10caf75791bcf4230c960","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2018-11-19T11:11:14Z","title_canon_sha256":"6892fa9f2761b9d58a22a4fa99c82b9da0f7c49fc291d36add96e17ffc1b9204"},"schema_version":"1.0","source":{"id":"1811.07615","kind":"arxiv","version":1}},"canonical_sha256":"5fea988a9692afec6a3389470c8aea03aeb092ae4990874396c2a8a7df33d140","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5fea988a9692afec6a3389470c8aea03aeb092ae4990874396c2a8a7df33d140","first_computed_at":"2026-05-18T00:00:23.960104Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:23.960104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r/564pvho5LcDSMRWgVcPB0Vo0T8ZkwURg7ogrcwoRGlggVgsvr1FO2uma81RP9iJewbgRcX10paGEoQNrJcCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:23.960698Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.07615","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a2ae68132098a045cc037fe5161420c0892c4f79b89dac7f17c5b00495e5c93","sha256:000da8cf35b8b338a458ab82e2aea8c2963aac2da9006cc431627936f4a65f7b"],"state_sha256":"535fc38bbf6226cb73f9692d3948e12b147d600bdcbd8e2796c3c24985abdace"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9g4FjiNRgEzP9cs3nQMFWeE66OKO2RofTHuaqerp44yF7OzocCW/MVAUVDTUD+RH+zBH2sV3HcQEYXt3zGOLDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T15:43:28.349105Z","bundle_sha256":"ebc167beb6c0e58174728ee27e0e91d3acd7e71c208ade27d77fc82ea01a8f75"}}