{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5WMJCPXVXYRAY3PO4MEOSFAQ7M","short_pith_number":"pith:5WMJCPXV","schema_version":"1.0","canonical_sha256":"ed98913ef5be220c6deee308e91410fb3d6838c2b258118e26d266bf422c62a7","source":{"kind":"arxiv","id":"1304.8020","version":2},"attestation_state":"computed","paper":{"title":"Semi-Supervised Information-Maximization Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Daniele Calandriello, Gang Niu, Masashi Sugiyama","submitted_at":"2013-04-30T14:59:49Z","abstract_excerpt":"Semi-supervised clustering aims to introduce prior knowledge in the decision process of a clustering algorithm. In this paper, we propose a novel semi-supervised clustering algorithm based on the information-maximization principle. The proposed method is an extension of a previous unsupervised information-maximization clustering algorithm based on squared-loss mutual information to effectively incorporate must-links and cannot-links. The proposed method is computationally efficient because the clustering solution can be obtained analytically via eigendecomposition. Furthermore, the proposed me"},"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":"1304.8020","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-04-30T14:59:49Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"e71dd52b29cd13176ca84f31a563bfd159e1dd0495939a31af3ca84c6fab8e96","abstract_canon_sha256":"b646e74db456a468e8856fe5c6f7493ff7a04cef4ef7ed6c34c4119253c3ff1d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:42.306201Z","signature_b64":"yvzJ9cosHSLgOSsv0MGmzFva6/jueH5FDV3OMZQ2uiPOllVxPA8W/HlGUeRwVSxmLH3dn5qRmFx14S/mJY7ZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed98913ef5be220c6deee308e91410fb3d6838c2b258118e26d266bf422c62a7","last_reissued_at":"2026-05-18T03:26:42.305595Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:42.305595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Semi-Supervised Information-Maximization Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Daniele Calandriello, Gang Niu, Masashi Sugiyama","submitted_at":"2013-04-30T14:59:49Z","abstract_excerpt":"Semi-supervised clustering aims to introduce prior knowledge in the decision process of a clustering algorithm. In this paper, we propose a novel semi-supervised clustering algorithm based on the information-maximization principle. The proposed method is an extension of a previous unsupervised information-maximization clustering algorithm based on squared-loss mutual information to effectively incorporate must-links and cannot-links. The proposed method is computationally efficient because the clustering solution can be obtained analytically via eigendecomposition. Furthermore, the proposed me"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.8020","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1304.8020","created_at":"2026-05-18T03:26:42.305685+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.8020v2","created_at":"2026-05-18T03:26:42.305685+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.8020","created_at":"2026-05-18T03:26:42.305685+00:00"},{"alias_kind":"pith_short_12","alias_value":"5WMJCPXVXYRA","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5WMJCPXVXYRAY3PO","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5WMJCPXV","created_at":"2026-05-18T12:27:34.582898+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/5WMJCPXVXYRAY3PO4MEOSFAQ7M","json":"https://pith.science/pith/5WMJCPXVXYRAY3PO4MEOSFAQ7M.json","graph_json":"https://pith.science/api/pith-number/5WMJCPXVXYRAY3PO4MEOSFAQ7M/graph.json","events_json":"https://pith.science/api/pith-number/5WMJCPXVXYRAY3PO4MEOSFAQ7M/events.json","paper":"https://pith.science/paper/5WMJCPXV"},"agent_actions":{"view_html":"https://pith.science/pith/5WMJCPXVXYRAY3PO4MEOSFAQ7M","download_json":"https://pith.science/pith/5WMJCPXVXYRAY3PO4MEOSFAQ7M.json","view_paper":"https://pith.science/paper/5WMJCPXV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.8020&json=true","fetch_graph":"https://pith.science/api/pith-number/5WMJCPXVXYRAY3PO4MEOSFAQ7M/graph.json","fetch_events":"https://pith.science/api/pith-number/5WMJCPXVXYRAY3PO4MEOSFAQ7M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5WMJCPXVXYRAY3PO4MEOSFAQ7M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5WMJCPXVXYRAY3PO4MEOSFAQ7M/action/storage_attestation","attest_author":"https://pith.science/pith/5WMJCPXVXYRAY3PO4MEOSFAQ7M/action/author_attestation","sign_citation":"https://pith.science/pith/5WMJCPXVXYRAY3PO4MEOSFAQ7M/action/citation_signature","submit_replication":"https://pith.science/pith/5WMJCPXVXYRAY3PO4MEOSFAQ7M/action/replication_record"}},"created_at":"2026-05-18T03:26:42.305685+00:00","updated_at":"2026-05-18T03:26:42.305685+00:00"}