{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:EZ6ENLDA6RKK6QOBKIHBEQEBNV","short_pith_number":"pith:EZ6ENLDA","canonical_record":{"source":{"id":"1507.05409","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-07-20T07:59:17Z","cross_cats_sorted":[],"title_canon_sha256":"022791a3975f816ad0fe5ccd8a4ec80b2b8dcfaef24fe7ad67773f8cae420955","abstract_canon_sha256":"fdc043b978e0cdcbf4c98c3c445ed5c82e4ab61b0d2ac88b3f0b3a6f4d08144f"},"schema_version":"1.0"},"canonical_sha256":"267c46ac60f454af41c1520e1240816d7709c7c5d46bc2f338c23933ce450dd1","source":{"kind":"arxiv","id":"1507.05409","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05409","created_at":"2026-05-18T01:23:08Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05409v2","created_at":"2026-05-18T01:23:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05409","created_at":"2026-05-18T01:23:08Z"},{"alias_kind":"pith_short_12","alias_value":"EZ6ENLDA6RKK","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EZ6ENLDA6RKK6QOB","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EZ6ENLDA","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:EZ6ENLDA6RKK6QOBKIHBEQEBNV","target":"record","payload":{"canonical_record":{"source":{"id":"1507.05409","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-07-20T07:59:17Z","cross_cats_sorted":[],"title_canon_sha256":"022791a3975f816ad0fe5ccd8a4ec80b2b8dcfaef24fe7ad67773f8cae420955","abstract_canon_sha256":"fdc043b978e0cdcbf4c98c3c445ed5c82e4ab61b0d2ac88b3f0b3a6f4d08144f"},"schema_version":"1.0"},"canonical_sha256":"267c46ac60f454af41c1520e1240816d7709c7c5d46bc2f338c23933ce450dd1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:08.313807Z","signature_b64":"NRXPoDlDHAXcJtbuSWkGHHicqeO7QxBsWYEj45JTe0GBSyfk7+QuR6oQqesWa6WCOhqw9i01q4MXRtZJ0zlvDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"267c46ac60f454af41c1520e1240816d7709c7c5d46bc2f338c23933ce450dd1","last_reissued_at":"2026-05-18T01:23:08.313007Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:08.313007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.05409","source_version":2,"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:23:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"boK5MzJOrk1c11/JvFY2bXsTXrY6NJyJU3O7WaX+/u7hb4ERU7j3vmeOE6luK5fitRhB9FN3EUhi8GlNe3cqAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:45:55.953448Z"},"content_sha256":"dba0afd375c4ea022fff726912bf2450e8759ff9a9b199a1d33b5ad94ab2c974","schema_version":"1.0","event_id":"sha256:dba0afd375c4ea022fff726912bf2450e8759ff9a9b199a1d33b5ad94ab2c974"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:EZ6ENLDA6RKK6QOBKIHBEQEBNV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Parameter-free Affinity Based Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Bhaskar Mukhoty, Ruchir Gupta, Y. N. Singh","submitted_at":"2015-07-20T07:59:17Z","abstract_excerpt":"Several methods have been proposed to estimate the number of clusters in a dataset; the basic ideal behind all of them has been to study an index that measures inter-cluster separation and intra-cluster cohesion over a range of cluster numbers and report the number which gives an optimum value of the index. In this paper we propose a simple, parameter free approach that is like human cognition to form clusters, where closely lying points are easily identified to form a cluster and total number of clusters are revealed. To identify closely lying points, affinity of two points is defined as a fu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05409","kind":"arxiv","version":2},"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:23:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xS+0+LCp+DgUW9SNd5d65nPApNYlsmLj2AlRznImM8ESP0JN3JnPzoZ6yOd9kKPZtqqHekU7KlGxjNEm7lYVBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:45:55.953821Z"},"content_sha256":"1a9435e69a3efc1683a9faadb8bb3bc2c1c992aa86360b739e036976c18cec48","schema_version":"1.0","event_id":"sha256:1a9435e69a3efc1683a9faadb8bb3bc2c1c992aa86360b739e036976c18cec48"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EZ6ENLDA6RKK6QOBKIHBEQEBNV/bundle.json","state_url":"https://pith.science/pith/EZ6ENLDA6RKK6QOBKIHBEQEBNV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EZ6ENLDA6RKK6QOBKIHBEQEBNV/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-02T04:45:55Z","links":{"resolver":"https://pith.science/pith/EZ6ENLDA6RKK6QOBKIHBEQEBNV","bundle":"https://pith.science/pith/EZ6ENLDA6RKK6QOBKIHBEQEBNV/bundle.json","state":"https://pith.science/pith/EZ6ENLDA6RKK6QOBKIHBEQEBNV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EZ6ENLDA6RKK6QOBKIHBEQEBNV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EZ6ENLDA6RKK6QOBKIHBEQEBNV","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":"fdc043b978e0cdcbf4c98c3c445ed5c82e4ab61b0d2ac88b3f0b3a6f4d08144f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-07-20T07:59:17Z","title_canon_sha256":"022791a3975f816ad0fe5ccd8a4ec80b2b8dcfaef24fe7ad67773f8cae420955"},"schema_version":"1.0","source":{"id":"1507.05409","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05409","created_at":"2026-05-18T01:23:08Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05409v2","created_at":"2026-05-18T01:23:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05409","created_at":"2026-05-18T01:23:08Z"},{"alias_kind":"pith_short_12","alias_value":"EZ6ENLDA6RKK","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EZ6ENLDA6RKK6QOB","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EZ6ENLDA","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:1a9435e69a3efc1683a9faadb8bb3bc2c1c992aa86360b739e036976c18cec48","target":"graph","created_at":"2026-05-18T01:23:08Z","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":"Several methods have been proposed to estimate the number of clusters in a dataset; the basic ideal behind all of them has been to study an index that measures inter-cluster separation and intra-cluster cohesion over a range of cluster numbers and report the number which gives an optimum value of the index. In this paper we propose a simple, parameter free approach that is like human cognition to form clusters, where closely lying points are easily identified to form a cluster and total number of clusters are revealed. To identify closely lying points, affinity of two points is defined as a fu","authors_text":"Bhaskar Mukhoty, Ruchir Gupta, Y. N. Singh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-07-20T07:59:17Z","title":"A Parameter-free Affinity Based Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05409","kind":"arxiv","version":2},"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:dba0afd375c4ea022fff726912bf2450e8759ff9a9b199a1d33b5ad94ab2c974","target":"record","created_at":"2026-05-18T01:23:08Z","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":"fdc043b978e0cdcbf4c98c3c445ed5c82e4ab61b0d2ac88b3f0b3a6f4d08144f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-07-20T07:59:17Z","title_canon_sha256":"022791a3975f816ad0fe5ccd8a4ec80b2b8dcfaef24fe7ad67773f8cae420955"},"schema_version":"1.0","source":{"id":"1507.05409","kind":"arxiv","version":2}},"canonical_sha256":"267c46ac60f454af41c1520e1240816d7709c7c5d46bc2f338c23933ce450dd1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"267c46ac60f454af41c1520e1240816d7709c7c5d46bc2f338c23933ce450dd1","first_computed_at":"2026-05-18T01:23:08.313007Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:08.313007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NRXPoDlDHAXcJtbuSWkGHHicqeO7QxBsWYEj45JTe0GBSyfk7+QuR6oQqesWa6WCOhqw9i01q4MXRtZJ0zlvDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:08.313807Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.05409","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dba0afd375c4ea022fff726912bf2450e8759ff9a9b199a1d33b5ad94ab2c974","sha256:1a9435e69a3efc1683a9faadb8bb3bc2c1c992aa86360b739e036976c18cec48"],"state_sha256":"6ca6b6c281ddc8bc2fb5097637f3289336109bef88d6145b17dd8d4f29203225"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oXw0FzqX3VdDzMnsVcTfJNioY6ujcH+Fnn85uP4ec5hdbUv70SzbAMq366ZYmovvWIN/XzhEqSOxvVb/celSDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:45:55.955820Z","bundle_sha256":"c7343085ec4e505738d5d123cc28ed23acdd1cb12375b7638e5ab85723e1e156"}}