{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:RZVBMLH65HXT5BDNVBITWM3OC5","short_pith_number":"pith:RZVBMLH6","canonical_record":{"source":{"id":"1903.01298","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-04T15:05:36Z","cross_cats_sorted":["eess.SP","stat.ML"],"title_canon_sha256":"d15ae0d521ab5b968b5d06e681db2b3b55bef26bf16a125e64bfe16dc5b9afda","abstract_canon_sha256":"63a2a2cc1895e5351c429be9082535f5d562878a45d8773137e6331d2d3f172c"},"schema_version":"1.0"},"canonical_sha256":"8e6a162cfee9ef3e846da8513b336e177fd1e74620fc274efaf95d8ea426d430","source":{"kind":"arxiv","id":"1903.01298","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.01298","created_at":"2026-05-17T23:52:09Z"},{"alias_kind":"arxiv_version","alias_value":"1903.01298v1","created_at":"2026-05-17T23:52:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01298","created_at":"2026-05-17T23:52:09Z"},{"alias_kind":"pith_short_12","alias_value":"RZVBMLH65HXT","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RZVBMLH65HXT5BDN","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RZVBMLH6","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:RZVBMLH65HXT5BDNVBITWM3OC5","target":"record","payload":{"canonical_record":{"source":{"id":"1903.01298","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-04T15:05:36Z","cross_cats_sorted":["eess.SP","stat.ML"],"title_canon_sha256":"d15ae0d521ab5b968b5d06e681db2b3b55bef26bf16a125e64bfe16dc5b9afda","abstract_canon_sha256":"63a2a2cc1895e5351c429be9082535f5d562878a45d8773137e6331d2d3f172c"},"schema_version":"1.0"},"canonical_sha256":"8e6a162cfee9ef3e846da8513b336e177fd1e74620fc274efaf95d8ea426d430","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:09.162905Z","signature_b64":"mK4MPhx/iSKdAEefaqlsnhbgXlUt6f6bZrpvf5fYxwZ5yiVD1/Iyfu4QA4Tfek1d2+qN7cqtl386BW77OuvHDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e6a162cfee9ef3e846da8513b336e177fd1e74620fc274efaf95d8ea426d430","last_reissued_at":"2026-05-17T23:52:09.162467Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:09.162467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.01298","source_version":1,"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:52:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+tddw2sc7Sc9zAx6NH+4pLquP7hDshJw+JsNU42TRUOf8AO0xs2JLy0sFt01OJtLRIVoIp2q19HWyuF7dg4XBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T13:26:54.193295Z"},"content_sha256":"fb13f8f235358c1d834092b5f7c98bfbc2e273f0d751dbfed2b6aab0ee1ede9d","schema_version":"1.0","event_id":"sha256:fb13f8f235358c1d834092b5f7c98bfbc2e273f0d751dbfed2b6aab0ee1ede9d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:RZVBMLH65HXT5BDNVBITWM3OC5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalizing Graph Convolutional Neural Networks with Edge-Variant Recursions on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alejandro Ribeiro, Elvin Isufi, Fernando Gama","submitted_at":"2019-03-04T15:05:36Z","abstract_excerpt":"This paper reviews graph convolutional neural networks (GCNNs) through the lens of edge-variant graph filters. The edge-variant graph filter is a finite order, linear, and local recursion that allows each node, in each iteration, to weigh differently the information of its neighbors. By exploiting this recursion, we formulate a general framework for GCNNs which considers state-of-the-art solutions as particular cases. This framework results useful to i) understand the tradeoff between local detail and the number of parameters of each solution and ii) provide guidelines for developing a myriad "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01298","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":""},"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:52:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mW6/dyZQfieKygihwrlUuMhe4mh9qsF0W/jPIi4bfymlEBifcC2v3qcBThz2zTe6HKnDK4UwbCVZ7M9HhIkbDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T13:26:54.193661Z"},"content_sha256":"5a72cdd132c729966473875226ff0a4b3cd05a46b5c0b2cc4222563ac43510a2","schema_version":"1.0","event_id":"sha256:5a72cdd132c729966473875226ff0a4b3cd05a46b5c0b2cc4222563ac43510a2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RZVBMLH65HXT5BDNVBITWM3OC5/bundle.json","state_url":"https://pith.science/pith/RZVBMLH65HXT5BDNVBITWM3OC5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RZVBMLH65HXT5BDNVBITWM3OC5/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-29T13:26:54Z","links":{"resolver":"https://pith.science/pith/RZVBMLH65HXT5BDNVBITWM3OC5","bundle":"https://pith.science/pith/RZVBMLH65HXT5BDNVBITWM3OC5/bundle.json","state":"https://pith.science/pith/RZVBMLH65HXT5BDNVBITWM3OC5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RZVBMLH65HXT5BDNVBITWM3OC5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RZVBMLH65HXT5BDNVBITWM3OC5","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":"63a2a2cc1895e5351c429be9082535f5d562878a45d8773137e6331d2d3f172c","cross_cats_sorted":["eess.SP","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-04T15:05:36Z","title_canon_sha256":"d15ae0d521ab5b968b5d06e681db2b3b55bef26bf16a125e64bfe16dc5b9afda"},"schema_version":"1.0","source":{"id":"1903.01298","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.01298","created_at":"2026-05-17T23:52:09Z"},{"alias_kind":"arxiv_version","alias_value":"1903.01298v1","created_at":"2026-05-17T23:52:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01298","created_at":"2026-05-17T23:52:09Z"},{"alias_kind":"pith_short_12","alias_value":"RZVBMLH65HXT","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RZVBMLH65HXT5BDN","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RZVBMLH6","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:5a72cdd132c729966473875226ff0a4b3cd05a46b5c0b2cc4222563ac43510a2","target":"graph","created_at":"2026-05-17T23:52:09Z","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":"This paper reviews graph convolutional neural networks (GCNNs) through the lens of edge-variant graph filters. The edge-variant graph filter is a finite order, linear, and local recursion that allows each node, in each iteration, to weigh differently the information of its neighbors. By exploiting this recursion, we formulate a general framework for GCNNs which considers state-of-the-art solutions as particular cases. This framework results useful to i) understand the tradeoff between local detail and the number of parameters of each solution and ii) provide guidelines for developing a myriad ","authors_text":"Alejandro Ribeiro, Elvin Isufi, Fernando Gama","cross_cats":["eess.SP","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-04T15:05:36Z","title":"Generalizing Graph Convolutional Neural Networks with Edge-Variant Recursions on Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01298","kind":"arxiv","version":1},"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:fb13f8f235358c1d834092b5f7c98bfbc2e273f0d751dbfed2b6aab0ee1ede9d","target":"record","created_at":"2026-05-17T23:52:09Z","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":"63a2a2cc1895e5351c429be9082535f5d562878a45d8773137e6331d2d3f172c","cross_cats_sorted":["eess.SP","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-04T15:05:36Z","title_canon_sha256":"d15ae0d521ab5b968b5d06e681db2b3b55bef26bf16a125e64bfe16dc5b9afda"},"schema_version":"1.0","source":{"id":"1903.01298","kind":"arxiv","version":1}},"canonical_sha256":"8e6a162cfee9ef3e846da8513b336e177fd1e74620fc274efaf95d8ea426d430","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e6a162cfee9ef3e846da8513b336e177fd1e74620fc274efaf95d8ea426d430","first_computed_at":"2026-05-17T23:52:09.162467Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:09.162467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mK4MPhx/iSKdAEefaqlsnhbgXlUt6f6bZrpvf5fYxwZ5yiVD1/Iyfu4QA4Tfek1d2+qN7cqtl386BW77OuvHDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:09.162905Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.01298","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb13f8f235358c1d834092b5f7c98bfbc2e273f0d751dbfed2b6aab0ee1ede9d","sha256:5a72cdd132c729966473875226ff0a4b3cd05a46b5c0b2cc4222563ac43510a2"],"state_sha256":"d0e37af70f458de350f505fa22e6fb5ea9bb2d938e46b9b8a3fac79d06c6b0e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IeVoMeqV9yCWQfLi8rIsB9AuaHcnNkWn5b6ndZ9DSkLUXnuuErof+ElI6PeOZp8tSvfg6PRB1flt/1Plb7HpCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T13:26:54.195637Z","bundle_sha256":"863645cd1c3d908ed1d7fa6dd31b610fff91012fa1a2ad704b40f81907bac934"}}