{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:FDWUWQKO35GXCGCKT3VCKY4WLP","short_pith_number":"pith:FDWUWQKO","schema_version":"1.0","canonical_sha256":"28ed4b414edf4d71184a9eea2563965bfca50c3133e99e3fe7ff345074ce1989","source":{"kind":"arxiv","id":"2308.13821","version":2},"attestation_state":"computed","paper":{"title":"A Survey of Imbalanced Learning on Graphs: Problems, Techniques, and Future Directions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Bingsheng He, Bryan Hooi, Nan Chen, Qian Wang, Yuan Li, Zemin Liu","submitted_at":"2023-08-26T09:11:44Z","abstract_excerpt":"Graphs represent interconnected structures prevalent in a myriad of real-world scenarios. Effective graph analytics, such as graph learning methods, enables users to gain profound insights from graph data, underpinning various tasks including node classification and link prediction. However, these methods often suffer from data imbalance, a common issue in graph data where certain segments possess abundant data while others are scarce, thereby leading to biased learning outcomes. This necessitates the emerging field of imbalanced learning on graphs, which aims to correct these data distributio"},"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":"2308.13821","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-08-26T09:11:44Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"19ba8f4e6faa2eecfd7165032a49dc1e848af1b4920f40a1d6c1d0bc6b8515ac","abstract_canon_sha256":"7b7aea69b99e5b9dec26389e38fd9af53bebaa407366632ce1dd6ab954a8681e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:45:38.573178Z","signature_b64":"yO+xstX7ODoikWGdMNpm6X2H7pwGLPARgvN6WmT/uO18w3HEuhfeIB6pbsr5hFJKxdCxIlKYlYPkfMCkyquwDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28ed4b414edf4d71184a9eea2563965bfca50c3133e99e3fe7ff345074ce1989","last_reissued_at":"2026-07-05T06:45:38.572601Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:45:38.572601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Survey of Imbalanced Learning on Graphs: Problems, Techniques, and Future Directions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Bingsheng He, Bryan Hooi, Nan Chen, Qian Wang, Yuan Li, Zemin Liu","submitted_at":"2023-08-26T09:11:44Z","abstract_excerpt":"Graphs represent interconnected structures prevalent in a myriad of real-world scenarios. Effective graph analytics, such as graph learning methods, enables users to gain profound insights from graph data, underpinning various tasks including node classification and link prediction. However, these methods often suffer from data imbalance, a common issue in graph data where certain segments possess abundant data while others are scarce, thereby leading to biased learning outcomes. This necessitates the emerging field of imbalanced learning on graphs, which aims to correct these data distributio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.13821","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/2308.13821/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":"2308.13821","created_at":"2026-07-05T06:45:38.572674+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.13821v2","created_at":"2026-07-05T06:45:38.572674+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.13821","created_at":"2026-07-05T06:45:38.572674+00:00"},{"alias_kind":"pith_short_12","alias_value":"FDWUWQKO35GX","created_at":"2026-07-05T06:45:38.572674+00:00"},{"alias_kind":"pith_short_16","alias_value":"FDWUWQKO35GXCGCK","created_at":"2026-07-05T06:45:38.572674+00:00"},{"alias_kind":"pith_short_8","alias_value":"FDWUWQKO","created_at":"2026-07-05T06:45:38.572674+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.00671","citing_title":"Multi-Label Node Classification with Label Influence Propagation","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FDWUWQKO35GXCGCKT3VCKY4WLP","json":"https://pith.science/pith/FDWUWQKO35GXCGCKT3VCKY4WLP.json","graph_json":"https://pith.science/api/pith-number/FDWUWQKO35GXCGCKT3VCKY4WLP/graph.json","events_json":"https://pith.science/api/pith-number/FDWUWQKO35GXCGCKT3VCKY4WLP/events.json","paper":"https://pith.science/paper/FDWUWQKO"},"agent_actions":{"view_html":"https://pith.science/pith/FDWUWQKO35GXCGCKT3VCKY4WLP","download_json":"https://pith.science/pith/FDWUWQKO35GXCGCKT3VCKY4WLP.json","view_paper":"https://pith.science/paper/FDWUWQKO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.13821&json=true","fetch_graph":"https://pith.science/api/pith-number/FDWUWQKO35GXCGCKT3VCKY4WLP/graph.json","fetch_events":"https://pith.science/api/pith-number/FDWUWQKO35GXCGCKT3VCKY4WLP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FDWUWQKO35GXCGCKT3VCKY4WLP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FDWUWQKO35GXCGCKT3VCKY4WLP/action/storage_attestation","attest_author":"https://pith.science/pith/FDWUWQKO35GXCGCKT3VCKY4WLP/action/author_attestation","sign_citation":"https://pith.science/pith/FDWUWQKO35GXCGCKT3VCKY4WLP/action/citation_signature","submit_replication":"https://pith.science/pith/FDWUWQKO35GXCGCKT3VCKY4WLP/action/replication_record"}},"created_at":"2026-07-05T06:45:38.572674+00:00","updated_at":"2026-07-05T06:45:38.572674+00:00"}