{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DCUSZGH7RPRESH4J2C3W2OMQZY","short_pith_number":"pith:DCUSZGH7","canonical_record":{"source":{"id":"1811.10435","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-23T13:45:30Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"16a3b6a66bf1b227bf3f56dd9a18f731f7330dae554309cd976a7f132b4f56be","abstract_canon_sha256":"62c1d2aa995308cf28d5380d67547b9a6829744068a661856cf3fe90c0ca1264"},"schema_version":"1.0"},"canonical_sha256":"18a92c98ff8be2491f89d0b76d3990ce01d3281993344624559196402a1a2611","source":{"kind":"arxiv","id":"1811.10435","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10435","created_at":"2026-05-17T23:59:56Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10435v1","created_at":"2026-05-17T23:59:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10435","created_at":"2026-05-17T23:59:56Z"},{"alias_kind":"pith_short_12","alias_value":"DCUSZGH7RPRE","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DCUSZGH7RPRESH4J","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DCUSZGH7","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DCUSZGH7RPRESH4J2C3W2OMQZY","target":"record","payload":{"canonical_record":{"source":{"id":"1811.10435","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-23T13:45:30Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"16a3b6a66bf1b227bf3f56dd9a18f731f7330dae554309cd976a7f132b4f56be","abstract_canon_sha256":"62c1d2aa995308cf28d5380d67547b9a6829744068a661856cf3fe90c0ca1264"},"schema_version":"1.0"},"canonical_sha256":"18a92c98ff8be2491f89d0b76d3990ce01d3281993344624559196402a1a2611","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:56.466629Z","signature_b64":"vIpUjB/chsSFKg3pSNcMe7vlOvGpypPmiDLU9zkNeNerCEHKpSbhp0V0NuQQRTNtROSy1bszjh0xhqcHtCIOAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18a92c98ff8be2491f89d0b76d3990ce01d3281993344624559196402a1a2611","last_reissued_at":"2026-05-17T23:59:56.465963Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:56.465963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.10435","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:59:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4AMlzZHkKxD5JOCsVuSFVRM204YVxFGYezb6zkZHx6FQ0vrjvCb/LsUPWaRtbK1gCAGrBphB64izu5BUPSKWAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:36:59.384508Z"},"content_sha256":"f4de8a699891d2ebef7be53914815ec01e102acce3eb52a91d62d575f149aba9","schema_version":"1.0","event_id":"sha256:f4de8a699891d2ebef7be53914815ec01e102acce3eb52a91d62d575f149aba9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DCUSZGH7RPRESH4J2C3W2OMQZY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Filter Size in Graph Convolutional Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alessandro Sperduti, Dinh Van Tran, Nicol\\`o Navarin","submitted_at":"2018-11-23T13:45:30Z","abstract_excerpt":"Recently, many researchers have been focusing on the definition of neural networks for graphs. The basic component for many of these approaches remains the graph convolution idea proposed almost a decade ago. In this paper, we extend this basic component, following an intuition derived from the well-known convolutional filters over multi-dimensional tensors. In particular, we derive a simple, efficient and effective way to introduce a hyper-parameter on graph convolutions that influences the filter size, i.e. its receptive field over the considered graph. We show with experimental results on r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10435","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:59:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"En5wshrsV0HBEDUXy4EUIY5ltulFil/lNjF1b+ikMmyXzHMqE7nlYGR+IhdzktK7Md4YdcRSw5z+MjMNHiJXCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:36:59.385331Z"},"content_sha256":"4c7a256276bd3ce80a400fc2ba13dc541b0a4c027f9dab5e1242f9a043d5a99c","schema_version":"1.0","event_id":"sha256:4c7a256276bd3ce80a400fc2ba13dc541b0a4c027f9dab5e1242f9a043d5a99c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DCUSZGH7RPRESH4J2C3W2OMQZY/bundle.json","state_url":"https://pith.science/pith/DCUSZGH7RPRESH4J2C3W2OMQZY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DCUSZGH7RPRESH4J2C3W2OMQZY/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-01T02:36:59Z","links":{"resolver":"https://pith.science/pith/DCUSZGH7RPRESH4J2C3W2OMQZY","bundle":"https://pith.science/pith/DCUSZGH7RPRESH4J2C3W2OMQZY/bundle.json","state":"https://pith.science/pith/DCUSZGH7RPRESH4J2C3W2OMQZY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DCUSZGH7RPRESH4J2C3W2OMQZY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DCUSZGH7RPRESH4J2C3W2OMQZY","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":"62c1d2aa995308cf28d5380d67547b9a6829744068a661856cf3fe90c0ca1264","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-23T13:45:30Z","title_canon_sha256":"16a3b6a66bf1b227bf3f56dd9a18f731f7330dae554309cd976a7f132b4f56be"},"schema_version":"1.0","source":{"id":"1811.10435","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10435","created_at":"2026-05-17T23:59:56Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10435v1","created_at":"2026-05-17T23:59:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10435","created_at":"2026-05-17T23:59:56Z"},{"alias_kind":"pith_short_12","alias_value":"DCUSZGH7RPRE","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DCUSZGH7RPRESH4J","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DCUSZGH7","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:4c7a256276bd3ce80a400fc2ba13dc541b0a4c027f9dab5e1242f9a043d5a99c","target":"graph","created_at":"2026-05-17T23:59:56Z","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":"Recently, many researchers have been focusing on the definition of neural networks for graphs. The basic component for many of these approaches remains the graph convolution idea proposed almost a decade ago. In this paper, we extend this basic component, following an intuition derived from the well-known convolutional filters over multi-dimensional tensors. In particular, we derive a simple, efficient and effective way to introduce a hyper-parameter on graph convolutions that influences the filter size, i.e. its receptive field over the considered graph. We show with experimental results on r","authors_text":"Alessandro Sperduti, Dinh Van Tran, Nicol\\`o Navarin","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-23T13:45:30Z","title":"On Filter Size in Graph Convolutional Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10435","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:f4de8a699891d2ebef7be53914815ec01e102acce3eb52a91d62d575f149aba9","target":"record","created_at":"2026-05-17T23:59:56Z","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":"62c1d2aa995308cf28d5380d67547b9a6829744068a661856cf3fe90c0ca1264","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-23T13:45:30Z","title_canon_sha256":"16a3b6a66bf1b227bf3f56dd9a18f731f7330dae554309cd976a7f132b4f56be"},"schema_version":"1.0","source":{"id":"1811.10435","kind":"arxiv","version":1}},"canonical_sha256":"18a92c98ff8be2491f89d0b76d3990ce01d3281993344624559196402a1a2611","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18a92c98ff8be2491f89d0b76d3990ce01d3281993344624559196402a1a2611","first_computed_at":"2026-05-17T23:59:56.465963Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:56.465963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vIpUjB/chsSFKg3pSNcMe7vlOvGpypPmiDLU9zkNeNerCEHKpSbhp0V0NuQQRTNtROSy1bszjh0xhqcHtCIOAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:56.466629Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.10435","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f4de8a699891d2ebef7be53914815ec01e102acce3eb52a91d62d575f149aba9","sha256:4c7a256276bd3ce80a400fc2ba13dc541b0a4c027f9dab5e1242f9a043d5a99c"],"state_sha256":"a712b14bd20f78f9a56214abd4d66805e9e2fa1e03551be180c8c7f6fb04be70"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MLXfNzdG0OWQ3XrIaLCP0h3XgE+OCGegDrQAIqUxr0fqBd63qAoVSCSI4y4/F/9MnKEs5qbWvkdaH/KFsWmmAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T02:36:59.390106Z","bundle_sha256":"0c63bcac2f122cd72d10f6e4ea0a27446dcae10505952759a40de28d58bbdbf2"}}