{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DN5JH4J45TS33477EPI7C4ZSZE","short_pith_number":"pith:DN5JH4J4","canonical_record":{"source":{"id":"1805.11712","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-29T21:22:53Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"183325e6c00607c6870fba31363d52116f891507814c9a82c95b65a9d2026fb8","abstract_canon_sha256":"99f2800ce50d65c5ff85b5d4707db29fa84c2e60f42bcaf671cf455b6cc81677"},"schema_version":"1.0"},"canonical_sha256":"1b7a93f13cece5bdf3ff23d1f17332c936dd17b59959b7c2259cc33b2865cd89","source":{"kind":"arxiv","id":"1805.11712","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.11712","created_at":"2026-05-18T00:14:36Z"},{"alias_kind":"arxiv_version","alias_value":"1805.11712v1","created_at":"2026-05-18T00:14:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11712","created_at":"2026-05-18T00:14:36Z"},{"alias_kind":"pith_short_12","alias_value":"DN5JH4J45TS3","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DN5JH4J45TS33477","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DN5JH4J4","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DN5JH4J45TS33477EPI7C4ZSZE","target":"record","payload":{"canonical_record":{"source":{"id":"1805.11712","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-29T21:22:53Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"183325e6c00607c6870fba31363d52116f891507814c9a82c95b65a9d2026fb8","abstract_canon_sha256":"99f2800ce50d65c5ff85b5d4707db29fa84c2e60f42bcaf671cf455b6cc81677"},"schema_version":"1.0"},"canonical_sha256":"1b7a93f13cece5bdf3ff23d1f17332c936dd17b59959b7c2259cc33b2865cd89","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:36.822944Z","signature_b64":"qW0TQQfHbWCBHvhhUNx4m2viJEkY/hdbpeSu2uBE4TG6yNc6BRf/dJnW24M6ZZJsH1YkVv+QlB1P+PJYKyFiBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b7a93f13cece5bdf3ff23d1f17332c936dd17b59959b7c2259cc33b2865cd89","last_reissued_at":"2026-05-18T00:14:36.822282Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:36.822282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.11712","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-18T00:14:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hQrQmcUmIDVfXgIbKfOZWAuxMZhDfM16xuDcM/lsmpVXL5cFi+iauUCLtk25uagAK5/bPd+coh7MYon7C+znBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:09:06.509857Z"},"content_sha256":"2872bca7d8f534ca61e3ec6def636f66d49aadbfecab40db675da928aced3c6a","schema_version":"1.0","event_id":"sha256:2872bca7d8f534ca61e3ec6def636f66d49aadbfecab40db675da928aced3c6a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DN5JH4J45TS33477EPI7C4ZSZE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Novel Multi-clustering Method for Hierarchical Clusterings, Based on Boosting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Abdolreza Mirzaei, Elaheh Rashedi","submitted_at":"2018-05-29T21:22:53Z","abstract_excerpt":"Bagging and boosting are proved to be the best methods of building multiple classifiers in classification combination problems. In the area of \"flat clustering\" problems, it is also recognized that multi-clustering methods based on boosting provide clusterings of an improved quality. In this paper, we introduce a novel multi-clustering method for \"hierarchical clusterings\" based on boosting theory, which creates a more stable hierarchical clustering of a dataset. The proposed algorithm includes a boosting iteration in which a bootstrap of samples is created by weighted random sampling of eleme"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11712","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-18T00:14:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wvkX6qyJCLEBvY5oIdN3Doy9AQ/PmXQZpW/9AHMRAWrkbpfMCTMh2398qZSM3Npb74XFFL2r83L3bqDXuc41Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:09:06.510539Z"},"content_sha256":"f1d7630d11cd014b206987678f77113cc8906ece5504e2bbb1e01ba179c822fd","schema_version":"1.0","event_id":"sha256:f1d7630d11cd014b206987678f77113cc8906ece5504e2bbb1e01ba179c822fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DN5JH4J45TS33477EPI7C4ZSZE/bundle.json","state_url":"https://pith.science/pith/DN5JH4J45TS33477EPI7C4ZSZE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DN5JH4J45TS33477EPI7C4ZSZE/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-05-31T20:09:06Z","links":{"resolver":"https://pith.science/pith/DN5JH4J45TS33477EPI7C4ZSZE","bundle":"https://pith.science/pith/DN5JH4J45TS33477EPI7C4ZSZE/bundle.json","state":"https://pith.science/pith/DN5JH4J45TS33477EPI7C4ZSZE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DN5JH4J45TS33477EPI7C4ZSZE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DN5JH4J45TS33477EPI7C4ZSZE","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":"99f2800ce50d65c5ff85b5d4707db29fa84c2e60f42bcaf671cf455b6cc81677","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-29T21:22:53Z","title_canon_sha256":"183325e6c00607c6870fba31363d52116f891507814c9a82c95b65a9d2026fb8"},"schema_version":"1.0","source":{"id":"1805.11712","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.11712","created_at":"2026-05-18T00:14:36Z"},{"alias_kind":"arxiv_version","alias_value":"1805.11712v1","created_at":"2026-05-18T00:14:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11712","created_at":"2026-05-18T00:14:36Z"},{"alias_kind":"pith_short_12","alias_value":"DN5JH4J45TS3","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DN5JH4J45TS33477","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DN5JH4J4","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:f1d7630d11cd014b206987678f77113cc8906ece5504e2bbb1e01ba179c822fd","target":"graph","created_at":"2026-05-18T00:14:36Z","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":"Bagging and boosting are proved to be the best methods of building multiple classifiers in classification combination problems. In the area of \"flat clustering\" problems, it is also recognized that multi-clustering methods based on boosting provide clusterings of an improved quality. In this paper, we introduce a novel multi-clustering method for \"hierarchical clusterings\" based on boosting theory, which creates a more stable hierarchical clustering of a dataset. The proposed algorithm includes a boosting iteration in which a bootstrap of samples is created by weighted random sampling of eleme","authors_text":"Abdolreza Mirzaei, Elaheh Rashedi","cross_cats":["cs.CV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-29T21:22:53Z","title":"A Novel Multi-clustering Method for Hierarchical Clusterings, Based on Boosting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11712","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:2872bca7d8f534ca61e3ec6def636f66d49aadbfecab40db675da928aced3c6a","target":"record","created_at":"2026-05-18T00:14:36Z","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":"99f2800ce50d65c5ff85b5d4707db29fa84c2e60f42bcaf671cf455b6cc81677","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-29T21:22:53Z","title_canon_sha256":"183325e6c00607c6870fba31363d52116f891507814c9a82c95b65a9d2026fb8"},"schema_version":"1.0","source":{"id":"1805.11712","kind":"arxiv","version":1}},"canonical_sha256":"1b7a93f13cece5bdf3ff23d1f17332c936dd17b59959b7c2259cc33b2865cd89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b7a93f13cece5bdf3ff23d1f17332c936dd17b59959b7c2259cc33b2865cd89","first_computed_at":"2026-05-18T00:14:36.822282Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:36.822282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qW0TQQfHbWCBHvhhUNx4m2viJEkY/hdbpeSu2uBE4TG6yNc6BRf/dJnW24M6ZZJsH1YkVv+QlB1P+PJYKyFiBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:36.822944Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.11712","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2872bca7d8f534ca61e3ec6def636f66d49aadbfecab40db675da928aced3c6a","sha256:f1d7630d11cd014b206987678f77113cc8906ece5504e2bbb1e01ba179c822fd"],"state_sha256":"b51a58b3e54a697134b49fde9be3feef0ba703b2ae0f618620f0c4fd74b8f3b1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z+O1LGdrYJyOUC1pEfWJPoCewUyizZ8qHnScJjivOnl4E8BgXKjNmBN9TWjkP6+2OLeGEYi+6zqTwWYNgjmoBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:09:06.514282Z","bundle_sha256":"6e44a2780fff5841fa1405a53c097f36fc46c71a576987ab197e46223995ebdb"}}