{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:5LMW5UWAYVGK2UZIJCGUBYRU3C","short_pith_number":"pith:5LMW5UWA","canonical_record":{"source":{"id":"2103.06857","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-03-11T18:38:37Z","cross_cats_sorted":[],"title_canon_sha256":"201c7cb3a3db1ff887e9d4137758a6e307a2ea2250dd47007bacc868e6a7181f","abstract_canon_sha256":"5489b658f1443f1b7032655689b3ed2c47451568d31d4edbe2c267fceafed475"},"schema_version":"1.0"},"canonical_sha256":"ead96ed2c0c54cad5328488d40e234d8af3822920fb1035ea72712d066973a74","source":{"kind":"arxiv","id":"2103.06857","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.06857","created_at":"2026-07-05T02:22:19Z"},{"alias_kind":"arxiv_version","alias_value":"2103.06857v1","created_at":"2026-07-05T02:22:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.06857","created_at":"2026-07-05T02:22:19Z"},{"alias_kind":"pith_short_12","alias_value":"5LMW5UWAYVGK","created_at":"2026-07-05T02:22:19Z"},{"alias_kind":"pith_short_16","alias_value":"5LMW5UWAYVGK2UZI","created_at":"2026-07-05T02:22:19Z"},{"alias_kind":"pith_short_8","alias_value":"5LMW5UWA","created_at":"2026-07-05T02:22:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:5LMW5UWAYVGK2UZIJCGUBYRU3C","target":"record","payload":{"canonical_record":{"source":{"id":"2103.06857","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-03-11T18:38:37Z","cross_cats_sorted":[],"title_canon_sha256":"201c7cb3a3db1ff887e9d4137758a6e307a2ea2250dd47007bacc868e6a7181f","abstract_canon_sha256":"5489b658f1443f1b7032655689b3ed2c47451568d31d4edbe2c267fceafed475"},"schema_version":"1.0"},"canonical_sha256":"ead96ed2c0c54cad5328488d40e234d8af3822920fb1035ea72712d066973a74","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:22:19.777450Z","signature_b64":"QHW/kRa6uZJ7P57pOq3v2f9UdA41zMhg9NPx/l8L+l0ZCOC9ocvogMtWXSvrt9t8oUPy5KMGydjBM+s+54/7DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ead96ed2c0c54cad5328488d40e234d8af3822920fb1035ea72712d066973a74","last_reissued_at":"2026-07-05T02:22:19.777072Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:22:19.777072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2103.06857","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-07-05T02:22:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uLI+9YOUcQgBXT9ER4rxbFQuBVM1fw3cIMk7XmF0VgP0vhv35cAgyP/napwaEfh5j5KNdrVPY0/fkH6Rp2FyDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T00:13:28.830904Z"},"content_sha256":"b62798bc17e286413cb64fce4814710597c7d96c43a1d0dd4a46488ae7b3d85b","schema_version":"1.0","event_id":"sha256:b62798bc17e286413cb64fce4814710597c7d96c43a1d0dd4a46488ae7b3d85b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:5LMW5UWAYVGK2UZIJCGUBYRU3C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Should Graph Neural Networks Use Features, Edges, Or Both?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Lukas Faber, Roger Wattenhofer, Yifan Lu","submitted_at":"2021-03-11T18:38:37Z","abstract_excerpt":"Graph Neural Networks (GNNs) are the first choice for learning algorithms on graph data. GNNs promise to integrate (i) node features as well as (ii) edge information in an end-to-end learning algorithm. How does this promise work out practically? In this paper, we study to what extend GNNs are necessary to solve prominent graph classification problems. We find that for graph classification, a GNN is not more than the sum of its parts. We also find that, unlike features, predictions with an edge-only model do not always transfer to GNNs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.06857","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2103.06857/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-05T02:22:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AaDNheJcoDK43QgiHMdCMQEXUtooaKrBk53JWALT2dfEok2QyK2OTIYeiOAw7sjNglNjSj22o3Rv3tAwlewVBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T00:13:28.831397Z"},"content_sha256":"be2c813664d912aa406982351edca4abeb128b13cc69dd0c9c5350c5050b9f8a","schema_version":"1.0","event_id":"sha256:be2c813664d912aa406982351edca4abeb128b13cc69dd0c9c5350c5050b9f8a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5LMW5UWAYVGK2UZIJCGUBYRU3C/bundle.json","state_url":"https://pith.science/pith/5LMW5UWAYVGK2UZIJCGUBYRU3C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5LMW5UWAYVGK2UZIJCGUBYRU3C/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-07T00:13:28Z","links":{"resolver":"https://pith.science/pith/5LMW5UWAYVGK2UZIJCGUBYRU3C","bundle":"https://pith.science/pith/5LMW5UWAYVGK2UZIJCGUBYRU3C/bundle.json","state":"https://pith.science/pith/5LMW5UWAYVGK2UZIJCGUBYRU3C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5LMW5UWAYVGK2UZIJCGUBYRU3C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:5LMW5UWAYVGK2UZIJCGUBYRU3C","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":"5489b658f1443f1b7032655689b3ed2c47451568d31d4edbe2c267fceafed475","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-03-11T18:38:37Z","title_canon_sha256":"201c7cb3a3db1ff887e9d4137758a6e307a2ea2250dd47007bacc868e6a7181f"},"schema_version":"1.0","source":{"id":"2103.06857","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.06857","created_at":"2026-07-05T02:22:19Z"},{"alias_kind":"arxiv_version","alias_value":"2103.06857v1","created_at":"2026-07-05T02:22:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.06857","created_at":"2026-07-05T02:22:19Z"},{"alias_kind":"pith_short_12","alias_value":"5LMW5UWAYVGK","created_at":"2026-07-05T02:22:19Z"},{"alias_kind":"pith_short_16","alias_value":"5LMW5UWAYVGK2UZI","created_at":"2026-07-05T02:22:19Z"},{"alias_kind":"pith_short_8","alias_value":"5LMW5UWA","created_at":"2026-07-05T02:22:19Z"}],"graph_snapshots":[{"event_id":"sha256:be2c813664d912aa406982351edca4abeb128b13cc69dd0c9c5350c5050b9f8a","target":"graph","created_at":"2026-07-05T02:22:19Z","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/2103.06857/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph Neural Networks (GNNs) are the first choice for learning algorithms on graph data. GNNs promise to integrate (i) node features as well as (ii) edge information in an end-to-end learning algorithm. How does this promise work out practically? In this paper, we study to what extend GNNs are necessary to solve prominent graph classification problems. We find that for graph classification, a GNN is not more than the sum of its parts. We also find that, unlike features, predictions with an edge-only model do not always transfer to GNNs.","authors_text":"Lukas Faber, Roger Wattenhofer, Yifan Lu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-03-11T18:38:37Z","title":"Should Graph Neural Networks Use Features, Edges, Or Both?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.06857","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:b62798bc17e286413cb64fce4814710597c7d96c43a1d0dd4a46488ae7b3d85b","target":"record","created_at":"2026-07-05T02:22:19Z","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":"5489b658f1443f1b7032655689b3ed2c47451568d31d4edbe2c267fceafed475","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-03-11T18:38:37Z","title_canon_sha256":"201c7cb3a3db1ff887e9d4137758a6e307a2ea2250dd47007bacc868e6a7181f"},"schema_version":"1.0","source":{"id":"2103.06857","kind":"arxiv","version":1}},"canonical_sha256":"ead96ed2c0c54cad5328488d40e234d8af3822920fb1035ea72712d066973a74","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ead96ed2c0c54cad5328488d40e234d8af3822920fb1035ea72712d066973a74","first_computed_at":"2026-07-05T02:22:19.777072Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:22:19.777072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QHW/kRa6uZJ7P57pOq3v2f9UdA41zMhg9NPx/l8L+l0ZCOC9ocvogMtWXSvrt9t8oUPy5KMGydjBM+s+54/7DQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:22:19.777450Z","signed_message":"canonical_sha256_bytes"},"source_id":"2103.06857","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b62798bc17e286413cb64fce4814710597c7d96c43a1d0dd4a46488ae7b3d85b","sha256:be2c813664d912aa406982351edca4abeb128b13cc69dd0c9c5350c5050b9f8a"],"state_sha256":"0781424fdb90d3771b2d533a3edd8f03147760c1c8e5d0e278bf84e95c4df27f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AAbICTbpU48Pf1P+EzMnv0G9MQxMQy0ap8iFviTme64RoUxfKWKNRoArA/Z82XmXo3lg5LetGJIeKQarmzmIAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T00:13:28.835383Z","bundle_sha256":"0d3dcf2b4256801df583b8e59b8d59e95a76b668df97f8d171909369c960819f"}}