{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:XAWQF5WXSYHZGFTK3ELNZ42OEM","short_pith_number":"pith:XAWQF5WX","schema_version":"1.0","canonical_sha256":"b82d02f6d7960f93166ad916dcf34e230dec3b31f954f2be613a1d19c860945e","source":{"kind":"arxiv","id":"1901.03073","version":1},"attestation_state":"computed","paper":{"title":"GM-PLL: Graph Matching based Partial Label Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Congyan Lang, Gengyu Lyu, Songhe Feng, Tao Wang, Yidong Li","submitted_at":"2019-01-10T09:38:56Z","abstract_excerpt":"Partial Label Learning (PLL) aims to learn from the data where each training example is associated with a set of candidate labels, among which only one is correct. The key to deal with such problem is to disambiguate the candidate label sets and obtain the correct assignments between instances and their candidate labels. In this paper, we interpret such assignments as instance-to-label matchings, and reformulate the task of PLL as a matching selection problem. To model such problem, we propose a novel Graph Matching based Partial Label Learning (GM-PLL) framework, where Graph Matching (GM) sch"},"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":"1901.03073","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-10T09:38:56Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6c0e2c02544c188f4554da214cc15dab4a93dc766d07a2b30bc1e6d87ecad586","abstract_canon_sha256":"d2741bc29b58e5c19d0c5606a44a75f403e6491093e2b0a75f827bca0ddb0cd3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:35.622806Z","signature_b64":"WqSNB29Y6X2auyMxBQ5RHV6L2WKXas2D5bJZOTXvYOkK2+2eMhKfvAItpqqR12nXwWzDT9XtOBeCfM0tHxooBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b82d02f6d7960f93166ad916dcf34e230dec3b31f954f2be613a1d19c860945e","last_reissued_at":"2026-05-17T23:56:35.622246Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:35.622246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GM-PLL: Graph Matching based Partial Label Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Congyan Lang, Gengyu Lyu, Songhe Feng, Tao Wang, Yidong Li","submitted_at":"2019-01-10T09:38:56Z","abstract_excerpt":"Partial Label Learning (PLL) aims to learn from the data where each training example is associated with a set of candidate labels, among which only one is correct. The key to deal with such problem is to disambiguate the candidate label sets and obtain the correct assignments between instances and their candidate labels. In this paper, we interpret such assignments as instance-to-label matchings, and reformulate the task of PLL as a matching selection problem. To model such problem, we propose a novel Graph Matching based Partial Label Learning (GM-PLL) framework, where Graph Matching (GM) sch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03073","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":""},"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":"1901.03073","created_at":"2026-05-17T23:56:35.622325+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.03073v1","created_at":"2026-05-17T23:56:35.622325+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03073","created_at":"2026-05-17T23:56:35.622325+00:00"},{"alias_kind":"pith_short_12","alias_value":"XAWQF5WXSYHZ","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"XAWQF5WXSYHZGFTK","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"XAWQF5WX","created_at":"2026-05-18T12:33:33.725879+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/XAWQF5WXSYHZGFTK3ELNZ42OEM","json":"https://pith.science/pith/XAWQF5WXSYHZGFTK3ELNZ42OEM.json","graph_json":"https://pith.science/api/pith-number/XAWQF5WXSYHZGFTK3ELNZ42OEM/graph.json","events_json":"https://pith.science/api/pith-number/XAWQF5WXSYHZGFTK3ELNZ42OEM/events.json","paper":"https://pith.science/paper/XAWQF5WX"},"agent_actions":{"view_html":"https://pith.science/pith/XAWQF5WXSYHZGFTK3ELNZ42OEM","download_json":"https://pith.science/pith/XAWQF5WXSYHZGFTK3ELNZ42OEM.json","view_paper":"https://pith.science/paper/XAWQF5WX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.03073&json=true","fetch_graph":"https://pith.science/api/pith-number/XAWQF5WXSYHZGFTK3ELNZ42OEM/graph.json","fetch_events":"https://pith.science/api/pith-number/XAWQF5WXSYHZGFTK3ELNZ42OEM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XAWQF5WXSYHZGFTK3ELNZ42OEM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XAWQF5WXSYHZGFTK3ELNZ42OEM/action/storage_attestation","attest_author":"https://pith.science/pith/XAWQF5WXSYHZGFTK3ELNZ42OEM/action/author_attestation","sign_citation":"https://pith.science/pith/XAWQF5WXSYHZGFTK3ELNZ42OEM/action/citation_signature","submit_replication":"https://pith.science/pith/XAWQF5WXSYHZGFTK3ELNZ42OEM/action/replication_record"}},"created_at":"2026-05-17T23:56:35.622325+00:00","updated_at":"2026-05-17T23:56:35.622325+00:00"}