{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:L3RAPZ4FQMFE4PKRAQLQBZSBS2","short_pith_number":"pith:L3RAPZ4F","schema_version":"1.0","canonical_sha256":"5ee207e785830a4e3d51041700e64196b287a830d1fa8a10f2a6e0cf769fc2bf","source":{"kind":"arxiv","id":"2404.11568","version":4},"attestation_state":"computed","paper":{"title":"On the Scalability of GNNs for Molecular Graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dominique Beaini, Farimah Poursafaei, Frederik Wenkel, Karush Suri, Maciej Sypetkowski, Nia Dickson, Philip Fradkin","submitted_at":"2024-04-17T17:11:31Z","abstract_excerpt":"Scaling deep learning models has been at the heart of recent revolutions in language modelling and image generation. Practitioners have observed a strong relationship between model size, dataset size, and performance. However, structure-based architectures such as Graph Neural Networks (GNNs) are yet to show the benefits of scale mainly due to the lower efficiency of sparse operations, large data requirements, and lack of clarity about the effectiveness of various architectures. We address this drawback of GNNs by studying their scaling behavior. Specifically, we analyze message-passing networ"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2404.11568","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2024-04-17T17:11:31Z","cross_cats_sorted":[],"title_canon_sha256":"8e61e822600a5dfb8b893aa853586b39ba1dd781fd72d7be38e7739c148b8210","abstract_canon_sha256":"943405c94e9c79bda5c01e78048b750b7caeaffe8ab5d70eba5d86b48a3532f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:05:35.097979Z","signature_b64":"XLO4vOiNbGKNQC6HaFTPSKvBU1tIJv/HS3xru8lZbi279/+JwTTRLRnYMCv5a78Nwj2t4SWPYzxF1oShXoHpAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ee207e785830a4e3d51041700e64196b287a830d1fa8a10f2a6e0cf769fc2bf","last_reissued_at":"2026-07-05T09:05:35.097482Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:05:35.097482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Scalability of GNNs for Molecular Graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dominique Beaini, Farimah Poursafaei, Frederik Wenkel, Karush Suri, Maciej Sypetkowski, Nia Dickson, Philip Fradkin","submitted_at":"2024-04-17T17:11:31Z","abstract_excerpt":"Scaling deep learning models has been at the heart of recent revolutions in language modelling and image generation. Practitioners have observed a strong relationship between model size, dataset size, and performance. However, structure-based architectures such as Graph Neural Networks (GNNs) are yet to show the benefits of scale mainly due to the lower efficiency of sparse operations, large data requirements, and lack of clarity about the effectiveness of various architectures. We address this drawback of GNNs by studying their scaling behavior. Specifically, we analyze message-passing networ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.11568","kind":"arxiv","version":4},"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/2404.11568/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2404.11568","created_at":"2026-07-05T09:05:35.097543+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.11568v4","created_at":"2026-07-05T09:05:35.097543+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.11568","created_at":"2026-07-05T09:05:35.097543+00:00"},{"alias_kind":"pith_short_12","alias_value":"L3RAPZ4FQMFE","created_at":"2026-07-05T09:05:35.097543+00:00"},{"alias_kind":"pith_short_16","alias_value":"L3RAPZ4FQMFE4PKR","created_at":"2026-07-05T09:05:35.097543+00:00"},{"alias_kind":"pith_short_8","alias_value":"L3RAPZ4F","created_at":"2026-07-05T09:05:35.097543+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.13262","citing_title":"Chem-GMNet: A Sphere-Native Geometric Transformer for Molecular Property Prediction","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10722","citing_title":"On Improving Graph Neural Networks for QSAR by Pre-training on Extended-Connectivity Fingerprints","ref_index":53,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L3RAPZ4FQMFE4PKRAQLQBZSBS2","json":"https://pith.science/pith/L3RAPZ4FQMFE4PKRAQLQBZSBS2.json","graph_json":"https://pith.science/api/pith-number/L3RAPZ4FQMFE4PKRAQLQBZSBS2/graph.json","events_json":"https://pith.science/api/pith-number/L3RAPZ4FQMFE4PKRAQLQBZSBS2/events.json","paper":"https://pith.science/paper/L3RAPZ4F"},"agent_actions":{"view_html":"https://pith.science/pith/L3RAPZ4FQMFE4PKRAQLQBZSBS2","download_json":"https://pith.science/pith/L3RAPZ4FQMFE4PKRAQLQBZSBS2.json","view_paper":"https://pith.science/paper/L3RAPZ4F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.11568&json=true","fetch_graph":"https://pith.science/api/pith-number/L3RAPZ4FQMFE4PKRAQLQBZSBS2/graph.json","fetch_events":"https://pith.science/api/pith-number/L3RAPZ4FQMFE4PKRAQLQBZSBS2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L3RAPZ4FQMFE4PKRAQLQBZSBS2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L3RAPZ4FQMFE4PKRAQLQBZSBS2/action/storage_attestation","attest_author":"https://pith.science/pith/L3RAPZ4FQMFE4PKRAQLQBZSBS2/action/author_attestation","sign_citation":"https://pith.science/pith/L3RAPZ4FQMFE4PKRAQLQBZSBS2/action/citation_signature","submit_replication":"https://pith.science/pith/L3RAPZ4FQMFE4PKRAQLQBZSBS2/action/replication_record"}},"created_at":"2026-07-05T09:05:35.097543+00:00","updated_at":"2026-07-05T09:05:35.097543+00:00"}