{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:NOXO5B2SYZXW4ZK6EOUVRDLHPX","short_pith_number":"pith:NOXO5B2S","schema_version":"1.0","canonical_sha256":"6baeee8752c66f6e655e23a9588d677de0baafebf78c6c1e80d776e4bc190b62","source":{"kind":"arxiv","id":"2212.09970","version":3},"attestation_state":"computed","paper":{"title":"Data Augmentation on Graphs: A Technical Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chenxuan Xie, Jiajun Zhou, Qi Xuan, Shengbo Gong, Xiangyu Zhao, Xiaoniu Yang, Zhenyu Wen","submitted_at":"2022-12-20T02:51:28Z","abstract_excerpt":"In recent years, graph representation learning has achieved remarkable success while suffering from low-quality data problems. As a mature technology to improve data quality in computer vision, data augmentation has also attracted increasing attention in graph domain. To advance research in this emerging direction, this survey provides a comprehensive review and summary of existing graph data augmentation (GDAug) techniques. Specifically, this survey first provides an overview of various feasible taxonomies and categorizes existing GDAug studies based on multi-scale graph elements. Subsequentl"},"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":"2212.09970","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-12-20T02:51:28Z","cross_cats_sorted":[],"title_canon_sha256":"8b47287dc41e01f93dd6be196321a7bdd5108ed85840113106aba4a2874276a2","abstract_canon_sha256":"7d2a6c76dad836f98da15b11c598a91e9875114e092d8ed1e017d83a1d0e2155"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:34:53.868810Z","signature_b64":"mILaChySgfda3/TD8QYkS8IhgeXkkWORJR4iOSVISqwKno7IGZIdyj8hwxcEsKNkF270IkQ/vP9gS5X5APLdDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6baeee8752c66f6e655e23a9588d677de0baafebf78c6c1e80d776e4bc190b62","last_reissued_at":"2026-07-05T08:34:53.868291Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:34:53.868291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Data Augmentation on Graphs: A Technical Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chenxuan Xie, Jiajun Zhou, Qi Xuan, Shengbo Gong, Xiangyu Zhao, Xiaoniu Yang, Zhenyu Wen","submitted_at":"2022-12-20T02:51:28Z","abstract_excerpt":"In recent years, graph representation learning has achieved remarkable success while suffering from low-quality data problems. As a mature technology to improve data quality in computer vision, data augmentation has also attracted increasing attention in graph domain. To advance research in this emerging direction, this survey provides a comprehensive review and summary of existing graph data augmentation (GDAug) techniques. Specifically, this survey first provides an overview of various feasible taxonomies and categorizes existing GDAug studies based on multi-scale graph elements. Subsequentl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.09970","kind":"arxiv","version":3},"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/2212.09970/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":"2212.09970","created_at":"2026-07-05T08:34:53.868364+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.09970v3","created_at":"2026-07-05T08:34:53.868364+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.09970","created_at":"2026-07-05T08:34:53.868364+00:00"},{"alias_kind":"pith_short_12","alias_value":"NOXO5B2SYZXW","created_at":"2026-07-05T08:34:53.868364+00:00"},{"alias_kind":"pith_short_16","alias_value":"NOXO5B2SYZXW4ZK6","created_at":"2026-07-05T08:34:53.868364+00:00"},{"alias_kind":"pith_short_8","alias_value":"NOXO5B2S","created_at":"2026-07-05T08:34:53.868364+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.19770","citing_title":"An Information Theoretic Framework for Graph Novelty Generation via Latent Mixture Modeling","ref_index":43,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NOXO5B2SYZXW4ZK6EOUVRDLHPX","json":"https://pith.science/pith/NOXO5B2SYZXW4ZK6EOUVRDLHPX.json","graph_json":"https://pith.science/api/pith-number/NOXO5B2SYZXW4ZK6EOUVRDLHPX/graph.json","events_json":"https://pith.science/api/pith-number/NOXO5B2SYZXW4ZK6EOUVRDLHPX/events.json","paper":"https://pith.science/paper/NOXO5B2S"},"agent_actions":{"view_html":"https://pith.science/pith/NOXO5B2SYZXW4ZK6EOUVRDLHPX","download_json":"https://pith.science/pith/NOXO5B2SYZXW4ZK6EOUVRDLHPX.json","view_paper":"https://pith.science/paper/NOXO5B2S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.09970&json=true","fetch_graph":"https://pith.science/api/pith-number/NOXO5B2SYZXW4ZK6EOUVRDLHPX/graph.json","fetch_events":"https://pith.science/api/pith-number/NOXO5B2SYZXW4ZK6EOUVRDLHPX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NOXO5B2SYZXW4ZK6EOUVRDLHPX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NOXO5B2SYZXW4ZK6EOUVRDLHPX/action/storage_attestation","attest_author":"https://pith.science/pith/NOXO5B2SYZXW4ZK6EOUVRDLHPX/action/author_attestation","sign_citation":"https://pith.science/pith/NOXO5B2SYZXW4ZK6EOUVRDLHPX/action/citation_signature","submit_replication":"https://pith.science/pith/NOXO5B2SYZXW4ZK6EOUVRDLHPX/action/replication_record"}},"created_at":"2026-07-05T08:34:53.868364+00:00","updated_at":"2026-07-05T08:34:53.868364+00:00"}