{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:D2P4YSZ7F5HP54XL2TJ3VNZVCA","short_pith_number":"pith:D2P4YSZ7","canonical_record":{"source":{"id":"2402.02054","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-03T06:17:21Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"10772b651a94f0484e942596972d417a5b73c67c38ab15b6e347e42aca769dc2","abstract_canon_sha256":"afb667625d13f546fb68ae3c21defd78b67e1ca44a73a7641281d3ccd8509f3b"},"schema_version":"1.0"},"canonical_sha256":"1e9fcc4b3f2f4efef2ebd4d3bab735103f596ef366084362f1e5c2cb4947ba71","source":{"kind":"arxiv","id":"2402.02054","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.02054","created_at":"2026-07-05T09:42:22Z"},{"alias_kind":"arxiv_version","alias_value":"2402.02054v3","created_at":"2026-07-05T09:42:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.02054","created_at":"2026-07-05T09:42:22Z"},{"alias_kind":"pith_short_12","alias_value":"D2P4YSZ7F5HP","created_at":"2026-07-05T09:42:22Z"},{"alias_kind":"pith_short_16","alias_value":"D2P4YSZ7F5HP54XL","created_at":"2026-07-05T09:42:22Z"},{"alias_kind":"pith_short_8","alias_value":"D2P4YSZ7","created_at":"2026-07-05T09:42:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:D2P4YSZ7F5HP54XL2TJ3VNZVCA","target":"record","payload":{"canonical_record":{"source":{"id":"2402.02054","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-03T06:17:21Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"10772b651a94f0484e942596972d417a5b73c67c38ab15b6e347e42aca769dc2","abstract_canon_sha256":"afb667625d13f546fb68ae3c21defd78b67e1ca44a73a7641281d3ccd8509f3b"},"schema_version":"1.0"},"canonical_sha256":"1e9fcc4b3f2f4efef2ebd4d3bab735103f596ef366084362f1e5c2cb4947ba71","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:42:22.611611Z","signature_b64":"EwNJOpBBR1hObzeGPTQscB7zJYngin6F3EHAHDD7kHp4zhgLWaONrCQvWVYAH28POJBFdnxSYRn/IwMfAnt8AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e9fcc4b3f2f4efef2ebd4d3bab735103f596ef366084362f1e5c2cb4947ba71","last_reissued_at":"2026-07-05T09:42:22.611110Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:42:22.611110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2402.02054","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-05T09:42:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0B4Yq2iJnLiSkrbPD9n3J1nuYXh7II6tI5BfX1iMK11IlldikbRiUq8G9txnMHaNRAoy4ve5R+nU4gUV6OsQCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T00:14:28.773653Z"},"content_sha256":"6750be344041177ba5ce724354f30dd0bcc2be5e800f216e9870ab4a282f254f","schema_version":"1.0","event_id":"sha256:6750be344041177ba5ce724354f30dd0bcc2be5e800f216e9870ab4a282f254f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:D2P4YSZ7F5HP54XL2TJ3VNZVCA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Neural Scaling Laws on Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Haitao Mao, Jiliang Tang, Jingzhe Liu, Neil Shah, Tong Zhao, Zhikai Chen","submitted_at":"2024-02-03T06:17:21Z","abstract_excerpt":"Deep graph models (e.g., graph neural networks and graph transformers) have become important techniques for leveraging knowledge across various types of graphs. Yet, the neural scaling laws on graphs, i.e., how the performance of deep graph models changes with model and dataset sizes, have not been systematically investigated, casting doubts on the feasibility of achieving large graph models. To fill this gap, we benchmark many graph datasets from different tasks and make an attempt to establish the neural scaling laws on graphs from both model and data perspectives. The model size we investig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.02054","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/2402.02054/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-05T09:42:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0JFNvoVNx2qj+RPOBYmjRoXg9D2tj3XYr+dI7tzB5nhQyX0uqp5wvmcHzXgNQiazfzRGlKbSREGxzD004BFAAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T00:14:28.774278Z"},"content_sha256":"12a4f4e29413f553ea3ca682e920816db943343dcc0fe18a78f24b24b47f4ef0","schema_version":"1.0","event_id":"sha256:12a4f4e29413f553ea3ca682e920816db943343dcc0fe18a78f24b24b47f4ef0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D2P4YSZ7F5HP54XL2TJ3VNZVCA/bundle.json","state_url":"https://pith.science/pith/D2P4YSZ7F5HP54XL2TJ3VNZVCA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D2P4YSZ7F5HP54XL2TJ3VNZVCA/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-10T00:14:28Z","links":{"resolver":"https://pith.science/pith/D2P4YSZ7F5HP54XL2TJ3VNZVCA","bundle":"https://pith.science/pith/D2P4YSZ7F5HP54XL2TJ3VNZVCA/bundle.json","state":"https://pith.science/pith/D2P4YSZ7F5HP54XL2TJ3VNZVCA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D2P4YSZ7F5HP54XL2TJ3VNZVCA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:D2P4YSZ7F5HP54XL2TJ3VNZVCA","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":"afb667625d13f546fb68ae3c21defd78b67e1ca44a73a7641281d3ccd8509f3b","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-03T06:17:21Z","title_canon_sha256":"10772b651a94f0484e942596972d417a5b73c67c38ab15b6e347e42aca769dc2"},"schema_version":"1.0","source":{"id":"2402.02054","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.02054","created_at":"2026-07-05T09:42:22Z"},{"alias_kind":"arxiv_version","alias_value":"2402.02054v3","created_at":"2026-07-05T09:42:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.02054","created_at":"2026-07-05T09:42:22Z"},{"alias_kind":"pith_short_12","alias_value":"D2P4YSZ7F5HP","created_at":"2026-07-05T09:42:22Z"},{"alias_kind":"pith_short_16","alias_value":"D2P4YSZ7F5HP54XL","created_at":"2026-07-05T09:42:22Z"},{"alias_kind":"pith_short_8","alias_value":"D2P4YSZ7","created_at":"2026-07-05T09:42:22Z"}],"graph_snapshots":[{"event_id":"sha256:12a4f4e29413f553ea3ca682e920816db943343dcc0fe18a78f24b24b47f4ef0","target":"graph","created_at":"2026-07-05T09:42:22Z","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/2402.02054/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Deep graph models (e.g., graph neural networks and graph transformers) have become important techniques for leveraging knowledge across various types of graphs. Yet, the neural scaling laws on graphs, i.e., how the performance of deep graph models changes with model and dataset sizes, have not been systematically investigated, casting doubts on the feasibility of achieving large graph models. To fill this gap, we benchmark many graph datasets from different tasks and make an attempt to establish the neural scaling laws on graphs from both model and data perspectives. The model size we investig","authors_text":"Haitao Mao, Jiliang Tang, Jingzhe Liu, Neil Shah, Tong Zhao, Zhikai Chen","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-03T06:17:21Z","title":"Towards Neural Scaling Laws on Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.02054","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:6750be344041177ba5ce724354f30dd0bcc2be5e800f216e9870ab4a282f254f","target":"record","created_at":"2026-07-05T09:42:22Z","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":"afb667625d13f546fb68ae3c21defd78b67e1ca44a73a7641281d3ccd8509f3b","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-03T06:17:21Z","title_canon_sha256":"10772b651a94f0484e942596972d417a5b73c67c38ab15b6e347e42aca769dc2"},"schema_version":"1.0","source":{"id":"2402.02054","kind":"arxiv","version":3}},"canonical_sha256":"1e9fcc4b3f2f4efef2ebd4d3bab735103f596ef366084362f1e5c2cb4947ba71","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1e9fcc4b3f2f4efef2ebd4d3bab735103f596ef366084362f1e5c2cb4947ba71","first_computed_at":"2026-07-05T09:42:22.611110Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:42:22.611110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EwNJOpBBR1hObzeGPTQscB7zJYngin6F3EHAHDD7kHp4zhgLWaONrCQvWVYAH28POJBFdnxSYRn/IwMfAnt8AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:42:22.611611Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.02054","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6750be344041177ba5ce724354f30dd0bcc2be5e800f216e9870ab4a282f254f","sha256:12a4f4e29413f553ea3ca682e920816db943343dcc0fe18a78f24b24b47f4ef0"],"state_sha256":"ce31ae04a3db5c9e09aa3cad6637a06f4c9af8401ea7c89de84d5f82dd966842"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CUl2Uzyhb8W8g1xwC3lenDMeespHDaqidsUuWD/rX2zpl0kxXyzPmuVpgVi98fDp69ONMiy6xZNTfcpyg4qSCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T00:14:28.778033Z","bundle_sha256":"52c0b55ca6946555a753a5ce636e97594c85418333192947dc0f8646b35e3f22"}}