{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4IRZRLW7OW5QLVUKECOLAICAJH","short_pith_number":"pith:4IRZRLW7","canonical_record":{"source":{"id":"1701.09049","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-01-31T14:19:18Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"b22d319a4fa19fe085449180dc3994e94c65f82742115c800e2c14c3efcea20b","abstract_canon_sha256":"06a27a4dba4fcf67b5ed86bff93671b9f7e7c1881a6ccddf64826701879d6a54"},"schema_version":"1.0"},"canonical_sha256":"e22398aedf75bb05d68a209cb0204049dc3945ca5bfab7af738c0d24c0b8b14c","source":{"kind":"arxiv","id":"1701.09049","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.09049","created_at":"2026-05-18T00:51:35Z"},{"alias_kind":"arxiv_version","alias_value":"1701.09049v1","created_at":"2026-05-18T00:51:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.09049","created_at":"2026-05-18T00:51:35Z"},{"alias_kind":"pith_short_12","alias_value":"4IRZRLW7OW5Q","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4IRZRLW7OW5QLVUK","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4IRZRLW7","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4IRZRLW7OW5QLVUKECOLAICAJH","target":"record","payload":{"canonical_record":{"source":{"id":"1701.09049","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-01-31T14:19:18Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"b22d319a4fa19fe085449180dc3994e94c65f82742115c800e2c14c3efcea20b","abstract_canon_sha256":"06a27a4dba4fcf67b5ed86bff93671b9f7e7c1881a6ccddf64826701879d6a54"},"schema_version":"1.0"},"canonical_sha256":"e22398aedf75bb05d68a209cb0204049dc3945ca5bfab7af738c0d24c0b8b14c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:35.404024Z","signature_b64":"Jwk5Z8PgvwKaLMDzd1YjfohNO5xjXItqF6P1LTljF3ITDXv4JFagKzpbopm+jcdSLxHAFuXGtOHtzRHOUWoBCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e22398aedf75bb05d68a209cb0204049dc3945ca5bfab7af738c0d24c0b8b14c","last_reissued_at":"2026-05-18T00:51:35.403607Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:35.403607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.09049","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:51:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q2avHGporuE9l7+OMdIzXdiMbwG1zmNzNT1UfupTGsH9kAo4mHS03xgpK9Yf5ZluNmfHXVHkZrVDluur5GQTAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T19:55:35.194044Z"},"content_sha256":"2e3044e3f8de0af0063b64419dab79a39b39a345af014c923a3f9a7c5583d17f","schema_version":"1.0","event_id":"sha256:2e3044e3f8de0af0063b64419dab79a39b39a345af014c923a3f9a7c5583d17f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4IRZRLW7OW5QLVUKECOLAICAJH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Batch Incremental Shared Nearest Neighbor Density Based Clustering Algorithm for Dynamic Datasets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.DB","authors_text":"Amit Awekar, Panthadeep Bhattacharjee","submitted_at":"2017-01-31T14:19:18Z","abstract_excerpt":"Incremental data mining algorithms process frequent updates to dynamic datasets efficiently by avoiding redundant computation. Existing incremental extension to shared nearest neighbor density based clustering (SNND) algorithm cannot handle deletions to dataset and handles insertions only one point at a time. We present an incremental algorithm to overcome both these bottlenecks by efficiently identifying affected parts of clusters while processing updates to dataset in batch mode. We show effectiveness of our algorithm by performing experiments on large synthetic as well as real world dataset"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.09049","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:51:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DuqEVIvln3Nz3oib5xma/GmEaL9akOsGSrSJgPdioWZu9T51Y9i2bUBjpjHu/TAlZyqd77EMcX4Am2Uj7SmOBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T19:55:35.194399Z"},"content_sha256":"5b515931330febbd69512adc9c5e3f2d3d36dd206d3bdeaf36a448f2982bd22d","schema_version":"1.0","event_id":"sha256:5b515931330febbd69512adc9c5e3f2d3d36dd206d3bdeaf36a448f2982bd22d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4IRZRLW7OW5QLVUKECOLAICAJH/bundle.json","state_url":"https://pith.science/pith/4IRZRLW7OW5QLVUKECOLAICAJH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4IRZRLW7OW5QLVUKECOLAICAJH/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-28T19:55:35Z","links":{"resolver":"https://pith.science/pith/4IRZRLW7OW5QLVUKECOLAICAJH","bundle":"https://pith.science/pith/4IRZRLW7OW5QLVUKECOLAICAJH/bundle.json","state":"https://pith.science/pith/4IRZRLW7OW5QLVUKECOLAICAJH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4IRZRLW7OW5QLVUKECOLAICAJH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4IRZRLW7OW5QLVUKECOLAICAJH","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":"06a27a4dba4fcf67b5ed86bff93671b9f7e7c1881a6ccddf64826701879d6a54","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-01-31T14:19:18Z","title_canon_sha256":"b22d319a4fa19fe085449180dc3994e94c65f82742115c800e2c14c3efcea20b"},"schema_version":"1.0","source":{"id":"1701.09049","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.09049","created_at":"2026-05-18T00:51:35Z"},{"alias_kind":"arxiv_version","alias_value":"1701.09049v1","created_at":"2026-05-18T00:51:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.09049","created_at":"2026-05-18T00:51:35Z"},{"alias_kind":"pith_short_12","alias_value":"4IRZRLW7OW5Q","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4IRZRLW7OW5QLVUK","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4IRZRLW7","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:5b515931330febbd69512adc9c5e3f2d3d36dd206d3bdeaf36a448f2982bd22d","target":"graph","created_at":"2026-05-18T00:51:35Z","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":"Incremental data mining algorithms process frequent updates to dynamic datasets efficiently by avoiding redundant computation. Existing incremental extension to shared nearest neighbor density based clustering (SNND) algorithm cannot handle deletions to dataset and handles insertions only one point at a time. We present an incremental algorithm to overcome both these bottlenecks by efficiently identifying affected parts of clusters while processing updates to dataset in batch mode. We show effectiveness of our algorithm by performing experiments on large synthetic as well as real world dataset","authors_text":"Amit Awekar, Panthadeep Bhattacharjee","cross_cats":["cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-01-31T14:19:18Z","title":"Batch Incremental Shared Nearest Neighbor Density Based Clustering Algorithm for Dynamic Datasets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.09049","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:2e3044e3f8de0af0063b64419dab79a39b39a345af014c923a3f9a7c5583d17f","target":"record","created_at":"2026-05-18T00:51:35Z","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":"06a27a4dba4fcf67b5ed86bff93671b9f7e7c1881a6ccddf64826701879d6a54","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-01-31T14:19:18Z","title_canon_sha256":"b22d319a4fa19fe085449180dc3994e94c65f82742115c800e2c14c3efcea20b"},"schema_version":"1.0","source":{"id":"1701.09049","kind":"arxiv","version":1}},"canonical_sha256":"e22398aedf75bb05d68a209cb0204049dc3945ca5bfab7af738c0d24c0b8b14c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e22398aedf75bb05d68a209cb0204049dc3945ca5bfab7af738c0d24c0b8b14c","first_computed_at":"2026-05-18T00:51:35.403607Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:35.403607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Jwk5Z8PgvwKaLMDzd1YjfohNO5xjXItqF6P1LTljF3ITDXv4JFagKzpbopm+jcdSLxHAFuXGtOHtzRHOUWoBCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:35.404024Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.09049","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e3044e3f8de0af0063b64419dab79a39b39a345af014c923a3f9a7c5583d17f","sha256:5b515931330febbd69512adc9c5e3f2d3d36dd206d3bdeaf36a448f2982bd22d"],"state_sha256":"9f7f57abac89d0745e42f14a21449d61caee37db27217481b50d08c481884b1c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cciwJT6V2cB6x7JASVF1q3FJaWmm6Uhc4zlHq/W/1AS9oVSX8KGPDM3elSaskLuKxSB4V+MT9mfpSDa0DzBPDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T19:55:35.196190Z","bundle_sha256":"e94e727770903a999d85185847e49b479ef47ebd57edf0d0bfc3afb454b3e356"}}