{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:55HI4XGZJAHC5UQO4EFXPBMIKW","short_pith_number":"pith:55HI4XGZ","canonical_record":{"source":{"id":"1705.06753","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-18T18:01:50Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"68bbef00ed0aba35aaf4d22f8312155ac407085cac43452a8ecaff4fa1c61be6","abstract_canon_sha256":"09c16f888c56bb2b22ac56fed25e205fdac73a7defed0645d24a10f5363f99d9"},"schema_version":"1.0"},"canonical_sha256":"ef4e8e5cd9480e2ed20ee10b7785885585b061b31854482e65545c4d2806ad53","source":{"kind":"arxiv","id":"1705.06753","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.06753","created_at":"2026-05-18T00:44:11Z"},{"alias_kind":"arxiv_version","alias_value":"1705.06753v1","created_at":"2026-05-18T00:44:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06753","created_at":"2026-05-18T00:44:11Z"},{"alias_kind":"pith_short_12","alias_value":"55HI4XGZJAHC","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"55HI4XGZJAHC5UQO","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"55HI4XGZ","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:55HI4XGZJAHC5UQO4EFXPBMIKW","target":"record","payload":{"canonical_record":{"source":{"id":"1705.06753","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-18T18:01:50Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"68bbef00ed0aba35aaf4d22f8312155ac407085cac43452a8ecaff4fa1c61be6","abstract_canon_sha256":"09c16f888c56bb2b22ac56fed25e205fdac73a7defed0645d24a10f5363f99d9"},"schema_version":"1.0"},"canonical_sha256":"ef4e8e5cd9480e2ed20ee10b7785885585b061b31854482e65545c4d2806ad53","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:11.369868Z","signature_b64":"ihPMWI8GQGVpJBVSnOYCbGmgHdlotxIyle+cFACCp9MzvMAdT9YXLWES/EMDe6zSbbrRsVC2vXVc2aCXIuoBAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef4e8e5cd9480e2ed20ee10b7785885585b061b31854482e65545c4d2806ad53","last_reissued_at":"2026-05-18T00:44:11.369283Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:11.369283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.06753","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:44:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MJWquiCD+71bz1kfFj/hCNYiZ+QWvT3qQ8LhyjxGmDFLhh8FOyAXElHDFAFRAhWY6apVjE/yi3ihjRip3cVVBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T13:51:04.498929Z"},"content_sha256":"1d690aac4401d0422fad44a3d1c12ec934c995dafe9cc3ed1db2fe200e9836f3","schema_version":"1.0","event_id":"sha256:1d690aac4401d0422fad44a3d1c12ec934c995dafe9cc3ed1db2fe200e9836f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:55HI4XGZJAHC5UQO4EFXPBMIKW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Discovering the Graph Structure in the Clustering Results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Evgeny Bauman, Konstantin Bauman","submitted_at":"2017-05-18T18:01:50Z","abstract_excerpt":"In a standard cluster analysis, such as k-means, in addition to clusters locations and distances between them, it's important to know if they are connected or well separated from each other. The main focus of this paper is discovering the relations between the resulting clusters. We propose a new method which is based on pairwise overlapping k-means clustering, that in addition to means of clusters provides the graph structure of their relations. The proposed method has a set of parameters that can be tuned in order to control the sensitivity of the model and the desired relative size of the p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06753","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:44:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2u6z9QJo1qCAtQaBBghyd7mHbosmW6bpcmx3A689dyudMA58uGgO4xpVacGr6612mpfGNUL0pWbigdzhr+CUBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T13:51:04.499271Z"},"content_sha256":"16b7eefc09ca730b6e4af79db70d766db115c4e6d97369f41f9fee0899cf864e","schema_version":"1.0","event_id":"sha256:16b7eefc09ca730b6e4af79db70d766db115c4e6d97369f41f9fee0899cf864e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/55HI4XGZJAHC5UQO4EFXPBMIKW/bundle.json","state_url":"https://pith.science/pith/55HI4XGZJAHC5UQO4EFXPBMIKW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/55HI4XGZJAHC5UQO4EFXPBMIKW/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-07-02T13:51:04Z","links":{"resolver":"https://pith.science/pith/55HI4XGZJAHC5UQO4EFXPBMIKW","bundle":"https://pith.science/pith/55HI4XGZJAHC5UQO4EFXPBMIKW/bundle.json","state":"https://pith.science/pith/55HI4XGZJAHC5UQO4EFXPBMIKW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/55HI4XGZJAHC5UQO4EFXPBMIKW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:55HI4XGZJAHC5UQO4EFXPBMIKW","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":"09c16f888c56bb2b22ac56fed25e205fdac73a7defed0645d24a10f5363f99d9","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-18T18:01:50Z","title_canon_sha256":"68bbef00ed0aba35aaf4d22f8312155ac407085cac43452a8ecaff4fa1c61be6"},"schema_version":"1.0","source":{"id":"1705.06753","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.06753","created_at":"2026-05-18T00:44:11Z"},{"alias_kind":"arxiv_version","alias_value":"1705.06753v1","created_at":"2026-05-18T00:44:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06753","created_at":"2026-05-18T00:44:11Z"},{"alias_kind":"pith_short_12","alias_value":"55HI4XGZJAHC","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"55HI4XGZJAHC5UQO","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"55HI4XGZ","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:16b7eefc09ca730b6e4af79db70d766db115c4e6d97369f41f9fee0899cf864e","target":"graph","created_at":"2026-05-18T00:44:11Z","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":"In a standard cluster analysis, such as k-means, in addition to clusters locations and distances between them, it's important to know if they are connected or well separated from each other. The main focus of this paper is discovering the relations between the resulting clusters. We propose a new method which is based on pairwise overlapping k-means clustering, that in addition to means of clusters provides the graph structure of their relations. The proposed method has a set of parameters that can be tuned in order to control the sensitivity of the model and the desired relative size of the p","authors_text":"Evgeny Bauman, Konstantin Bauman","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-18T18:01:50Z","title":"Discovering the Graph Structure in the Clustering Results"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06753","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:1d690aac4401d0422fad44a3d1c12ec934c995dafe9cc3ed1db2fe200e9836f3","target":"record","created_at":"2026-05-18T00:44:11Z","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":"09c16f888c56bb2b22ac56fed25e205fdac73a7defed0645d24a10f5363f99d9","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-18T18:01:50Z","title_canon_sha256":"68bbef00ed0aba35aaf4d22f8312155ac407085cac43452a8ecaff4fa1c61be6"},"schema_version":"1.0","source":{"id":"1705.06753","kind":"arxiv","version":1}},"canonical_sha256":"ef4e8e5cd9480e2ed20ee10b7785885585b061b31854482e65545c4d2806ad53","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef4e8e5cd9480e2ed20ee10b7785885585b061b31854482e65545c4d2806ad53","first_computed_at":"2026-05-18T00:44:11.369283Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:11.369283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ihPMWI8GQGVpJBVSnOYCbGmgHdlotxIyle+cFACCp9MzvMAdT9YXLWES/EMDe6zSbbrRsVC2vXVc2aCXIuoBAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:11.369868Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.06753","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d690aac4401d0422fad44a3d1c12ec934c995dafe9cc3ed1db2fe200e9836f3","sha256:16b7eefc09ca730b6e4af79db70d766db115c4e6d97369f41f9fee0899cf864e"],"state_sha256":"e529c33065d6b922b2b295136695537b6ab5d9c97e8a9ea2edf2c4e04d13f257"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AUl9VspN1Z53s82MvGQzeRQfdJJbllLNwm65YbRr5MzIwa+rJvJ3kpCwi89kj7ivJ6ypQpOnHEdizY3oXW0dBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T13:51:04.501142Z","bundle_sha256":"929fb8715d9476e3da1f949da42661b17c0a3d9905183f7fc6bd914bcc8860a2"}}