{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6YHQM4TH6FH4KNS4EWC72PZ4LQ","short_pith_number":"pith:6YHQM4TH","canonical_record":{"source":{"id":"1604.06626","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-22T12:32:37Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"0eeeb84a9da1bf72b5f4dfa4ee2d07cbdfabd70f28e5b79f30673111c5401d42","abstract_canon_sha256":"fb38ccad7345e0b2a9a6c14caad2f40bff6f8d2b7936760a45e5e25e45b079d8"},"schema_version":"1.0"},"canonical_sha256":"f60f067267f14fc5365c2585fd3f3c5c14f8035445334404abefbbe673628226","source":{"kind":"arxiv","id":"1604.06626","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.06626","created_at":"2026-05-18T01:16:19Z"},{"alias_kind":"arxiv_version","alias_value":"1604.06626v2","created_at":"2026-05-18T01:16:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06626","created_at":"2026-05-18T01:16:19Z"},{"alias_kind":"pith_short_12","alias_value":"6YHQM4TH6FH4","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"6YHQM4TH6FH4KNS4","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"6YHQM4TH","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6YHQM4TH6FH4KNS4EWC72PZ4LQ","target":"record","payload":{"canonical_record":{"source":{"id":"1604.06626","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-22T12:32:37Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"0eeeb84a9da1bf72b5f4dfa4ee2d07cbdfabd70f28e5b79f30673111c5401d42","abstract_canon_sha256":"fb38ccad7345e0b2a9a6c14caad2f40bff6f8d2b7936760a45e5e25e45b079d8"},"schema_version":"1.0"},"canonical_sha256":"f60f067267f14fc5365c2585fd3f3c5c14f8035445334404abefbbe673628226","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:19.946636Z","signature_b64":"1tBhto2/uI5tXTtqSXGoix7p0mfWdbj7UC+SNt9yj3qH1H7pbvxFhU40zvtTyMbElKzzgieaYhNsdRjvMTlYDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f60f067267f14fc5365c2585fd3f3c5c14f8035445334404abefbbe673628226","last_reissued_at":"2026-05-18T01:16:19.946068Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:19.946068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.06626","source_version":2,"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-18T01:16:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ysyLNyVzf6QvlcC1Z58GB1d52foKglzfsrM4b7ug7QYgwyu71+xQ3VHX38fR7HG9sHPaMeScNjrLLDWLbwdTCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T23:37:23.846336Z"},"content_sha256":"1303374dd365931d9a81e01ee57ab4677604bad081f96707b33f5fb328586482","schema_version":"1.0","event_id":"sha256:1303374dd365931d9a81e01ee57ab4677604bad081f96707b33f5fb328586482"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6YHQM4TH6FH4KNS4EWC72PZ4LQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Mean Partition Theorem of Consensus Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Brijnesh J. Jain","submitted_at":"2016-04-22T12:32:37Z","abstract_excerpt":"To devise efficient solutions for approximating a mean partition in consensus clustering, Dimitriadou et al. [3] presented a necessary condition of optimality for a consensus function based on least square distances. We show that their result is pivotal for deriving interesting properties of consensus clustering beyond optimization. For this, we present the necessary condition of optimality in a slightly stronger form in terms of the Mean Partition Theorem and extend it to the Expected Partition Theorem. To underpin its versatility, we show three examples that apply the Mean Partition Theorem:"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06626","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"},"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-18T01:16:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4A3WYHDNdSkqldQLm1ff3lcmMmHZWh9a+UUqUCGPdDpdkUqbHg6+arfHUY1GhhJl24oMWnhc5SWrZcwrzdIqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T23:37:23.847015Z"},"content_sha256":"7b7905e863c4443ddb312062cfa533c71eb070508144b28e4e3b428ba7573cb3","schema_version":"1.0","event_id":"sha256:7b7905e863c4443ddb312062cfa533c71eb070508144b28e4e3b428ba7573cb3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6YHQM4TH6FH4KNS4EWC72PZ4LQ/bundle.json","state_url":"https://pith.science/pith/6YHQM4TH6FH4KNS4EWC72PZ4LQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6YHQM4TH6FH4KNS4EWC72PZ4LQ/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-04T23:37:23Z","links":{"resolver":"https://pith.science/pith/6YHQM4TH6FH4KNS4EWC72PZ4LQ","bundle":"https://pith.science/pith/6YHQM4TH6FH4KNS4EWC72PZ4LQ/bundle.json","state":"https://pith.science/pith/6YHQM4TH6FH4KNS4EWC72PZ4LQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6YHQM4TH6FH4KNS4EWC72PZ4LQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6YHQM4TH6FH4KNS4EWC72PZ4LQ","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":"fb38ccad7345e0b2a9a6c14caad2f40bff6f8d2b7936760a45e5e25e45b079d8","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-22T12:32:37Z","title_canon_sha256":"0eeeb84a9da1bf72b5f4dfa4ee2d07cbdfabd70f28e5b79f30673111c5401d42"},"schema_version":"1.0","source":{"id":"1604.06626","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.06626","created_at":"2026-05-18T01:16:19Z"},{"alias_kind":"arxiv_version","alias_value":"1604.06626v2","created_at":"2026-05-18T01:16:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06626","created_at":"2026-05-18T01:16:19Z"},{"alias_kind":"pith_short_12","alias_value":"6YHQM4TH6FH4","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"6YHQM4TH6FH4KNS4","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"6YHQM4TH","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:7b7905e863c4443ddb312062cfa533c71eb070508144b28e4e3b428ba7573cb3","target":"graph","created_at":"2026-05-18T01:16:19Z","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":"To devise efficient solutions for approximating a mean partition in consensus clustering, Dimitriadou et al. [3] presented a necessary condition of optimality for a consensus function based on least square distances. We show that their result is pivotal for deriving interesting properties of consensus clustering beyond optimization. For this, we present the necessary condition of optimality in a slightly stronger form in terms of the Mean Partition Theorem and extend it to the Expected Partition Theorem. To underpin its versatility, we show three examples that apply the Mean Partition Theorem:","authors_text":"Brijnesh J. Jain","cross_cats":["cs.CV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-22T12:32:37Z","title":"The Mean Partition Theorem of Consensus Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06626","kind":"arxiv","version":2},"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:1303374dd365931d9a81e01ee57ab4677604bad081f96707b33f5fb328586482","target":"record","created_at":"2026-05-18T01:16:19Z","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":"fb38ccad7345e0b2a9a6c14caad2f40bff6f8d2b7936760a45e5e25e45b079d8","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-22T12:32:37Z","title_canon_sha256":"0eeeb84a9da1bf72b5f4dfa4ee2d07cbdfabd70f28e5b79f30673111c5401d42"},"schema_version":"1.0","source":{"id":"1604.06626","kind":"arxiv","version":2}},"canonical_sha256":"f60f067267f14fc5365c2585fd3f3c5c14f8035445334404abefbbe673628226","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f60f067267f14fc5365c2585fd3f3c5c14f8035445334404abefbbe673628226","first_computed_at":"2026-05-18T01:16:19.946068Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:19.946068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1tBhto2/uI5tXTtqSXGoix7p0mfWdbj7UC+SNt9yj3qH1H7pbvxFhU40zvtTyMbElKzzgieaYhNsdRjvMTlYDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:19.946636Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.06626","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1303374dd365931d9a81e01ee57ab4677604bad081f96707b33f5fb328586482","sha256:7b7905e863c4443ddb312062cfa533c71eb070508144b28e4e3b428ba7573cb3"],"state_sha256":"a20e0e0c5540d394d9a7c6dde02b15a4224dd678d3e3fe72217e45e59874bc2a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WGsP6DNVAYh3wb/KBvhPVVzfBIhlYPF9JO+hs/jZh+YRetnp9aYAO2sR46kStbfaI6siOBAsdroloJkbCFlmCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T23:37:23.850713Z","bundle_sha256":"5377c5bf572993635ddc06427743b82c5bb699f353636838260ef4e6a1e6b947"}}