{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:OV3YSW5YEPXKKQCUOL2CMMQSCX","short_pith_number":"pith:OV3YSW5Y","schema_version":"1.0","canonical_sha256":"7577895bb823eea5405472f426321215c9ecb7f88c9f925b7aead22b4b904b2c","source":{"kind":"arxiv","id":"1408.0972","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1408.0972","created_at":"2026-05-18T02:45:50.060591+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.0972v1","created_at":"2026-05-18T02:45:50.060591+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0972","created_at":"2026-05-18T02:45:50.060591+00:00"},{"alias_kind":"pith_short_12","alias_value":"OV3YSW5YEPXK","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OV3YSW5YEPXKKQCU","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OV3YSW5Y","created_at":"2026-05-18T12:28:43.426989+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OV3YSW5YEPXKKQCUOL2CMMQSCX","json":"https://pith.science/pith/OV3YSW5YEPXKKQCUOL2CMMQSCX.json","graph_json":"https://pith.science/api/pith-number/OV3YSW5YEPXKKQCUOL2CMMQSCX/graph.json","events_json":"https://pith.science/api/pith-number/OV3YSW5YEPXKKQCUOL2CMMQSCX/events.json","paper":"https://pith.science/paper/OV3YSW5Y"},"agent_actions":{"view_html":"https://pith.science/pith/OV3YSW5YEPXKKQCUOL2CMMQSCX","download_json":"https://pith.science/pith/OV3YSW5YEPXKKQCUOL2CMMQSCX.json","view_paper":"https://pith.science/paper/OV3YSW5Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.0972&json=true","fetch_graph":"https://pith.science/api/pith-number/OV3YSW5YEPXKKQCUOL2CMMQSCX/graph.json","fetch_events":"https://pith.science/api/pith-number/OV3YSW5YEPXKKQCUOL2CMMQSCX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OV3YSW5YEPXKKQCUOL2CMMQSCX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OV3YSW5YEPXKKQCUOL2CMMQSCX/action/storage_attestation","attest_author":"https://pith.science/pith/OV3YSW5YEPXKKQCUOL2CMMQSCX/action/author_attestation","sign_citation":"https://pith.science/pith/OV3YSW5YEPXKKQCUOL2CMMQSCX/action/citation_signature","submit_replication":"https://pith.science/pith/OV3YSW5YEPXKKQCUOL2CMMQSCX/action/replication_record"}},"created_at":"2026-05-18T02:45:50.060591+00:00","updated_at":"2026-05-18T02:45:50.060591+00:00"}