{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:J5XCPH4RYWZAQ7YJ2VYQTMKPLO","short_pith_number":"pith:J5XCPH4R","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"},"canonical_sha256":"4f6e279f91c5b2087f09d57109b14f5b959221dd75637694d8a73828c45a8638","source":{"kind":"arxiv","id":"1902.07153","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.07153","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"arxiv_version","alias_value":"1902.07153v2","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07153","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"pith_short_12","alias_value":"J5XCPH4RYWZA","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"J5XCPH4RYWZAQ7YJ","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"J5XCPH4R","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:J5XCPH4RYWZAQ7YJ2VYQTMKPLO","target":"record","payload":{"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"},"canonical_sha256":"4f6e279f91c5b2087f09d57109b14f5b959221dd75637694d8a73828c45a8638","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"},"source_kind":"arxiv","source_id":"1902.07153","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:42:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JLs5yWtRb2+yEx8bWTFAL8ngTmV6UHd1mIist7JRjNSt45hS1IsWM/9kl6/jFX6VPR8iEwFdRmHoUgRiERCSBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:58:17.975098Z"},"content_sha256":"ff36516a4f2bd6b0ee27df34549081150addfac1f1ff61877cf816ae38408048","schema_version":"1.0","event_id":"sha256:ff36516a4f2bd6b0ee27df34549081150addfac1f1ff61877cf816ae38408048"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:J5XCPH4RYWZAQ7YJ2VYQTMKPLO","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:42:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZK7PzpVr4GN3Q2c1f0AlZBv2NZMaeak/zzGSRR/2wDR2eE7arkc16yQSNPEgvWGup9aJvWLLwP8UrJ5YX26vDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:58:17.975461Z"},"content_sha256":"0ebd24cb2a3d2a9ad4e1f318b590dfacef748f43810cd8befc26aead2881324a","schema_version":"1.0","event_id":"sha256:0ebd24cb2a3d2a9ad4e1f318b590dfacef748f43810cd8befc26aead2881324a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J5XCPH4RYWZAQ7YJ2VYQTMKPLO/bundle.json","state_url":"https://pith.science/pith/J5XCPH4RYWZAQ7YJ2VYQTMKPLO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J5XCPH4RYWZAQ7YJ2VYQTMKPLO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T21:58:17Z","links":{"resolver":"https://pith.science/pith/J5XCPH4RYWZAQ7YJ2VYQTMKPLO","bundle":"https://pith.science/pith/J5XCPH4RYWZAQ7YJ2VYQTMKPLO/bundle.json","state":"https://pith.science/pith/J5XCPH4RYWZAQ7YJ2VYQTMKPLO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J5XCPH4RYWZAQ7YJ2VYQTMKPLO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:J5XCPH4RYWZAQ7YJ2VYQTMKPLO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6847524bd4fcd268cafb47f70cdefd5ca1417d1b88432dfd13fb96f274ed5240","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-19T17:21:15Z","title_canon_sha256":"b98aee68d1967d811548f6b43cff532a6be59d284629ef39c4556a9870dd0491"},"schema_version":"1.0","source":{"id":"1902.07153","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.07153","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"arxiv_version","alias_value":"1902.07153v2","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07153","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"pith_short_12","alias_value":"J5XCPH4RYWZA","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"J5XCPH4RYWZAQ7YJ","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"J5XCPH4R","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:0ebd24cb2a3d2a9ad4e1f318b590dfacef748f43810cd8befc26aead2881324a","target":"graph","created_at":"2026-05-17T23:42:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Amauri Holanda de Souza Jr., Christopher Fifty, Felix Wu, Kilian Q. Weinberger, Tao Yu, Tianyi Zhang","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-19T17:21:15Z","title":"Simplifying Graph Convolutional Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07153","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ff36516a4f2bd6b0ee27df34549081150addfac1f1ff61877cf816ae38408048","target":"record","created_at":"2026-05-17T23:42:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6847524bd4fcd268cafb47f70cdefd5ca1417d1b88432dfd13fb96f274ed5240","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-19T17:21:15Z","title_canon_sha256":"b98aee68d1967d811548f6b43cff532a6be59d284629ef39c4556a9870dd0491"},"schema_version":"1.0","source":{"id":"1902.07153","kind":"arxiv","version":2}},"canonical_sha256":"4f6e279f91c5b2087f09d57109b14f5b959221dd75637694d8a73828c45a8638","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f6e279f91c5b2087f09d57109b14f5b959221dd75637694d8a73828c45a8638","first_computed_at":"2026-05-17T23:42:49.793884Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:49.793884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6YaTI+jiffrIES8sgqD34vy1ADPIRdh5f4Fk9EesooLNdsztW5sbFBiaoinkzpyhbxA0sR6s3k+4wPldMSbYDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:49.794509Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.07153","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff36516a4f2bd6b0ee27df34549081150addfac1f1ff61877cf816ae38408048","sha256:0ebd24cb2a3d2a9ad4e1f318b590dfacef748f43810cd8befc26aead2881324a"],"state_sha256":"5f1d66ebd01cb21b5cb97e9344d519d5ba3f1206b93f3ab786a72f01022a4117"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a7koVYdGA0cSKGu3h4F29kETgHaMBz+koS0UAp3Em/8w2vZAobyYr9tGYNZOrRDbgu4/hiP58gsoTsD8FOlzBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:58:17.977449Z","bundle_sha256":"475f5b0fbe02e95db2e69e80f68245eafb8e8aa9f9ae60c9b7ab4c095921436e"}}