{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:D3Q5VPYBOAUJBOVM3XXF5LEDSJ","short_pith_number":"pith:D3Q5VPYB","canonical_record":{"source":{"id":"1503.01183","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-04T01:08:17Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2fa24292007d69b542f8023b170c5d8f2e898d7e87d83b4730290410d41c0177","abstract_canon_sha256":"08d35f9c2fa1fb15ce5f11a35879bb7d5886527a1a2924e5b173e100c7880988"},"schema_version":"1.0"},"canonical_sha256":"1ee1dabf01702890baacddee5eac8392600aa35634a8137bb15f0749e365bc5c","source":{"kind":"arxiv","id":"1503.01183","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.01183","created_at":"2026-05-18T02:25:27Z"},{"alias_kind":"arxiv_version","alias_value":"1503.01183v2","created_at":"2026-05-18T02:25:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01183","created_at":"2026-05-18T02:25:27Z"},{"alias_kind":"pith_short_12","alias_value":"D3Q5VPYBOAUJ","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"D3Q5VPYBOAUJBOVM","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"D3Q5VPYB","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:D3Q5VPYBOAUJBOVM3XXF5LEDSJ","target":"record","payload":{"canonical_record":{"source":{"id":"1503.01183","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-04T01:08:17Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2fa24292007d69b542f8023b170c5d8f2e898d7e87d83b4730290410d41c0177","abstract_canon_sha256":"08d35f9c2fa1fb15ce5f11a35879bb7d5886527a1a2924e5b173e100c7880988"},"schema_version":"1.0"},"canonical_sha256":"1ee1dabf01702890baacddee5eac8392600aa35634a8137bb15f0749e365bc5c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:27.591810Z","signature_b64":"YS8huyNrSVmgan0alOWjzdRJhQxiIf5Ej/WQSjkq3PIFaRLq4XdoKI8wgWw+yYEQzGYM/Fw5wHulciwNZm8SAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ee1dabf01702890baacddee5eac8392600aa35634a8137bb15f0749e365bc5c","last_reissued_at":"2026-05-18T02:25:27.591364Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:27.591364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.01183","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-18T02:25:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PNeHIXjKR8npwB4WsVb9zv8cjuSPhqO6tf1wkbqiZaoEY3YyPmYTumAjodp/P4uqHUUu6gsNF7K49AeacqmWDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:53:43.620309Z"},"content_sha256":"c184519ea293ad94d03bb0d417ca1e196eca510049eb5d7ec698c48248419829","schema_version":"1.0","event_id":"sha256:c184519ea293ad94d03bb0d417ca1e196eca510049eb5d7ec698c48248419829"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:D3Q5VPYBOAUJBOVM3XXF5LEDSJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A General Hybrid Clustering Technique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Bertrand Clarke, Hoyt A. Koepke, Jennifer Clarke, Saeid Amiri","submitted_at":"2015-03-04T01:08:17Z","abstract_excerpt":"Here, we propose a clustering technique for general clustering problems including those that have non-convex clusters. For a given desired number of clusters $K$, we use three stages to find a clustering. The first stage uses a hybrid clustering technique to produce a series of clusterings of various sizes (randomly selected). They key steps are to find a $K$-means clustering using $K_\\ell$ clusters where $K_\\ell \\gg K$ and then joins these small clusters by using single linkage clustering. The second stage stabilizes the result of stage one by reclustering via the `membership matrix' under Ha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01183","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-18T02:25:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6sajtg2fuw2aifFSEg1ey/oq8Nvsg7UpDQncOODaM5AvMKcmQ+zP2GzFwRebu3oQ7r/CCQsAwn6qrGrYfd3cDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:53:43.620896Z"},"content_sha256":"e22ed8b90391ec1298b0aa261762480a5343894775c5a205c6c6e69c05d8f646","schema_version":"1.0","event_id":"sha256:e22ed8b90391ec1298b0aa261762480a5343894775c5a205c6c6e69c05d8f646"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D3Q5VPYBOAUJBOVM3XXF5LEDSJ/bundle.json","state_url":"https://pith.science/pith/D3Q5VPYBOAUJBOVM3XXF5LEDSJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D3Q5VPYBOAUJBOVM3XXF5LEDSJ/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-06T16:53:43Z","links":{"resolver":"https://pith.science/pith/D3Q5VPYBOAUJBOVM3XXF5LEDSJ","bundle":"https://pith.science/pith/D3Q5VPYBOAUJBOVM3XXF5LEDSJ/bundle.json","state":"https://pith.science/pith/D3Q5VPYBOAUJBOVM3XXF5LEDSJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D3Q5VPYBOAUJBOVM3XXF5LEDSJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:D3Q5VPYBOAUJBOVM3XXF5LEDSJ","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":"08d35f9c2fa1fb15ce5f11a35879bb7d5886527a1a2924e5b173e100c7880988","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-04T01:08:17Z","title_canon_sha256":"2fa24292007d69b542f8023b170c5d8f2e898d7e87d83b4730290410d41c0177"},"schema_version":"1.0","source":{"id":"1503.01183","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.01183","created_at":"2026-05-18T02:25:27Z"},{"alias_kind":"arxiv_version","alias_value":"1503.01183v2","created_at":"2026-05-18T02:25:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01183","created_at":"2026-05-18T02:25:27Z"},{"alias_kind":"pith_short_12","alias_value":"D3Q5VPYBOAUJ","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"D3Q5VPYBOAUJBOVM","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"D3Q5VPYB","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:e22ed8b90391ec1298b0aa261762480a5343894775c5a205c6c6e69c05d8f646","target":"graph","created_at":"2026-05-18T02:25:27Z","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":"Here, we propose a clustering technique for general clustering problems including those that have non-convex clusters. For a given desired number of clusters $K$, we use three stages to find a clustering. The first stage uses a hybrid clustering technique to produce a series of clusterings of various sizes (randomly selected). They key steps are to find a $K$-means clustering using $K_\\ell$ clusters where $K_\\ell \\gg K$ and then joins these small clusters by using single linkage clustering. The second stage stabilizes the result of stage one by reclustering via the `membership matrix' under Ha","authors_text":"Bertrand Clarke, Hoyt A. Koepke, Jennifer Clarke, Saeid Amiri","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-04T01:08:17Z","title":"A General Hybrid Clustering Technique"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01183","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:c184519ea293ad94d03bb0d417ca1e196eca510049eb5d7ec698c48248419829","target":"record","created_at":"2026-05-18T02:25:27Z","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":"08d35f9c2fa1fb15ce5f11a35879bb7d5886527a1a2924e5b173e100c7880988","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-04T01:08:17Z","title_canon_sha256":"2fa24292007d69b542f8023b170c5d8f2e898d7e87d83b4730290410d41c0177"},"schema_version":"1.0","source":{"id":"1503.01183","kind":"arxiv","version":2}},"canonical_sha256":"1ee1dabf01702890baacddee5eac8392600aa35634a8137bb15f0749e365bc5c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ee1dabf01702890baacddee5eac8392600aa35634a8137bb15f0749e365bc5c","first_computed_at":"2026-05-18T02:25:27.591364Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:27.591364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YS8huyNrSVmgan0alOWjzdRJhQxiIf5Ej/WQSjkq3PIFaRLq4XdoKI8wgWw+yYEQzGYM/Fw5wHulciwNZm8SAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:27.591810Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.01183","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c184519ea293ad94d03bb0d417ca1e196eca510049eb5d7ec698c48248419829","sha256:e22ed8b90391ec1298b0aa261762480a5343894775c5a205c6c6e69c05d8f646"],"state_sha256":"a66971d673a0871b2e3a03424eacb44952df7218c94fafbaf9b316bef43aff0b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y6+LMFOpHYzAlPTHZf5d5UzYylV4wDtZaN761SBHWksdR6UH5d0W38aOizm/81WBknrdhxfKX5qGyV0G3MJkBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T16:53:43.623988Z","bundle_sha256":"3fcc0e057ad30ffe7d248c17a75ff409598472ca506c8292ec5b896fc9afcfad"}}