{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:SK6XPJFDLF7P4OHFBTQR7IZWCX","short_pith_number":"pith:SK6XPJFD","schema_version":"1.0","canonical_sha256":"92bd77a4a3597efe38e50ce11fa33615f0348c4870153d5ff9b58c31e4b6d247","source":{"kind":"arxiv","id":"2202.02529","version":1},"attestation_state":"computed","paper":{"title":"Graph Neural Network with Curriculum Learning for Imbalanced Node Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Fuli Feng, Lei Wang, Lijie Wen, Xiaohe Li, Xuming Hu, Yawen Deng, Zide Fan","submitted_at":"2022-02-05T10:46:11Z","abstract_excerpt":"Graph Neural Network (GNN) is an emerging technique for graph-based learning tasks such as node classification. In this work, we reveal the vulnerability of GNN to the imbalance of node labels. Traditional solutions for imbalanced classification (e.g. resampling) are ineffective in node classification without considering the graph structure. Worse still, they may even bring overfitting or underfitting results due to lack of sufficient prior knowledge. To solve these problems, we propose a novel graph neural network framework with curriculum learning (GNN-CL) consisting of two modules. For one "},"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":"2202.02529","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-02-05T10:46:11Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"64b044271f5bbd7b20fed726ca9814f24288cc96964b4c3d95020721a45f0464","abstract_canon_sha256":"ad0f61f6161f0b1a911c3a0dea453ce1e0b71636c7c1216304f5cd4de858921f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:54:29.917189Z","signature_b64":"OLF/XZohYf1JvqfdVbvAH5yOp1ZYoErefz3hI9dSiVLcN0DSDbfR4NOA919CSBJigp1+ZgrtodM9WU8iom+ACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92bd77a4a3597efe38e50ce11fa33615f0348c4870153d5ff9b58c31e4b6d247","last_reissued_at":"2026-07-05T03:54:29.916707Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:54:29.916707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Neural Network with Curriculum Learning for Imbalanced Node Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Fuli Feng, Lei Wang, Lijie Wen, Xiaohe Li, Xuming Hu, Yawen Deng, Zide Fan","submitted_at":"2022-02-05T10:46:11Z","abstract_excerpt":"Graph Neural Network (GNN) is an emerging technique for graph-based learning tasks such as node classification. In this work, we reveal the vulnerability of GNN to the imbalance of node labels. Traditional solutions for imbalanced classification (e.g. resampling) are ineffective in node classification without considering the graph structure. Worse still, they may even bring overfitting or underfitting results due to lack of sufficient prior knowledge. To solve these problems, we propose a novel graph neural network framework with curriculum learning (GNN-CL) consisting of two modules. For one "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.02529","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/2202.02529/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":"2202.02529","created_at":"2026-07-05T03:54:29.916769+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.02529v1","created_at":"2026-07-05T03:54:29.916769+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.02529","created_at":"2026-07-05T03:54:29.916769+00:00"},{"alias_kind":"pith_short_12","alias_value":"SK6XPJFDLF7P","created_at":"2026-07-05T03:54:29.916769+00:00"},{"alias_kind":"pith_short_16","alias_value":"SK6XPJFDLF7P4OHF","created_at":"2026-07-05T03:54:29.916769+00:00"},{"alias_kind":"pith_short_8","alias_value":"SK6XPJFD","created_at":"2026-07-05T03:54:29.916769+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/SK6XPJFDLF7P4OHFBTQR7IZWCX","json":"https://pith.science/pith/SK6XPJFDLF7P4OHFBTQR7IZWCX.json","graph_json":"https://pith.science/api/pith-number/SK6XPJFDLF7P4OHFBTQR7IZWCX/graph.json","events_json":"https://pith.science/api/pith-number/SK6XPJFDLF7P4OHFBTQR7IZWCX/events.json","paper":"https://pith.science/paper/SK6XPJFD"},"agent_actions":{"view_html":"https://pith.science/pith/SK6XPJFDLF7P4OHFBTQR7IZWCX","download_json":"https://pith.science/pith/SK6XPJFDLF7P4OHFBTQR7IZWCX.json","view_paper":"https://pith.science/paper/SK6XPJFD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.02529&json=true","fetch_graph":"https://pith.science/api/pith-number/SK6XPJFDLF7P4OHFBTQR7IZWCX/graph.json","fetch_events":"https://pith.science/api/pith-number/SK6XPJFDLF7P4OHFBTQR7IZWCX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SK6XPJFDLF7P4OHFBTQR7IZWCX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SK6XPJFDLF7P4OHFBTQR7IZWCX/action/storage_attestation","attest_author":"https://pith.science/pith/SK6XPJFDLF7P4OHFBTQR7IZWCX/action/author_attestation","sign_citation":"https://pith.science/pith/SK6XPJFDLF7P4OHFBTQR7IZWCX/action/citation_signature","submit_replication":"https://pith.science/pith/SK6XPJFDLF7P4OHFBTQR7IZWCX/action/replication_record"}},"created_at":"2026-07-05T03:54:29.916769+00:00","updated_at":"2026-07-05T03:54:29.916769+00:00"}