{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FFZKDWYNHIAKJBZ3RFEULQUL35","short_pith_number":"pith:FFZKDWYN","canonical_record":{"source":{"id":"1804.07419","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-20T01:29:47Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"10443c735b30dfd83ab7ee9f5a5ab37d484adaefab79023b2d99522f6638abce","abstract_canon_sha256":"d408b2e8eaa8332ca5b032afd0e42743d8e925348b577a0b5782edabc967ffbc"},"schema_version":"1.0"},"canonical_sha256":"2972a1db0d3a00a4873b894945c28bdf40db33c104803bd578fe473a375e8ced","source":{"kind":"arxiv","id":"1804.07419","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.07419","created_at":"2026-05-18T00:01:53Z"},{"alias_kind":"arxiv_version","alias_value":"1804.07419v2","created_at":"2026-05-18T00:01:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07419","created_at":"2026-05-18T00:01:53Z"},{"alias_kind":"pith_short_12","alias_value":"FFZKDWYNHIAK","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FFZKDWYNHIAKJBZ3","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FFZKDWYN","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FFZKDWYNHIAKJBZ3RFEULQUL35","target":"record","payload":{"canonical_record":{"source":{"id":"1804.07419","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-20T01:29:47Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"10443c735b30dfd83ab7ee9f5a5ab37d484adaefab79023b2d99522f6638abce","abstract_canon_sha256":"d408b2e8eaa8332ca5b032afd0e42743d8e925348b577a0b5782edabc967ffbc"},"schema_version":"1.0"},"canonical_sha256":"2972a1db0d3a00a4873b894945c28bdf40db33c104803bd578fe473a375e8ced","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:53.334471Z","signature_b64":"HU9nGSuqs8FeHrNsMASU99r/pyvdmX6aO4W7WKU1H3zh4BPhmNJ0rG4Lz+aD6pa0oM/qkWT4Ec1MEOz52RWDBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2972a1db0d3a00a4873b894945c28bdf40db33c104803bd578fe473a375e8ced","last_reissued_at":"2026-05-18T00:01:53.334058Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:53.334058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.07419","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-18T00:01:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"plecZYw3kfiS/2xSb7CzkC4gdZ/3sB5D5UsJPAh5a0U2s6izmX71iLJ36NS4j1aHRD7CP3fFvMFeC+xkBgOGCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:05:31.827581Z"},"content_sha256":"05651e19fb6ac35f75c82b098c836d1be071f4f7d0ad5e953915c62f5d24039a","schema_version":"1.0","event_id":"sha256:05651e19fb6ac35f75c82b098c836d1be071f4f7d0ad5e953915c62f5d24039a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FFZKDWYNHIAKJBZ3RFEULQUL35","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Ensemble Generation Method Based on Instance Hardness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Dayvid V. R. Oliveira, Felipe N. Walmsley, George D. C. Cavalcanti, Rafael M. O. Cruz, Robert Sabourin","submitted_at":"2018-04-20T01:29:47Z","abstract_excerpt":"In Machine Learning, ensemble methods have been receiving a great deal of attention. Techniques such as Bagging and Boosting have been successfully applied to a variety of problems. Nevertheless, such techniques are still susceptible to the effects of noise and outliers in the training data. We propose a new method for the generation of pools of classifiers based on Bagging, in which the probability of an instance being selected during the resampling process is inversely proportional to its instance hardness, which can be understood as the likelihood of an instance being misclassified, regardl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.07419","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-18T00:01:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uTesFXX4dTOW2nKszNWKeRY67FnSG+RfjBhv8bcQvJaM65ckz2yoILH8GWZngTs62KB9PUgO/1tc7dL+kb4GBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:05:31.828247Z"},"content_sha256":"4cc512320de85a9a9b12d5d7936003da6bf903fe627025ee0d6d7726bb96dcdf","schema_version":"1.0","event_id":"sha256:4cc512320de85a9a9b12d5d7936003da6bf903fe627025ee0d6d7726bb96dcdf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FFZKDWYNHIAKJBZ3RFEULQUL35/bundle.json","state_url":"https://pith.science/pith/FFZKDWYNHIAKJBZ3RFEULQUL35/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FFZKDWYNHIAKJBZ3RFEULQUL35/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-26T05:05:31Z","links":{"resolver":"https://pith.science/pith/FFZKDWYNHIAKJBZ3RFEULQUL35","bundle":"https://pith.science/pith/FFZKDWYNHIAKJBZ3RFEULQUL35/bundle.json","state":"https://pith.science/pith/FFZKDWYNHIAKJBZ3RFEULQUL35/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FFZKDWYNHIAKJBZ3RFEULQUL35/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FFZKDWYNHIAKJBZ3RFEULQUL35","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":"d408b2e8eaa8332ca5b032afd0e42743d8e925348b577a0b5782edabc967ffbc","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-20T01:29:47Z","title_canon_sha256":"10443c735b30dfd83ab7ee9f5a5ab37d484adaefab79023b2d99522f6638abce"},"schema_version":"1.0","source":{"id":"1804.07419","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.07419","created_at":"2026-05-18T00:01:53Z"},{"alias_kind":"arxiv_version","alias_value":"1804.07419v2","created_at":"2026-05-18T00:01:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07419","created_at":"2026-05-18T00:01:53Z"},{"alias_kind":"pith_short_12","alias_value":"FFZKDWYNHIAK","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FFZKDWYNHIAKJBZ3","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FFZKDWYN","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:4cc512320de85a9a9b12d5d7936003da6bf903fe627025ee0d6d7726bb96dcdf","target":"graph","created_at":"2026-05-18T00:01:53Z","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":"In Machine Learning, ensemble methods have been receiving a great deal of attention. Techniques such as Bagging and Boosting have been successfully applied to a variety of problems. Nevertheless, such techniques are still susceptible to the effects of noise and outliers in the training data. We propose a new method for the generation of pools of classifiers based on Bagging, in which the probability of an instance being selected during the resampling process is inversely proportional to its instance hardness, which can be understood as the likelihood of an instance being misclassified, regardl","authors_text":"Dayvid V. R. Oliveira, Felipe N. Walmsley, George D. C. Cavalcanti, Rafael M. O. Cruz, Robert Sabourin","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-20T01:29:47Z","title":"An Ensemble Generation Method Based on Instance Hardness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.07419","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:05651e19fb6ac35f75c82b098c836d1be071f4f7d0ad5e953915c62f5d24039a","target":"record","created_at":"2026-05-18T00:01:53Z","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":"d408b2e8eaa8332ca5b032afd0e42743d8e925348b577a0b5782edabc967ffbc","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-20T01:29:47Z","title_canon_sha256":"10443c735b30dfd83ab7ee9f5a5ab37d484adaefab79023b2d99522f6638abce"},"schema_version":"1.0","source":{"id":"1804.07419","kind":"arxiv","version":2}},"canonical_sha256":"2972a1db0d3a00a4873b894945c28bdf40db33c104803bd578fe473a375e8ced","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2972a1db0d3a00a4873b894945c28bdf40db33c104803bd578fe473a375e8ced","first_computed_at":"2026-05-18T00:01:53.334058Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:53.334058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HU9nGSuqs8FeHrNsMASU99r/pyvdmX6aO4W7WKU1H3zh4BPhmNJ0rG4Lz+aD6pa0oM/qkWT4Ec1MEOz52RWDBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:53.334471Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.07419","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05651e19fb6ac35f75c82b098c836d1be071f4f7d0ad5e953915c62f5d24039a","sha256:4cc512320de85a9a9b12d5d7936003da6bf903fe627025ee0d6d7726bb96dcdf"],"state_sha256":"da00840ed4c1566a99107ca699226bd7089ee904007ed261e2d98ea291873c3e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mxxh+4KAby8lGxoNaDkV9I0jrA98rGk6shWKSUm+q5FBhpkFppCteCIT9JBh4qdq5ych5HiSMip+gcTBjMpOBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T05:05:31.831892Z","bundle_sha256":"d6fd8cb9d7f769aa2c4d5f81bf599b41d1d47c0214c1b205d1bc0fa86a6b801c"}}