{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:44FRPADOHEXLLY3JRRKMS35CQQ","short_pith_number":"pith:44FRPADO","schema_version":"1.0","canonical_sha256":"e70b17806e392eb5e3698c54c96fa2842f34c992cbb38474b8854cda5d7c285e","source":{"kind":"arxiv","id":"2406.06119","version":1},"attestation_state":"computed","paper":{"title":"A Survey on Incomplete Multi-label Learning: Recent Advances and Future Trends","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jiexi Liu, Songcan Chen, Xiang Li, Xinrui Wang","submitted_at":"2024-06-10T09:11:30Z","abstract_excerpt":"In reality, data often exhibit associations with multiple labels, making multi-label learning (MLL) become a prominent research topic. The last two decades have witnessed the success of MLL, which is indispensable from complete and accurate supervised information. However, obtaining such information in practice is always laborious and sometimes even impossible. To circumvent this dilemma, incomplete multi-label learning (InMLL) has emerged, aiming to learn from incomplete labeled data. To date, enormous InMLL works have been proposed to narrow the performance gap with complete MLL, whereas a s"},"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":"2406.06119","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-06-10T09:11:30Z","cross_cats_sorted":[],"title_canon_sha256":"893501169febdab255383d6c7b016a061a386b15c7e3d269c67f5f411e90a741","abstract_canon_sha256":"91e63b06ca0c3bfe77b703d5012253709dc3a44da3cbbc3f28ef41b11dc6fd46"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:29:38.033135Z","signature_b64":"Z6Iw3Ih3cdnnLvl+ensl440+hLGLHn7c/1IYN6ZxQ8svZdLgfts5E9U0616chthnGjeL4LF6KF1mibHE7L5ZCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e70b17806e392eb5e3698c54c96fa2842f34c992cbb38474b8854cda5d7c285e","last_reissued_at":"2026-07-05T08:29:38.032774Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:29:38.032774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Survey on Incomplete Multi-label Learning: Recent Advances and Future Trends","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jiexi Liu, Songcan Chen, Xiang Li, Xinrui Wang","submitted_at":"2024-06-10T09:11:30Z","abstract_excerpt":"In reality, data often exhibit associations with multiple labels, making multi-label learning (MLL) become a prominent research topic. The last two decades have witnessed the success of MLL, which is indispensable from complete and accurate supervised information. However, obtaining such information in practice is always laborious and sometimes even impossible. To circumvent this dilemma, incomplete multi-label learning (InMLL) has emerged, aiming to learn from incomplete labeled data. To date, enormous InMLL works have been proposed to narrow the performance gap with complete MLL, whereas a s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.06119","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/2406.06119/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":"2406.06119","created_at":"2026-07-05T08:29:38.032829+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.06119v1","created_at":"2026-07-05T08:29:38.032829+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.06119","created_at":"2026-07-05T08:29:38.032829+00:00"},{"alias_kind":"pith_short_12","alias_value":"44FRPADOHEXL","created_at":"2026-07-05T08:29:38.032829+00:00"},{"alias_kind":"pith_short_16","alias_value":"44FRPADOHEXLLY3J","created_at":"2026-07-05T08:29:38.032829+00:00"},{"alias_kind":"pith_short_8","alias_value":"44FRPADO","created_at":"2026-07-05T08:29:38.032829+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.19680","citing_title":"Cut out and Replay: A Simple yet Versatile Strategy for Multi-Label Online Continual Learning","ref_index":36,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/44FRPADOHEXLLY3JRRKMS35CQQ","json":"https://pith.science/pith/44FRPADOHEXLLY3JRRKMS35CQQ.json","graph_json":"https://pith.science/api/pith-number/44FRPADOHEXLLY3JRRKMS35CQQ/graph.json","events_json":"https://pith.science/api/pith-number/44FRPADOHEXLLY3JRRKMS35CQQ/events.json","paper":"https://pith.science/paper/44FRPADO"},"agent_actions":{"view_html":"https://pith.science/pith/44FRPADOHEXLLY3JRRKMS35CQQ","download_json":"https://pith.science/pith/44FRPADOHEXLLY3JRRKMS35CQQ.json","view_paper":"https://pith.science/paper/44FRPADO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.06119&json=true","fetch_graph":"https://pith.science/api/pith-number/44FRPADOHEXLLY3JRRKMS35CQQ/graph.json","fetch_events":"https://pith.science/api/pith-number/44FRPADOHEXLLY3JRRKMS35CQQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/44FRPADOHEXLLY3JRRKMS35CQQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/44FRPADOHEXLLY3JRRKMS35CQQ/action/storage_attestation","attest_author":"https://pith.science/pith/44FRPADOHEXLLY3JRRKMS35CQQ/action/author_attestation","sign_citation":"https://pith.science/pith/44FRPADOHEXLLY3JRRKMS35CQQ/action/citation_signature","submit_replication":"https://pith.science/pith/44FRPADOHEXLLY3JRRKMS35CQQ/action/replication_record"}},"created_at":"2026-07-05T08:29:38.032829+00:00","updated_at":"2026-07-05T08:29:38.032829+00:00"}