{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:6SFS6OVCWA7HAWQ3QDAQHWJHNR","short_pith_number":"pith:6SFS6OVC","canonical_record":{"source":{"id":"1402.3144","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-02-13T14:18:17Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"505dae0f9d7210cb0dc162a848c199833aa68a2cff27c983b5fb26397221e80d","abstract_canon_sha256":"762d32af1fca803ba26b44fb05abad335dfc9ba87476c6b716053575e28fc95b"},"schema_version":"1.0"},"canonical_sha256":"f48b2f3aa2b03e705a1b80c103d9276c4ad6bee6685a3d550b95e60320fabf6e","source":{"kind":"arxiv","id":"1402.3144","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.3144","created_at":"2026-05-18T02:27:18Z"},{"alias_kind":"arxiv_version","alias_value":"1402.3144v2","created_at":"2026-05-18T02:27:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3144","created_at":"2026-05-18T02:27:18Z"},{"alias_kind":"pith_short_12","alias_value":"6SFS6OVCWA7H","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6SFS6OVCWA7HAWQ3","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6SFS6OVC","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:6SFS6OVCWA7HAWQ3QDAQHWJHNR","target":"record","payload":{"canonical_record":{"source":{"id":"1402.3144","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-02-13T14:18:17Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"505dae0f9d7210cb0dc162a848c199833aa68a2cff27c983b5fb26397221e80d","abstract_canon_sha256":"762d32af1fca803ba26b44fb05abad335dfc9ba87476c6b716053575e28fc95b"},"schema_version":"1.0"},"canonical_sha256":"f48b2f3aa2b03e705a1b80c103d9276c4ad6bee6685a3d550b95e60320fabf6e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:18.878988Z","signature_b64":"d7eykiEgZH+1fhA4402yBvRx5Dq2pA9M7a4O+xItF1uTvlKlz+hZVtdKh3vAKocWAZ1pfHaAoDveAeI4JIXQAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f48b2f3aa2b03e705a1b80c103d9276c4ad6bee6685a3d550b95e60320fabf6e","last_reissued_at":"2026-05-18T02:27:18.878304Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:18.878304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.3144","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-18T02:27:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SmcBjFb/Ovxc2iaAwnrr/pghmGyCyg8NgNYiCITqXCHOdTMyAHZwLrkljvytRBcyAWLwlDTFiNt4bP2OHn75Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T11:07:08.177969Z"},"content_sha256":"15e520d9701b0f5a2a80940100eb3d1e5e73a6747f425b77b9108cdbbd75d926","schema_version":"1.0","event_id":"sha256:15e520d9701b0f5a2a80940100eb3d1e5e73a6747f425b77b9108cdbbd75d926"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:6SFS6OVCWA7HAWQ3QDAQHWJHNR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Robust Ensemble Approach to Learn From Positive and Unlabeled Data Using SVM Base Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Bart De Moor, Frank De Smet, Johan A. K. Suykens, Marc Claesen","submitted_at":"2014-02-13T14:18:17Z","abstract_excerpt":"We present a novel approach to learn binary classifiers when only positive and unlabeled instances are available (PU learning). This problem is routinely cast as a supervised task with label noise in the negative set. We use an ensemble of SVM models trained on bootstrap resamples of the training data for increased robustness against label noise. The approach can be considered in a bagging framework which provides an intuitive explanation for its mechanics in a semi-supervised setting. We compared our method to state-of-the-art approaches in simulations using multiple public benchmark data set"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3144","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-18T02:27:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fDddCB2PqAsb+QdLUGdCj+16qr/49RZd9/xUKgOgiOFIvUN+H0TYg8xg/n9d9y7bn9wHXRTeeF3dnQE+yFS9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T11:07:08.178311Z"},"content_sha256":"553e161c8aec0e81189345f5ac57b99e3280c52fe682104b0c790c6702fbb236","schema_version":"1.0","event_id":"sha256:553e161c8aec0e81189345f5ac57b99e3280c52fe682104b0c790c6702fbb236"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6SFS6OVCWA7HAWQ3QDAQHWJHNR/bundle.json","state_url":"https://pith.science/pith/6SFS6OVCWA7HAWQ3QDAQHWJHNR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6SFS6OVCWA7HAWQ3QDAQHWJHNR/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-19T11:07:08Z","links":{"resolver":"https://pith.science/pith/6SFS6OVCWA7HAWQ3QDAQHWJHNR","bundle":"https://pith.science/pith/6SFS6OVCWA7HAWQ3QDAQHWJHNR/bundle.json","state":"https://pith.science/pith/6SFS6OVCWA7HAWQ3QDAQHWJHNR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6SFS6OVCWA7HAWQ3QDAQHWJHNR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:6SFS6OVCWA7HAWQ3QDAQHWJHNR","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":"762d32af1fca803ba26b44fb05abad335dfc9ba87476c6b716053575e28fc95b","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-02-13T14:18:17Z","title_canon_sha256":"505dae0f9d7210cb0dc162a848c199833aa68a2cff27c983b5fb26397221e80d"},"schema_version":"1.0","source":{"id":"1402.3144","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.3144","created_at":"2026-05-18T02:27:18Z"},{"alias_kind":"arxiv_version","alias_value":"1402.3144v2","created_at":"2026-05-18T02:27:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3144","created_at":"2026-05-18T02:27:18Z"},{"alias_kind":"pith_short_12","alias_value":"6SFS6OVCWA7H","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6SFS6OVCWA7HAWQ3","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6SFS6OVC","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:553e161c8aec0e81189345f5ac57b99e3280c52fe682104b0c790c6702fbb236","target":"graph","created_at":"2026-05-18T02:27:18Z","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":"We present a novel approach to learn binary classifiers when only positive and unlabeled instances are available (PU learning). This problem is routinely cast as a supervised task with label noise in the negative set. We use an ensemble of SVM models trained on bootstrap resamples of the training data for increased robustness against label noise. The approach can be considered in a bagging framework which provides an intuitive explanation for its mechanics in a semi-supervised setting. We compared our method to state-of-the-art approaches in simulations using multiple public benchmark data set","authors_text":"Bart De Moor, Frank De Smet, Johan A. K. Suykens, Marc Claesen","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-02-13T14:18:17Z","title":"A Robust Ensemble Approach to Learn From Positive and Unlabeled Data Using SVM Base Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3144","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:15e520d9701b0f5a2a80940100eb3d1e5e73a6747f425b77b9108cdbbd75d926","target":"record","created_at":"2026-05-18T02:27:18Z","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":"762d32af1fca803ba26b44fb05abad335dfc9ba87476c6b716053575e28fc95b","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-02-13T14:18:17Z","title_canon_sha256":"505dae0f9d7210cb0dc162a848c199833aa68a2cff27c983b5fb26397221e80d"},"schema_version":"1.0","source":{"id":"1402.3144","kind":"arxiv","version":2}},"canonical_sha256":"f48b2f3aa2b03e705a1b80c103d9276c4ad6bee6685a3d550b95e60320fabf6e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f48b2f3aa2b03e705a1b80c103d9276c4ad6bee6685a3d550b95e60320fabf6e","first_computed_at":"2026-05-18T02:27:18.878304Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:18.878304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d7eykiEgZH+1fhA4402yBvRx5Dq2pA9M7a4O+xItF1uTvlKlz+hZVtdKh3vAKocWAZ1pfHaAoDveAeI4JIXQAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:18.878988Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.3144","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15e520d9701b0f5a2a80940100eb3d1e5e73a6747f425b77b9108cdbbd75d926","sha256:553e161c8aec0e81189345f5ac57b99e3280c52fe682104b0c790c6702fbb236"],"state_sha256":"ba2d64dd0722c8c1bc3b7507327de44385f7bbac541ed6e2cc9b6555804c7aad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b+YgPLlwZMFc1TWLDh4jA8C25csDlsadr57pl9SQ4Ip7BO6iuEN1DX6qmKVnzP1+qKS2wKS4SAqEQrbPVFqtDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T11:07:08.179981Z","bundle_sha256":"6e789154e8b531128f28b5ca547b6f7969f10bd26c9206d1e8985211809a96ff"}}