{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:YBM7ULGLAOMNTCY2P2NJDYBAF3","short_pith_number":"pith:YBM7ULGL","schema_version":"1.0","canonical_sha256":"c059fa2ccb0398d98b1a7e9a91e0202ec3927b1acd7617e4b9bd57d0a2249730","source":{"kind":"arxiv","id":"2011.02598","version":1},"attestation_state":"computed","paper":{"title":"Binary classification with ambiguous training data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Masashi Sugiyama, Naoya Otani, Tetsuya Koike, Yosuke Otsubo","submitted_at":"2020-11-05T00:53:58Z","abstract_excerpt":"In supervised learning, we often face with ambiguous (A) samples that are difficult to label even by domain experts. In this paper, we consider a binary classification problem in the presence of such A samples. This problem is substantially different from semi-supervised learning since unlabeled samples are not necessarily difficult samples. Also, it is different from 3-class classification with the positive (P), negative (N), and A classes since we do not want to classify test samples into the A class. Our proposed method extends binary classification with reject option, which trains a classi"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2011.02598","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-11-05T00:53:58Z","cross_cats_sorted":[],"title_canon_sha256":"1a82762829c409d78fb97550c4208b038a4d9401750ca14ab619d2f46dfbcfb7","abstract_canon_sha256":"e0898c88118930d4fd07e869dc28c61c29c49c90fb054aa2f0f8a890581bf476"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:54:00.964151Z","signature_b64":"wr9/91aG8OZ/ALXf4B4ANHk2hlClh0Bs9Ts1veC3KpKkAs4ZZfyb+ndquT/DV/gp3F2ist2bHmaNm/bm3S+pCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c059fa2ccb0398d98b1a7e9a91e0202ec3927b1acd7617e4b9bd57d0a2249730","last_reissued_at":"2026-07-05T01:54:00.963709Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:54:00.963709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Binary classification with ambiguous training data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Masashi Sugiyama, Naoya Otani, Tetsuya Koike, Yosuke Otsubo","submitted_at":"2020-11-05T00:53:58Z","abstract_excerpt":"In supervised learning, we often face with ambiguous (A) samples that are difficult to label even by domain experts. In this paper, we consider a binary classification problem in the presence of such A samples. This problem is substantially different from semi-supervised learning since unlabeled samples are not necessarily difficult samples. Also, it is different from 3-class classification with the positive (P), negative (N), and A classes since we do not want to classify test samples into the A class. Our proposed method extends binary classification with reject option, which trains a classi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.02598","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.02598/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2011.02598","created_at":"2026-07-05T01:54:00.963769+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.02598v1","created_at":"2026-07-05T01:54:00.963769+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.02598","created_at":"2026-07-05T01:54:00.963769+00:00"},{"alias_kind":"pith_short_12","alias_value":"YBM7ULGLAOMN","created_at":"2026-07-05T01:54:00.963769+00:00"},{"alias_kind":"pith_short_16","alias_value":"YBM7ULGLAOMNTCY2","created_at":"2026-07-05T01:54:00.963769+00:00"},{"alias_kind":"pith_short_8","alias_value":"YBM7ULGL","created_at":"2026-07-05T01:54:00.963769+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YBM7ULGLAOMNTCY2P2NJDYBAF3","json":"https://pith.science/pith/YBM7ULGLAOMNTCY2P2NJDYBAF3.json","graph_json":"https://pith.science/api/pith-number/YBM7ULGLAOMNTCY2P2NJDYBAF3/graph.json","events_json":"https://pith.science/api/pith-number/YBM7ULGLAOMNTCY2P2NJDYBAF3/events.json","paper":"https://pith.science/paper/YBM7ULGL"},"agent_actions":{"view_html":"https://pith.science/pith/YBM7ULGLAOMNTCY2P2NJDYBAF3","download_json":"https://pith.science/pith/YBM7ULGLAOMNTCY2P2NJDYBAF3.json","view_paper":"https://pith.science/paper/YBM7ULGL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.02598&json=true","fetch_graph":"https://pith.science/api/pith-number/YBM7ULGLAOMNTCY2P2NJDYBAF3/graph.json","fetch_events":"https://pith.science/api/pith-number/YBM7ULGLAOMNTCY2P2NJDYBAF3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YBM7ULGLAOMNTCY2P2NJDYBAF3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YBM7ULGLAOMNTCY2P2NJDYBAF3/action/storage_attestation","attest_author":"https://pith.science/pith/YBM7ULGLAOMNTCY2P2NJDYBAF3/action/author_attestation","sign_citation":"https://pith.science/pith/YBM7ULGLAOMNTCY2P2NJDYBAF3/action/citation_signature","submit_replication":"https://pith.science/pith/YBM7ULGLAOMNTCY2P2NJDYBAF3/action/replication_record"}},"created_at":"2026-07-05T01:54:00.963769+00:00","updated_at":"2026-07-05T01:54:00.963769+00:00"}