{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:OV3YSW5YEPXKKQCUOL2CMMQSCX","short_pith_number":"pith:OV3YSW5Y","canonical_record":{"source":{"id":"1408.0972","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-08-05T13:54:01Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"e18fb051006f07d616ccd1ecc290be233e1966405a41fa22665f4cf5d6f8b8d9","abstract_canon_sha256":"3ea14094b69bbeb5eeb5e5e794528ffca5ceb4bdc9a0394de54220d48e938cfc"},"schema_version":"1.0"},"canonical_sha256":"7577895bb823eea5405472f426321215c9ecb7f88c9f925b7aead22b4b904b2c","source":{"kind":"arxiv","id":"1408.0972","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.0972","created_at":"2026-05-18T02:45:50Z"},{"alias_kind":"arxiv_version","alias_value":"1408.0972v1","created_at":"2026-05-18T02:45:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0972","created_at":"2026-05-18T02:45:50Z"},{"alias_kind":"pith_short_12","alias_value":"OV3YSW5YEPXK","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OV3YSW5YEPXKKQCU","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OV3YSW5Y","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:OV3YSW5YEPXKKQCUOL2CMMQSCX","target":"record","payload":{"canonical_record":{"source":{"id":"1408.0972","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-08-05T13:54:01Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"e18fb051006f07d616ccd1ecc290be233e1966405a41fa22665f4cf5d6f8b8d9","abstract_canon_sha256":"3ea14094b69bbeb5eeb5e5e794528ffca5ceb4bdc9a0394de54220d48e938cfc"},"schema_version":"1.0"},"canonical_sha256":"7577895bb823eea5405472f426321215c9ecb7f88c9f925b7aead22b4b904b2c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:50.060956Z","signature_b64":"LCWx/3QG2b4WMV2aHkgpW1FiTDUQ6W6ZjQzflQcrXOdZN+ZseOEG6TqnYjKE0XQt+4H909nlAaAoC3gig1uCBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7577895bb823eea5405472f426321215c9ecb7f88c9f925b7aead22b4b904b2c","last_reissued_at":"2026-05-18T02:45:50.060525Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:50.060525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.0972","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-18T02:45:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8zaS04FeA5PPJfduVipKpDvUWJQhKSxsE7JwEVmmhPQiZOGVRoXOAs5poNO4v83/uW7AdjonPo0tEx3p9ILICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T12:16:24.753256Z"},"content_sha256":"6f856dd089aa3c2379c9e58e84800ba52d29f59f44037f296f007d3402c51016","schema_version":"1.0","event_id":"sha256:6f856dd089aa3c2379c9e58e84800ba52d29f59f44037f296f007d3402c51016"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:OV3YSW5YEPXKKQCUOL2CMMQSCX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Flexible Iterative Framework for Consensus Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"stat.ML","authors_text":"Carl Meyer, Shaina Race","submitted_at":"2014-08-05T13:54:01Z","abstract_excerpt":"A novel framework for consensus clustering is presented which has the ability to determine both the number of clusters and a final solution using multiple algorithms. A consensus similarity matrix is formed from an ensemble using multiple algorithms and several values for k. A variety of dimension reduction techniques and clustering algorithms are considered for analysis. For noisy or high-dimensional data, an iterative technique is presented to refine this consensus matrix in way that encourages algorithms to agree upon a common solution. We utilize the theory of nearly uncoupled Markov chain"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0972","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-18T02:45:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9i9syLxy9e63XQtOyJF3M0sAl5gMUoyp+7HAy0krOUEK1RVtd3y6lWEGImrRfsjBCF0/kakk38qerZdJjcNABQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T12:16:24.753952Z"},"content_sha256":"31473340ea4f6a4f5a0ac9d15f16bd0d50d2adeb78159810b3d1ae08bc22e120","schema_version":"1.0","event_id":"sha256:31473340ea4f6a4f5a0ac9d15f16bd0d50d2adeb78159810b3d1ae08bc22e120"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OV3YSW5YEPXKKQCUOL2CMMQSCX/bundle.json","state_url":"https://pith.science/pith/OV3YSW5YEPXKKQCUOL2CMMQSCX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OV3YSW5YEPXKKQCUOL2CMMQSCX/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-06T12:16:24Z","links":{"resolver":"https://pith.science/pith/OV3YSW5YEPXKKQCUOL2CMMQSCX","bundle":"https://pith.science/pith/OV3YSW5YEPXKKQCUOL2CMMQSCX/bundle.json","state":"https://pith.science/pith/OV3YSW5YEPXKKQCUOL2CMMQSCX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OV3YSW5YEPXKKQCUOL2CMMQSCX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:OV3YSW5YEPXKKQCUOL2CMMQSCX","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":"3ea14094b69bbeb5eeb5e5e794528ffca5ceb4bdc9a0394de54220d48e938cfc","cross_cats_sorted":["cs.CV","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-08-05T13:54:01Z","title_canon_sha256":"e18fb051006f07d616ccd1ecc290be233e1966405a41fa22665f4cf5d6f8b8d9"},"schema_version":"1.0","source":{"id":"1408.0972","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.0972","created_at":"2026-05-18T02:45:50Z"},{"alias_kind":"arxiv_version","alias_value":"1408.0972v1","created_at":"2026-05-18T02:45:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0972","created_at":"2026-05-18T02:45:50Z"},{"alias_kind":"pith_short_12","alias_value":"OV3YSW5YEPXK","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OV3YSW5YEPXKKQCU","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OV3YSW5Y","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:31473340ea4f6a4f5a0ac9d15f16bd0d50d2adeb78159810b3d1ae08bc22e120","target":"graph","created_at":"2026-05-18T02:45:50Z","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":"A novel framework for consensus clustering is presented which has the ability to determine both the number of clusters and a final solution using multiple algorithms. A consensus similarity matrix is formed from an ensemble using multiple algorithms and several values for k. A variety of dimension reduction techniques and clustering algorithms are considered for analysis. For noisy or high-dimensional data, an iterative technique is presented to refine this consensus matrix in way that encourages algorithms to agree upon a common solution. We utilize the theory of nearly uncoupled Markov chain","authors_text":"Carl Meyer, Shaina Race","cross_cats":["cs.CV","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-08-05T13:54:01Z","title":"A Flexible Iterative Framework for Consensus Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0972","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:6f856dd089aa3c2379c9e58e84800ba52d29f59f44037f296f007d3402c51016","target":"record","created_at":"2026-05-18T02:45:50Z","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":"3ea14094b69bbeb5eeb5e5e794528ffca5ceb4bdc9a0394de54220d48e938cfc","cross_cats_sorted":["cs.CV","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-08-05T13:54:01Z","title_canon_sha256":"e18fb051006f07d616ccd1ecc290be233e1966405a41fa22665f4cf5d6f8b8d9"},"schema_version":"1.0","source":{"id":"1408.0972","kind":"arxiv","version":1}},"canonical_sha256":"7577895bb823eea5405472f426321215c9ecb7f88c9f925b7aead22b4b904b2c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7577895bb823eea5405472f426321215c9ecb7f88c9f925b7aead22b4b904b2c","first_computed_at":"2026-05-18T02:45:50.060525Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:50.060525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LCWx/3QG2b4WMV2aHkgpW1FiTDUQ6W6ZjQzflQcrXOdZN+ZseOEG6TqnYjKE0XQt+4H909nlAaAoC3gig1uCBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:50.060956Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.0972","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f856dd089aa3c2379c9e58e84800ba52d29f59f44037f296f007d3402c51016","sha256:31473340ea4f6a4f5a0ac9d15f16bd0d50d2adeb78159810b3d1ae08bc22e120"],"state_sha256":"26d53528305be837b576a18421f5a6fc7c9c55ee1e824511e28151d4106bb59e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SfrRKJKxdlCXMLpUfEkTz25CsVB8/rE1/dsH9K92HHb1MirPgWHBertD6qKv1d5pziskGi4olkdpqXnQe7DWAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T12:16:24.757389Z","bundle_sha256":"3389b0724bcae2bf22f7b950fac8928120e3882b23cf4221805eb28fc18ef106"}}