{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:DRYGTAQNAYXMTXLDOUU5XFUUBO","short_pith_number":"pith:DRYGTAQN","schema_version":"1.0","canonical_sha256":"1c7069820d062ec9dd637529db96940b8fe5136360c40f3bfb556df2ca27b9d7","source":{"kind":"arxiv","id":"2302.09891","version":2},"attestation_state":"computed","paper":{"title":"Unreliable Partial Label Learning with Recursive Separation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Hua Yuan, Ning Xu, Xin Geng, Yu Shi","submitted_at":"2023-02-20T10:39:31Z","abstract_excerpt":"Partial label learning (PLL) is a typical weakly supervised learning problem in which each instance is associated with a candidate label set, and among which only one is true. However, the assumption that the ground-truth label is always among the candidate label set would be unrealistic, as the reliability of the candidate label sets in real-world applications cannot be guaranteed by annotators. Therefore, a generalized PLL named Unreliable Partial Label Learning (UPLL) is proposed, in which the true label may not be in the candidate label set. Due to the challenges posed by unreliable labeli"},"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":"2302.09891","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-02-20T10:39:31Z","cross_cats_sorted":[],"title_canon_sha256":"8b5bf250395ee322ecf4f7fafa9cf1d5c44ef3d54fab37e997107036c07d0fbf","abstract_canon_sha256":"11fb5d2f025d920879d189f30674d734f054637ea070096efd9801bf7f513065"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:45:49.036214Z","signature_b64":"Fx0Jlr2vLzpO/KcQafUraUkRHRKDNfbGPanlenBh6o6MWxhuqCp1A7fe2ZeINa42SVbMd/4NcUscSu20n3x5CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c7069820d062ec9dd637529db96940b8fe5136360c40f3bfb556df2ca27b9d7","last_reissued_at":"2026-07-05T06:45:49.035754Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:45:49.035754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unreliable Partial Label Learning with Recursive Separation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Hua Yuan, Ning Xu, Xin Geng, Yu Shi","submitted_at":"2023-02-20T10:39:31Z","abstract_excerpt":"Partial label learning (PLL) is a typical weakly supervised learning problem in which each instance is associated with a candidate label set, and among which only one is true. However, the assumption that the ground-truth label is always among the candidate label set would be unrealistic, as the reliability of the candidate label sets in real-world applications cannot be guaranteed by annotators. Therefore, a generalized PLL named Unreliable Partial Label Learning (UPLL) is proposed, in which the true label may not be in the candidate label set. Due to the challenges posed by unreliable labeli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.09891","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2302.09891/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":"2302.09891","created_at":"2026-07-05T06:45:49.035814+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.09891v2","created_at":"2026-07-05T06:45:49.035814+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.09891","created_at":"2026-07-05T06:45:49.035814+00:00"},{"alias_kind":"pith_short_12","alias_value":"DRYGTAQNAYXM","created_at":"2026-07-05T06:45:49.035814+00:00"},{"alias_kind":"pith_short_16","alias_value":"DRYGTAQNAYXMTXLD","created_at":"2026-07-05T06:45:49.035814+00:00"},{"alias_kind":"pith_short_8","alias_value":"DRYGTAQN","created_at":"2026-07-05T06:45:49.035814+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/DRYGTAQNAYXMTXLDOUU5XFUUBO","json":"https://pith.science/pith/DRYGTAQNAYXMTXLDOUU5XFUUBO.json","graph_json":"https://pith.science/api/pith-number/DRYGTAQNAYXMTXLDOUU5XFUUBO/graph.json","events_json":"https://pith.science/api/pith-number/DRYGTAQNAYXMTXLDOUU5XFUUBO/events.json","paper":"https://pith.science/paper/DRYGTAQN"},"agent_actions":{"view_html":"https://pith.science/pith/DRYGTAQNAYXMTXLDOUU5XFUUBO","download_json":"https://pith.science/pith/DRYGTAQNAYXMTXLDOUU5XFUUBO.json","view_paper":"https://pith.science/paper/DRYGTAQN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.09891&json=true","fetch_graph":"https://pith.science/api/pith-number/DRYGTAQNAYXMTXLDOUU5XFUUBO/graph.json","fetch_events":"https://pith.science/api/pith-number/DRYGTAQNAYXMTXLDOUU5XFUUBO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DRYGTAQNAYXMTXLDOUU5XFUUBO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DRYGTAQNAYXMTXLDOUU5XFUUBO/action/storage_attestation","attest_author":"https://pith.science/pith/DRYGTAQNAYXMTXLDOUU5XFUUBO/action/author_attestation","sign_citation":"https://pith.science/pith/DRYGTAQNAYXMTXLDOUU5XFUUBO/action/citation_signature","submit_replication":"https://pith.science/pith/DRYGTAQNAYXMTXLDOUU5XFUUBO/action/replication_record"}},"created_at":"2026-07-05T06:45:49.035814+00:00","updated_at":"2026-07-05T06:45:49.035814+00:00"}