{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:T43VHX77BWE4GMSJMD5NVWUENP","short_pith_number":"pith:T43VHX77","schema_version":"1.0","canonical_sha256":"9f3753dfff0d89c3324960fadada846bc242fa14319899d7ab1a7ffd1355f541","source":{"kind":"arxiv","id":"1606.01160","version":1},"attestation_state":"computed","paper":{"title":"Robust Ensemble Clustering Using Probability Trajectories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Chang-Dong Wang, Dong Huang, Jian-Huang Lai","submitted_at":"2016-06-03T16:09:32Z","abstract_excerpt":"Although many successful ensemble clustering approaches have been developed in recent years, there are still two limitations to most of the existing approaches. First, they mostly overlook the issue of uncertain links, which may mislead the overall consensus process. Second, they generally lack the ability to incorporate global information to refine the local links. To address these two limitations, in this paper, we propose a novel ensemble clustering approach based on sparse graph representation and probability trajectory analysis. In particular, we present the elite neighbor selection strat"},"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":"1606.01160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-03T16:09:32Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"df6d2cb14228e068dd6432d5ec93814e4155636c46cb99b43d4b4903f63d553d","abstract_canon_sha256":"1c5443b11175b1b1d822217da95521ee693fccb81dae7a3de9cc8bb8f9e4473d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:59.194492Z","signature_b64":"h2YUWjd3DIhxymOzBNxbzNu/NplXpgGYzzXzzZSZ/OCJjz0v25DWSnFZ3nDtPnoMgTCDSVAHNV3MALx/EPz7Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f3753dfff0d89c3324960fadada846bc242fa14319899d7ab1a7ffd1355f541","last_reissued_at":"2026-05-18T01:12:59.194151Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:59.194151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Ensemble Clustering Using Probability Trajectories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Chang-Dong Wang, Dong Huang, Jian-Huang Lai","submitted_at":"2016-06-03T16:09:32Z","abstract_excerpt":"Although many successful ensemble clustering approaches have been developed in recent years, there are still two limitations to most of the existing approaches. First, they mostly overlook the issue of uncertain links, which may mislead the overall consensus process. Second, they generally lack the ability to incorporate global information to refine the local links. To address these two limitations, in this paper, we propose a novel ensemble clustering approach based on sparse graph representation and probability trajectory analysis. In particular, we present the elite neighbor selection strat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.01160","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":"1606.01160","created_at":"2026-05-18T01:12:59.194204+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.01160v1","created_at":"2026-05-18T01:12:59.194204+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.01160","created_at":"2026-05-18T01:12:59.194204+00:00"},{"alias_kind":"pith_short_12","alias_value":"T43VHX77BWE4","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"T43VHX77BWE4GMSJ","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"T43VHX77","created_at":"2026-05-18T12:30:44.179134+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/T43VHX77BWE4GMSJMD5NVWUENP","json":"https://pith.science/pith/T43VHX77BWE4GMSJMD5NVWUENP.json","graph_json":"https://pith.science/api/pith-number/T43VHX77BWE4GMSJMD5NVWUENP/graph.json","events_json":"https://pith.science/api/pith-number/T43VHX77BWE4GMSJMD5NVWUENP/events.json","paper":"https://pith.science/paper/T43VHX77"},"agent_actions":{"view_html":"https://pith.science/pith/T43VHX77BWE4GMSJMD5NVWUENP","download_json":"https://pith.science/pith/T43VHX77BWE4GMSJMD5NVWUENP.json","view_paper":"https://pith.science/paper/T43VHX77","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.01160&json=true","fetch_graph":"https://pith.science/api/pith-number/T43VHX77BWE4GMSJMD5NVWUENP/graph.json","fetch_events":"https://pith.science/api/pith-number/T43VHX77BWE4GMSJMD5NVWUENP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T43VHX77BWE4GMSJMD5NVWUENP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T43VHX77BWE4GMSJMD5NVWUENP/action/storage_attestation","attest_author":"https://pith.science/pith/T43VHX77BWE4GMSJMD5NVWUENP/action/author_attestation","sign_citation":"https://pith.science/pith/T43VHX77BWE4GMSJMD5NVWUENP/action/citation_signature","submit_replication":"https://pith.science/pith/T43VHX77BWE4GMSJMD5NVWUENP/action/replication_record"}},"created_at":"2026-05-18T01:12:59.194204+00:00","updated_at":"2026-05-18T01:12:59.194204+00:00"}