{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TFQJK77CSDWMHZVG66FHWOF6U2","short_pith_number":"pith:TFQJK77C","schema_version":"1.0","canonical_sha256":"9960957fe290ecc3e6a6f78a7b38bea6a3fb35ecd2d8119f3ae293ca029d16a6","source":{"kind":"arxiv","id":"1907.10903","version":4},"attestation_state":"computed","paper":{"title":"DropEdge: Towards Deep Graph Convolutional Networks on Node Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Junzhou Huang, Tingyang Xu, Wenbing Huang, Yu Rong","submitted_at":"2019-07-25T08:57:45Z","abstract_excerpt":"\\emph{Over-fitting} and \\emph{over-smoothing} are two main obstacles of developing deep Graph Convolutional Networks (GCNs) for node classification. In particular, over-fitting weakens the generalization ability on small dataset, while over-smoothing impedes model training by isolating output representations from the input features with the increase in network depth. This paper proposes DropEdge, a novel and flexible technique to alleviate both issues. At its core, DropEdge randomly removes a certain number of edges from the input graph at each training epoch, acting like a data augmenter and "},"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":"1907.10903","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-25T08:57:45Z","cross_cats_sorted":["cs.NI","stat.ML"],"title_canon_sha256":"6335b184099eb4dbd1c497c84bc0f4395fcff69bb7d302ce77353b323f83bce2","abstract_canon_sha256":"ad11109ac47ce3f1b40c30be76cb1c1c4950627b90766fe7312b8c73a371ff6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:47:27.080988Z","signature_b64":"IbqMfJu+bl4YBDS2OaoljyTcQqE9y2KGDINuVWFKs29WVhNf07C0+/W3ND9CHsKvQcI7bMan4ztBCNCI2u08DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9960957fe290ecc3e6a6f78a7b38bea6a3fb35ecd2d8119f3ae293ca029d16a6","last_reissued_at":"2026-07-05T00:47:27.080304Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:47:27.080304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DropEdge: Towards Deep Graph Convolutional Networks on Node Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Junzhou Huang, Tingyang Xu, Wenbing Huang, Yu Rong","submitted_at":"2019-07-25T08:57:45Z","abstract_excerpt":"\\emph{Over-fitting} and \\emph{over-smoothing} are two main obstacles of developing deep Graph Convolutional Networks (GCNs) for node classification. In particular, over-fitting weakens the generalization ability on small dataset, while over-smoothing impedes model training by isolating output representations from the input features with the increase in network depth. This paper proposes DropEdge, a novel and flexible technique to alleviate both issues. At its core, DropEdge randomly removes a certain number of edges from the input graph at each training epoch, acting like a data augmenter and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.10903","kind":"arxiv","version":4},"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/1907.10903/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":"1907.10903","created_at":"2026-07-05T00:47:27.080407+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.10903v4","created_at":"2026-07-05T00:47:27.080407+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.10903","created_at":"2026-07-05T00:47:27.080407+00:00"},{"alias_kind":"pith_short_12","alias_value":"TFQJK77CSDWM","created_at":"2026-07-05T00:47:27.080407+00:00"},{"alias_kind":"pith_short_16","alias_value":"TFQJK77CSDWMHZVG","created_at":"2026-07-05T00:47:27.080407+00:00"},{"alias_kind":"pith_short_8","alias_value":"TFQJK77C","created_at":"2026-07-05T00:47:27.080407+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":10,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.09392","citing_title":"From Coarse to Fine: Managing Temporal Granularity in Spatio-Temporal Data for Fine-Grained Traffic Prediction","ref_index":41,"is_internal_anchor":false},{"citing_arxiv_id":"2606.03462","citing_title":"Topology-Aware Gaussian Graph Repair for Robust Graph Neural Networks","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2606.32016","citing_title":"FedLAB: Traceable Semantic Codebooks for Federated Multimodal Graph Foundation Learning","ref_index":223,"is_internal_anchor":false},{"citing_arxiv_id":"2407.20067","citing_title":"xAI-Drop: Don't Use What You Cannot Explain","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2605.20248","citing_title":"Graph Transductive Sharpening: Leveraging Unlabeled Predictions in Node Classification","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18872","citing_title":"EUPHORIA: Efficient Universal Planning via Hybrid Optimization for Robust Industrial Robotic Assembly","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2605.17854","citing_title":"Learning over Positive and Negative Edges with Contrastive Message Passing","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2509.22017","citing_title":"AEGIS: Authentic Edge Growth In Sparsity for Link Prediction in Edge-Sparse Bipartite Knowledge Graphs","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05476","citing_title":"A Unified Benchmark for Evaluating Knowledge Graph Construction Methods and Graph Neural Networks","ref_index":124,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05463","citing_title":"Robustness of Graph Self-Supervised Learning to Real-World Noise: A Case Study on Text-Driven Biomedical Graphs","ref_index":43,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TFQJK77CSDWMHZVG66FHWOF6U2","json":"https://pith.science/pith/TFQJK77CSDWMHZVG66FHWOF6U2.json","graph_json":"https://pith.science/api/pith-number/TFQJK77CSDWMHZVG66FHWOF6U2/graph.json","events_json":"https://pith.science/api/pith-number/TFQJK77CSDWMHZVG66FHWOF6U2/events.json","paper":"https://pith.science/paper/TFQJK77C"},"agent_actions":{"view_html":"https://pith.science/pith/TFQJK77CSDWMHZVG66FHWOF6U2","download_json":"https://pith.science/pith/TFQJK77CSDWMHZVG66FHWOF6U2.json","view_paper":"https://pith.science/paper/TFQJK77C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.10903&json=true","fetch_graph":"https://pith.science/api/pith-number/TFQJK77CSDWMHZVG66FHWOF6U2/graph.json","fetch_events":"https://pith.science/api/pith-number/TFQJK77CSDWMHZVG66FHWOF6U2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TFQJK77CSDWMHZVG66FHWOF6U2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TFQJK77CSDWMHZVG66FHWOF6U2/action/storage_attestation","attest_author":"https://pith.science/pith/TFQJK77CSDWMHZVG66FHWOF6U2/action/author_attestation","sign_citation":"https://pith.science/pith/TFQJK77CSDWMHZVG66FHWOF6U2/action/citation_signature","submit_replication":"https://pith.science/pith/TFQJK77CSDWMHZVG66FHWOF6U2/action/replication_record"}},"created_at":"2026-07-05T00:47:27.080407+00:00","updated_at":"2026-07-05T00:47:27.080407+00:00"}