{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:3WWMK44IKEPJH5XXK6LOSDVCNO","short_pith_number":"pith:3WWMK44I","canonical_record":{"source":{"id":"1112.0611","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-12-03T00:27:50Z","cross_cats_sorted":[],"title_canon_sha256":"fd0754041fb2a13f997abe74e84b53ebb757850f8e36272b18116ea3615e8498","abstract_canon_sha256":"a354fe5b89de2a5816bb6c836985be8e1b6152ed84ecd26bb409a79b01c1f97d"},"schema_version":"1.0"},"canonical_sha256":"ddacc57388511e93f6f75796e90ea26b8b00b5e41d3cf3f38a4cdba09eb83742","source":{"kind":"arxiv","id":"1112.0611","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.0611","created_at":"2026-05-18T04:07:06Z"},{"alias_kind":"arxiv_version","alias_value":"1112.0611v1","created_at":"2026-05-18T04:07:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0611","created_at":"2026-05-18T04:07:06Z"},{"alias_kind":"pith_short_12","alias_value":"3WWMK44IKEPJ","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"3WWMK44IKEPJH5XX","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"3WWMK44I","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:3WWMK44IKEPJH5XXK6LOSDVCNO","target":"record","payload":{"canonical_record":{"source":{"id":"1112.0611","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-12-03T00:27:50Z","cross_cats_sorted":[],"title_canon_sha256":"fd0754041fb2a13f997abe74e84b53ebb757850f8e36272b18116ea3615e8498","abstract_canon_sha256":"a354fe5b89de2a5816bb6c836985be8e1b6152ed84ecd26bb409a79b01c1f97d"},"schema_version":"1.0"},"canonical_sha256":"ddacc57388511e93f6f75796e90ea26b8b00b5e41d3cf3f38a4cdba09eb83742","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:06.155512Z","signature_b64":"YrhRNcH1j7nxs/uWGYLxOBSJ5vGylRO2QjUv7KwV9ceY/y+EISxZE8cyOA8pOtvJX5smAQJalQmu0xQ3gynWDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ddacc57388511e93f6f75796e90ea26b8b00b5e41d3cf3f38a4cdba09eb83742","last_reissued_at":"2026-05-18T04:07:06.154805Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:06.154805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.0611","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-18T04:07:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0/GTZwB5Vx+0JVp2ji7/xvFtlSL4Vl19Ggke5s4DooST96z06v0xb4KS0TTBxwDQpOdI+SQ5mNqA1LN2FRWvAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:01:43.399985Z"},"content_sha256":"f547219b45026df13caf6ec37770737237c7bcba48b68376d9e651b41f4d50c8","schema_version":"1.0","event_id":"sha256:f547219b45026df13caf6ec37770737237c7bcba48b68376d9e651b41f4d50c8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:3WWMK44IKEPJH5XXK6LOSDVCNO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Information-Maximization Clustering based on Squared-Loss Mutual Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Hirotaka Hachiya, Makoto Yamada, Manabu Kimura, Masashi Sugiyama","submitted_at":"2011-12-03T00:27:50Z","abstract_excerpt":"Information-maximization clustering learns a probabilistic classifier in an unsupervised manner so that mutual information between feature vectors and cluster assignments is maximized. A notable advantage of this approach is that it only involves continuous optimization of model parameters, which is substantially easier to solve than discrete optimization of cluster assignments. However, existing methods still involve non-convex optimization problems, and therefore finding a good local optimal solution is not straightforward in practice. In this paper, we propose an alternative information-max"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.0611","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-18T04:07:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JbInqK0jo1GNOBsk2yyqr3LEP2ssePdgBBJsINl+gKfgk9swuRZ+Dw6eWqI6e+7lD31EORPukL52mL5Tq0uSDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:01:43.400353Z"},"content_sha256":"5817024fbab7ac82af6b34861719ef2bfeb7beaf1ce453c7dda2c6a167bfd28d","schema_version":"1.0","event_id":"sha256:5817024fbab7ac82af6b34861719ef2bfeb7beaf1ce453c7dda2c6a167bfd28d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3WWMK44IKEPJH5XXK6LOSDVCNO/bundle.json","state_url":"https://pith.science/pith/3WWMK44IKEPJH5XXK6LOSDVCNO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3WWMK44IKEPJH5XXK6LOSDVCNO/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-09T16:01:43Z","links":{"resolver":"https://pith.science/pith/3WWMK44IKEPJH5XXK6LOSDVCNO","bundle":"https://pith.science/pith/3WWMK44IKEPJH5XXK6LOSDVCNO/bundle.json","state":"https://pith.science/pith/3WWMK44IKEPJH5XXK6LOSDVCNO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3WWMK44IKEPJH5XXK6LOSDVCNO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:3WWMK44IKEPJH5XXK6LOSDVCNO","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":"a354fe5b89de2a5816bb6c836985be8e1b6152ed84ecd26bb409a79b01c1f97d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-12-03T00:27:50Z","title_canon_sha256":"fd0754041fb2a13f997abe74e84b53ebb757850f8e36272b18116ea3615e8498"},"schema_version":"1.0","source":{"id":"1112.0611","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.0611","created_at":"2026-05-18T04:07:06Z"},{"alias_kind":"arxiv_version","alias_value":"1112.0611v1","created_at":"2026-05-18T04:07:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0611","created_at":"2026-05-18T04:07:06Z"},{"alias_kind":"pith_short_12","alias_value":"3WWMK44IKEPJ","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"3WWMK44IKEPJH5XX","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"3WWMK44I","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:5817024fbab7ac82af6b34861719ef2bfeb7beaf1ce453c7dda2c6a167bfd28d","target":"graph","created_at":"2026-05-18T04:07:06Z","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":"Information-maximization clustering learns a probabilistic classifier in an unsupervised manner so that mutual information between feature vectors and cluster assignments is maximized. A notable advantage of this approach is that it only involves continuous optimization of model parameters, which is substantially easier to solve than discrete optimization of cluster assignments. However, existing methods still involve non-convex optimization problems, and therefore finding a good local optimal solution is not straightforward in practice. In this paper, we propose an alternative information-max","authors_text":"Hirotaka Hachiya, Makoto Yamada, Manabu Kimura, Masashi Sugiyama","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-12-03T00:27:50Z","title":"Information-Maximization Clustering based on Squared-Loss Mutual Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.0611","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:f547219b45026df13caf6ec37770737237c7bcba48b68376d9e651b41f4d50c8","target":"record","created_at":"2026-05-18T04:07:06Z","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":"a354fe5b89de2a5816bb6c836985be8e1b6152ed84ecd26bb409a79b01c1f97d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-12-03T00:27:50Z","title_canon_sha256":"fd0754041fb2a13f997abe74e84b53ebb757850f8e36272b18116ea3615e8498"},"schema_version":"1.0","source":{"id":"1112.0611","kind":"arxiv","version":1}},"canonical_sha256":"ddacc57388511e93f6f75796e90ea26b8b00b5e41d3cf3f38a4cdba09eb83742","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ddacc57388511e93f6f75796e90ea26b8b00b5e41d3cf3f38a4cdba09eb83742","first_computed_at":"2026-05-18T04:07:06.154805Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:07:06.154805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YrhRNcH1j7nxs/uWGYLxOBSJ5vGylRO2QjUv7KwV9ceY/y+EISxZE8cyOA8pOtvJX5smAQJalQmu0xQ3gynWDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:07:06.155512Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.0611","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f547219b45026df13caf6ec37770737237c7bcba48b68376d9e651b41f4d50c8","sha256:5817024fbab7ac82af6b34861719ef2bfeb7beaf1ce453c7dda2c6a167bfd28d"],"state_sha256":"6ff97900d5cf00766a16a65b9d5e4e103b0ae5996baa4e79ede8fb78ac37f0d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gbcMkzDJJo0mFGu4TEymmrI1Y2wpuFuSU/rln8XfD5MAgfOXRbzMveJn6oQffuE/cN1iKGKhwxpK5rhqxaZMDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T16:01:43.402386Z","bundle_sha256":"fded791c91ddc6e4d4eca6ca7561446f4219f9a4b5259a3271b654b6324751ed"}}