{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:J5XCPH4RYWZAQ7YJ2VYQTMKPLO","short_pith_number":"pith:J5XCPH4R","schema_version":"1.0","canonical_sha256":"4f6e279f91c5b2087f09d57109b14f5b959221dd75637694d8a73828c45a8638","source":{"kind":"arxiv","id":"1902.07153","version":2},"attestation_state":"computed","paper":{"title":"Simplifying Graph Convolutional Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Amauri Holanda de Souza Jr., Christopher Fifty, Felix Wu, Kilian Q. Weinberger, Tao Yu, Tianyi Zhang","submitted_at":"2019-02-19T17:21:15Z","abstract_excerpt":"Graph Convolutional Networks (GCNs) and their variants have experienced significant attention and have become the de facto methods for learning graph representations. GCNs derive inspiration primarily from recent deep learning approaches, and as a result, may inherit unnecessary complexity and redundant computation. In this paper, we reduce this excess complexity through successively removing nonlinearities and collapsing weight matrices between consecutive layers. We theoretically analyze the resulting linear model and show that it corresponds to a fixed low-pass filter followed by a linear c"},"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":"1902.07153","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-19T17:21:15Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b98aee68d1967d811548f6b43cff532a6be59d284629ef39c4556a9870dd0491","abstract_canon_sha256":"6847524bd4fcd268cafb47f70cdefd5ca1417d1b88432dfd13fb96f274ed5240"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:49.794509Z","signature_b64":"6YaTI+jiffrIES8sgqD34vy1ADPIRdh5f4Fk9EesooLNdsztW5sbFBiaoinkzpyhbxA0sR6s3k+4wPldMSbYDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f6e279f91c5b2087f09d57109b14f5b959221dd75637694d8a73828c45a8638","last_reissued_at":"2026-05-17T23:42:49.793884Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:49.793884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simplifying Graph Convolutional Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Amauri Holanda de Souza Jr., Christopher Fifty, Felix Wu, Kilian Q. Weinberger, Tao Yu, Tianyi Zhang","submitted_at":"2019-02-19T17:21:15Z","abstract_excerpt":"Graph Convolutional Networks (GCNs) and their variants have experienced significant attention and have become the de facto methods for learning graph representations. GCNs derive inspiration primarily from recent deep learning approaches, and as a result, may inherit unnecessary complexity and redundant computation. In this paper, we reduce this excess complexity through successively removing nonlinearities and collapsing weight matrices between consecutive layers. We theoretically analyze the resulting linear model and show that it corresponds to a fixed low-pass filter followed by a linear c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07153","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":""},"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":"1902.07153","created_at":"2026-05-17T23:42:49.793979+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.07153v2","created_at":"2026-05-17T23:42:49.793979+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07153","created_at":"2026-05-17T23:42:49.793979+00:00"},{"alias_kind":"pith_short_12","alias_value":"J5XCPH4RYWZA","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"J5XCPH4RYWZAQ7YJ","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"J5XCPH4R","created_at":"2026-05-18T12:33:18.533446+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"1906.12330","citing_title":"Graph Star Net for Generalized Multi-Task Learning","ref_index":23,"is_internal_anchor":true},{"citing_arxiv_id":"1909.01315","citing_title":"Deep Graph Library: A Graph-Centric, Highly-Performant Package for Graph Neural Networks","ref_index":13,"is_internal_anchor":true},{"citing_arxiv_id":"2409.15645","citing_title":"Quantum Machine Learning in Drug Discovery: Applications in Academia and Pharmaceutical Industries","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"1903.02428","citing_title":"Fast Graph Representation Learning with PyTorch Geometric","ref_index":47,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J5XCPH4RYWZAQ7YJ2VYQTMKPLO","json":"https://pith.science/pith/J5XCPH4RYWZAQ7YJ2VYQTMKPLO.json","graph_json":"https://pith.science/api/pith-number/J5XCPH4RYWZAQ7YJ2VYQTMKPLO/graph.json","events_json":"https://pith.science/api/pith-number/J5XCPH4RYWZAQ7YJ2VYQTMKPLO/events.json","paper":"https://pith.science/paper/J5XCPH4R"},"agent_actions":{"view_html":"https://pith.science/pith/J5XCPH4RYWZAQ7YJ2VYQTMKPLO","download_json":"https://pith.science/pith/J5XCPH4RYWZAQ7YJ2VYQTMKPLO.json","view_paper":"https://pith.science/paper/J5XCPH4R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.07153&json=true","fetch_graph":"https://pith.science/api/pith-number/J5XCPH4RYWZAQ7YJ2VYQTMKPLO/graph.json","fetch_events":"https://pith.science/api/pith-number/J5XCPH4RYWZAQ7YJ2VYQTMKPLO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J5XCPH4RYWZAQ7YJ2VYQTMKPLO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J5XCPH4RYWZAQ7YJ2VYQTMKPLO/action/storage_attestation","attest_author":"https://pith.science/pith/J5XCPH4RYWZAQ7YJ2VYQTMKPLO/action/author_attestation","sign_citation":"https://pith.science/pith/J5XCPH4RYWZAQ7YJ2VYQTMKPLO/action/citation_signature","submit_replication":"https://pith.science/pith/J5XCPH4RYWZAQ7YJ2VYQTMKPLO/action/replication_record"}},"created_at":"2026-05-17T23:42:49.793979+00:00","updated_at":"2026-05-17T23:42:49.793979+00:00"}