{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:UVH2DQX5N2HWS5TTYVUFSIM7SK","short_pith_number":"pith:UVH2DQX5","canonical_record":{"source":{"id":"1905.04579","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-11T19:47:19Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"8d729d7264f152f7926458d9f9fdc9cdafa26cb0b45e539b15b147f0136f1f8e","abstract_canon_sha256":"2aae453ebc93511bceb4879790aa393ac6a1010ea3ee2582c03b9199c844d9a2"},"schema_version":"1.0"},"canonical_sha256":"a54fa1c2fd6e8f697673c56859219f92992879062607d56a9a30a3e8b59826b2","source":{"kind":"arxiv","id":"1905.04579","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04579","created_at":"2026-07-05T01:08:59Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04579v3","created_at":"2026-07-05T01:08:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04579","created_at":"2026-07-05T01:08:59Z"},{"alias_kind":"pith_short_12","alias_value":"UVH2DQX5N2HW","created_at":"2026-07-05T01:08:59Z"},{"alias_kind":"pith_short_16","alias_value":"UVH2DQX5N2HWS5TT","created_at":"2026-07-05T01:08:59Z"},{"alias_kind":"pith_short_8","alias_value":"UVH2DQX5","created_at":"2026-07-05T01:08:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:UVH2DQX5N2HWS5TTYVUFSIM7SK","target":"record","payload":{"canonical_record":{"source":{"id":"1905.04579","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-11T19:47:19Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"8d729d7264f152f7926458d9f9fdc9cdafa26cb0b45e539b15b147f0136f1f8e","abstract_canon_sha256":"2aae453ebc93511bceb4879790aa393ac6a1010ea3ee2582c03b9199c844d9a2"},"schema_version":"1.0"},"canonical_sha256":"a54fa1c2fd6e8f697673c56859219f92992879062607d56a9a30a3e8b59826b2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:08:59.431455Z","signature_b64":"6jMJHbBmEA/nQDi5RSbaOrpgKkL5cp4L765xFSp6Rdn8/b7OYxg83UGPE1CnPqn+SRHFUY+j659Xd9j1LmmnCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a54fa1c2fd6e8f697673c56859219f92992879062607d56a9a30a3e8b59826b2","last_reissued_at":"2026-07-05T01:08:59.431018Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:08:59.431018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.04579","source_version":3,"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-07-05T01:08:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T7Za4MgtQGZk3buMSiYDNZ1aOAWbnm+Q/3pyVxOZaD6gjBCzE1rN1dh1oNpSfYv/rWtOoRZjepQWJCHfxU1ODQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T11:31:21.817915Z"},"content_sha256":"db7f8e118a9d7ac7877ad0503661d889b0ea4e1e77c9e3eeb41e0c8d16cd687f","schema_version":"1.0","event_id":"sha256:db7f8e118a9d7ac7877ad0503661d889b0ea4e1e77c9e3eeb41e0c8d16cd687f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:UVH2DQX5N2HWS5TTYVUFSIM7SK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Are Powerful Graph Neural Nets Necessary? A Dissection on Graph Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Song Bian, Ting Chen, Yizhou Sun","submitted_at":"2019-05-11T19:47:19Z","abstract_excerpt":"Graph Neural Nets (GNNs) have received increasing attentions, partially due to their superior performance in many node and graph classification tasks. However, there is a lack of understanding on what they are learning and how sophisticated the learned graph functions are. In this work, we propose a dissection of GNNs on graph classification into two parts: 1) the graph filtering, where graph-based neighbor aggregations are performed, and 2) the set function, where a set of hidden node features are composed for prediction. To study the importance of both parts, we propose to linearize them sep"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04579","kind":"arxiv","version":3},"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/1905.04579/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"},"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-07-05T01:08:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OQzN4tX6MIeT0KP6V3AC4/SfTSPbl8jkN08/4fkyHIfcBAENLtW0KJwFYnPz0DS+7ANE+qYNb4cQ71UGfeAOAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T11:31:21.818852Z"},"content_sha256":"80ce81d95e2bca2ec1cd3889b8d78bc687a85a7304ca1d52a81dfeb11731175a","schema_version":"1.0","event_id":"sha256:80ce81d95e2bca2ec1cd3889b8d78bc687a85a7304ca1d52a81dfeb11731175a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UVH2DQX5N2HWS5TTYVUFSIM7SK/bundle.json","state_url":"https://pith.science/pith/UVH2DQX5N2HWS5TTYVUFSIM7SK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UVH2DQX5N2HWS5TTYVUFSIM7SK/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-08-12T11:31:21Z","links":{"resolver":"https://pith.science/pith/UVH2DQX5N2HWS5TTYVUFSIM7SK","bundle":"https://pith.science/pith/UVH2DQX5N2HWS5TTYVUFSIM7SK/bundle.json","state":"https://pith.science/pith/UVH2DQX5N2HWS5TTYVUFSIM7SK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UVH2DQX5N2HWS5TTYVUFSIM7SK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UVH2DQX5N2HWS5TTYVUFSIM7SK","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":"2aae453ebc93511bceb4879790aa393ac6a1010ea3ee2582c03b9199c844d9a2","cross_cats_sorted":["cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-11T19:47:19Z","title_canon_sha256":"8d729d7264f152f7926458d9f9fdc9cdafa26cb0b45e539b15b147f0136f1f8e"},"schema_version":"1.0","source":{"id":"1905.04579","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04579","created_at":"2026-07-05T01:08:59Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04579v3","created_at":"2026-07-05T01:08:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04579","created_at":"2026-07-05T01:08:59Z"},{"alias_kind":"pith_short_12","alias_value":"UVH2DQX5N2HW","created_at":"2026-07-05T01:08:59Z"},{"alias_kind":"pith_short_16","alias_value":"UVH2DQX5N2HWS5TT","created_at":"2026-07-05T01:08:59Z"},{"alias_kind":"pith_short_8","alias_value":"UVH2DQX5","created_at":"2026-07-05T01:08:59Z"}],"graph_snapshots":[{"event_id":"sha256:80ce81d95e2bca2ec1cd3889b8d78bc687a85a7304ca1d52a81dfeb11731175a","target":"graph","created_at":"2026-07-05T01:08:59Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1905.04579/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph Neural Nets (GNNs) have received increasing attentions, partially due to their superior performance in many node and graph classification tasks. However, there is a lack of understanding on what they are learning and how sophisticated the learned graph functions are. In this work, we propose a dissection of GNNs on graph classification into two parts: 1) the graph filtering, where graph-based neighbor aggregations are performed, and 2) the set function, where a set of hidden node features are composed for prediction. To study the importance of both parts, we propose to linearize them sep","authors_text":"Song Bian, Ting Chen, Yizhou Sun","cross_cats":["cs.SI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-11T19:47:19Z","title":"Are Powerful Graph Neural Nets Necessary? A Dissection on Graph Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04579","kind":"arxiv","version":3},"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:db7f8e118a9d7ac7877ad0503661d889b0ea4e1e77c9e3eeb41e0c8d16cd687f","target":"record","created_at":"2026-07-05T01:08:59Z","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":"2aae453ebc93511bceb4879790aa393ac6a1010ea3ee2582c03b9199c844d9a2","cross_cats_sorted":["cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-11T19:47:19Z","title_canon_sha256":"8d729d7264f152f7926458d9f9fdc9cdafa26cb0b45e539b15b147f0136f1f8e"},"schema_version":"1.0","source":{"id":"1905.04579","kind":"arxiv","version":3}},"canonical_sha256":"a54fa1c2fd6e8f697673c56859219f92992879062607d56a9a30a3e8b59826b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a54fa1c2fd6e8f697673c56859219f92992879062607d56a9a30a3e8b59826b2","first_computed_at":"2026-07-05T01:08:59.431018Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:08:59.431018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6jMJHbBmEA/nQDi5RSbaOrpgKkL5cp4L765xFSp6Rdn8/b7OYxg83UGPE1CnPqn+SRHFUY+j659Xd9j1LmmnCg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:08:59.431455Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.04579","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db7f8e118a9d7ac7877ad0503661d889b0ea4e1e77c9e3eeb41e0c8d16cd687f","sha256:80ce81d95e2bca2ec1cd3889b8d78bc687a85a7304ca1d52a81dfeb11731175a"],"state_sha256":"b2a510ce94bc4e891ca20bf97f219141d68f6b8cc06320b63b375a6a2092c662"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q15XO82k/td0hfjW5Lw/PuoWtae3/aMkfOYdAJiiNZwFV7PUN3q64x70FphkEJZmoArHluv66h6RkzkAaEebCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T11:31:21.824957Z","bundle_sha256":"d564df856a3f6fa1bee91f825f1f90e4a2b1ca9ac19c325044cd7597d65640ab"}}