{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:U2E7DE4ABV2GLBHSTSTR3ZDYKU","short_pith_number":"pith:U2E7DE4A","schema_version":"1.0","canonical_sha256":"a689f193800d746584f29ca71de4785533040f6a13fc8b288ee441e2bb25177f","source":{"kind":"arxiv","id":"2106.02817","version":1},"attestation_state":"computed","paper":{"title":"ImGAGN:Imbalanced Network Embedding via Generative Adversarial Graph Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Hongzhi Yin, Huaisheng Zhu, Liang Qu, Ruiqi Zheng, Yuhui Shi","submitted_at":"2021-06-05T06:56:37Z","abstract_excerpt":"Imbalanced classification on graphs is ubiquitous yet challenging in many real-world applications, such as fraudulent node detection. Recently, graph neural networks (GNNs) have shown promising performance on many network analysis tasks. However, most existing GNNs have almost exclusively focused on the balanced networks, and would get unappealing performance on the imbalanced networks. To bridge this gap, in this paper, we present a generative adversarial graph network model, called ImGAGN to address the imbalanced classification problem on graphs. It introduces a novel generator for graph st"},"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":"2106.02817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-06-05T06:56:37Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"c74c8f91daa625cdb0659504f6d096cf4e2c212c7f8f5e27fe4872530ba974f5","abstract_canon_sha256":"a3c5729dc4e74ec13a6da33a5d4d6c5d4d44ecb21ef689c6ab222476f2254017"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:46:30.366516Z","signature_b64":"OX49OFmM3LqvSBkflf9+uQT/Z+HMcgQokBtMk5QPZnaxBj7J17SxHM6TkmcdMgO3gnsGtnobUCxCYxwX0TFgDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a689f193800d746584f29ca71de4785533040f6a13fc8b288ee441e2bb25177f","last_reissued_at":"2026-07-05T02:46:30.365979Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:46:30.365979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ImGAGN:Imbalanced Network Embedding via Generative Adversarial Graph Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Hongzhi Yin, Huaisheng Zhu, Liang Qu, Ruiqi Zheng, Yuhui Shi","submitted_at":"2021-06-05T06:56:37Z","abstract_excerpt":"Imbalanced classification on graphs is ubiquitous yet challenging in many real-world applications, such as fraudulent node detection. Recently, graph neural networks (GNNs) have shown promising performance on many network analysis tasks. However, most existing GNNs have almost exclusively focused on the balanced networks, and would get unappealing performance on the imbalanced networks. To bridge this gap, in this paper, we present a generative adversarial graph network model, called ImGAGN to address the imbalanced classification problem on graphs. It introduces a novel generator for graph st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.02817","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/2106.02817/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":"2106.02817","created_at":"2026-07-05T02:46:30.366034+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.02817v1","created_at":"2026-07-05T02:46:30.366034+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.02817","created_at":"2026-07-05T02:46:30.366034+00:00"},{"alias_kind":"pith_short_12","alias_value":"U2E7DE4ABV2G","created_at":"2026-07-05T02:46:30.366034+00:00"},{"alias_kind":"pith_short_16","alias_value":"U2E7DE4ABV2GLBHS","created_at":"2026-07-05T02:46:30.366034+00:00"},{"alias_kind":"pith_short_8","alias_value":"U2E7DE4A","created_at":"2026-07-05T02:46:30.366034+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/U2E7DE4ABV2GLBHSTSTR3ZDYKU","json":"https://pith.science/pith/U2E7DE4ABV2GLBHSTSTR3ZDYKU.json","graph_json":"https://pith.science/api/pith-number/U2E7DE4ABV2GLBHSTSTR3ZDYKU/graph.json","events_json":"https://pith.science/api/pith-number/U2E7DE4ABV2GLBHSTSTR3ZDYKU/events.json","paper":"https://pith.science/paper/U2E7DE4A"},"agent_actions":{"view_html":"https://pith.science/pith/U2E7DE4ABV2GLBHSTSTR3ZDYKU","download_json":"https://pith.science/pith/U2E7DE4ABV2GLBHSTSTR3ZDYKU.json","view_paper":"https://pith.science/paper/U2E7DE4A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.02817&json=true","fetch_graph":"https://pith.science/api/pith-number/U2E7DE4ABV2GLBHSTSTR3ZDYKU/graph.json","fetch_events":"https://pith.science/api/pith-number/U2E7DE4ABV2GLBHSTSTR3ZDYKU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U2E7DE4ABV2GLBHSTSTR3ZDYKU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U2E7DE4ABV2GLBHSTSTR3ZDYKU/action/storage_attestation","attest_author":"https://pith.science/pith/U2E7DE4ABV2GLBHSTSTR3ZDYKU/action/author_attestation","sign_citation":"https://pith.science/pith/U2E7DE4ABV2GLBHSTSTR3ZDYKU/action/citation_signature","submit_replication":"https://pith.science/pith/U2E7DE4ABV2GLBHSTSTR3ZDYKU/action/replication_record"}},"created_at":"2026-07-05T02:46:30.366034+00:00","updated_at":"2026-07-05T02:46:30.366034+00:00"}