{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:KWAHBRM7BN5MUJRPYAJ5KTYFWL","short_pith_number":"pith:KWAHBRM7","canonical_record":{"source":{"id":"2605.13597","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T14:32:46Z","cross_cats_sorted":[],"title_canon_sha256":"b1b19cc5f3c0b0434bccc9d834d75428b5ab2a9e7e018b93f2d10676b4754ea5","abstract_canon_sha256":"329373dee28472628ba5f1452fb6c598137acf030ef3ef7708fb9127e2790799"},"schema_version":"1.0"},"canonical_sha256":"558070c59f0b7aca262fc013d54f05b2f5eab7a3dc946b64195e7e520eeeb6d6","source":{"kind":"arxiv","id":"2605.13597","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13597","created_at":"2026-05-18T02:44:22Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13597v1","created_at":"2026-05-18T02:44:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13597","created_at":"2026-05-18T02:44:22Z"},{"alias_kind":"pith_short_12","alias_value":"KWAHBRM7BN5M","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"KWAHBRM7BN5MUJRP","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"KWAHBRM7","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:KWAHBRM7BN5MUJRPYAJ5KTYFWL","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13597","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T14:32:46Z","cross_cats_sorted":[],"title_canon_sha256":"b1b19cc5f3c0b0434bccc9d834d75428b5ab2a9e7e018b93f2d10676b4754ea5","abstract_canon_sha256":"329373dee28472628ba5f1452fb6c598137acf030ef3ef7708fb9127e2790799"},"schema_version":"1.0"},"canonical_sha256":"558070c59f0b7aca262fc013d54f05b2f5eab7a3dc946b64195e7e520eeeb6d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:22.993739Z","signature_b64":"5OdtU/iZ0pNIEtv5qwmD62RF+K7g8E+Uw8a1RbIKzPakwSUV/mThvG0fdRsWNybuIQYknyxAH0KJ9GORaiK5Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"558070c59f0b7aca262fc013d54f05b2f5eab7a3dc946b64195e7e520eeeb6d6","last_reissued_at":"2026-05-18T02:44:22.993265Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:22.993265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13597","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-18T02:44:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fI5AFGXpjGatMQTNea38mk6B84o8wTwU+Z2NyhsJ7nAjEy/W64x/pBzq3cDSoBftglrINKqXpCbqUC5qWjVHBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:02:33.613789Z"},"content_sha256":"28ad3347a13db63aa17566761f5206c4948a4718128f404b19e4a5341440d3b0","schema_version":"1.0","event_id":"sha256:28ad3347a13db63aa17566761f5206c4948a4718128f404b19e4a5341440d3b0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:KWAHBRM7BN5MUJRPYAJ5KTYFWL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rethinking Generalization in Graph Neural Networks: A Structural Complexity Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"More edges in a graph make GNN input representations overly accommodating to the model and induce overfitting.","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jiye Liang, Liang Bai, Peiyao Wang, Richard Yi Da Xu, Xian Yang","submitted_at":"2026-05-13T14:32:46Z","abstract_excerpt":"Graph neural networks (GNNs) have emerged as a fundamental tool for learning from graph-structured data, achieving strong performance across a wide range of applications. However, understanding their generalization capabilities remains challenging due to the complex structural dependencies inherent in such data. Existing generalization analyses largely follow the classical machine learning paradigm, focusing primarily on model complexity while overlooking the fundamental role of graph structure. Therefore, in this work, we systematically investigate this role by asking: does the graph structur"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"we theoretically prove that incorporating more edges into the prediction process transforms the input representations to be overly accommodating to the output model, thereby inducing overfitting... GNN generalization depends explicitly on structural complexity, alongside traditional parameter-dependent factors.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the number of effective edges (as defined in the structural complexity measure) is the dominant structural factor controlling generalization and that the Rademacher bound derived from it remains meaningful after the proposed regularization is applied.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"GNN generalization depends explicitly on graph structural complexity measured by effective edges, with a new regularization method shown to balance underfitting and overfitting.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"More edges in a graph make GNN input representations overly accommodating to the model and induce overfitting.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"8394638af81e9f4cb8ae8a6f2cc57b3c46cfa5c896c1e54b5015100ccb1c7f4e"},"source":{"id":"2605.13597","kind":"arxiv","version":1},"verdict":{"id":"ee04d74d-d8d3-4043-ae85-51ca41f4f399","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T19:40:30.850593Z","strongest_claim":"we theoretically prove that incorporating more edges into the prediction process transforms the input representations to be overly accommodating to the output model, thereby inducing overfitting... GNN generalization depends explicitly on structural complexity, alongside traditional parameter-dependent factors.","one_line_summary":"GNN generalization depends explicitly on graph structural complexity measured by effective edges, with a new regularization method shown to balance underfitting and overfitting.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the number of effective edges (as defined in the structural complexity measure) is the dominant structural factor controlling generalization and that the Rademacher bound derived from it remains meaningful after the proposed regularization is applied.","pith_extraction_headline":"More edges in a graph make GNN input representations overly accommodating to the model and induce overfitting."},"references":{"count":61,"sample":[{"doi":"","year":null,"title":"Journal of Machine Learning Research , volume=","work_id":"2243b6d9-ded6-47a2-b296-75de96ce7d57","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Proceedings of the Thirty-Ninth AAAI Conference on Artificial Intelligence , volume=","work_id":"3475faff-3f96-44b1-9a77-46d4e8c3a46a","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Journal of Machine Learning Research , volume=","work_id":"9cc583a8-db09-4dba-98bd-684897cb7241","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Proceedings of the Thirty-First ACM SIGKDD Conference on Knowledge Discovery and Data Mining , pages=","work_id":"53950890-64fa-43b6-9e85-b9ab7bc41092","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Proceedings of the Thirty-Ninth AAAI Conference on Artificial Intelligence , volume=","work_id":"a916e0d9-d82d-4eab-a827-ad0d35843ef5","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":61,"snapshot_sha256":"74712fc57889350a2e81f73a9d7557ed6dea2a4eb8d23291546a25da9377f612","internal_anchors":2},"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":"ee04d74d-d8d3-4043-ae85-51ca41f4f399"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:44:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CkZLiobeiHa7pN/c1TeDmq0oehJJWcV3jCp2t194dhmqhkM2Ds7Cg8yHm6y7JCQR8pA9/FpAxgcoza334DavCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:02:33.614656Z"},"content_sha256":"f49f5ec9d597b530c8508da7e10d450d78a7a777d93d476f99abeb192c6e43b0","schema_version":"1.0","event_id":"sha256:f49f5ec9d597b530c8508da7e10d450d78a7a777d93d476f99abeb192c6e43b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KWAHBRM7BN5MUJRPYAJ5KTYFWL/bundle.json","state_url":"https://pith.science/pith/KWAHBRM7BN5MUJRPYAJ5KTYFWL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KWAHBRM7BN5MUJRPYAJ5KTYFWL/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-05-25T12:02:33Z","links":{"resolver":"https://pith.science/pith/KWAHBRM7BN5MUJRPYAJ5KTYFWL","bundle":"https://pith.science/pith/KWAHBRM7BN5MUJRPYAJ5KTYFWL/bundle.json","state":"https://pith.science/pith/KWAHBRM7BN5MUJRPYAJ5KTYFWL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KWAHBRM7BN5MUJRPYAJ5KTYFWL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:KWAHBRM7BN5MUJRPYAJ5KTYFWL","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":"329373dee28472628ba5f1452fb6c598137acf030ef3ef7708fb9127e2790799","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T14:32:46Z","title_canon_sha256":"b1b19cc5f3c0b0434bccc9d834d75428b5ab2a9e7e018b93f2d10676b4754ea5"},"schema_version":"1.0","source":{"id":"2605.13597","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13597","created_at":"2026-05-18T02:44:22Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13597v1","created_at":"2026-05-18T02:44:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13597","created_at":"2026-05-18T02:44:22Z"},{"alias_kind":"pith_short_12","alias_value":"KWAHBRM7BN5M","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"KWAHBRM7BN5MUJRP","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"KWAHBRM7","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:f49f5ec9d597b530c8508da7e10d450d78a7a777d93d476f99abeb192c6e43b0","target":"graph","created_at":"2026-05-18T02:44: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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"we theoretically prove that incorporating more edges into the prediction process transforms the input representations to be overly accommodating to the output model, thereby inducing overfitting... GNN generalization depends explicitly on structural complexity, alongside traditional parameter-dependent factors."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the number of effective edges (as defined in the structural complexity measure) is the dominant structural factor controlling generalization and that the Rademacher bound derived from it remains meaningful after the proposed regularization is applied."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"GNN generalization depends explicitly on graph structural complexity measured by effective edges, with a new regularization method shown to balance underfitting and overfitting."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"More edges in a graph make GNN input representations overly accommodating to the model and induce overfitting."}],"snapshot_sha256":"8394638af81e9f4cb8ae8a6f2cc57b3c46cfa5c896c1e54b5015100ccb1c7f4e"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Graph neural networks (GNNs) have emerged as a fundamental tool for learning from graph-structured data, achieving strong performance across a wide range of applications. However, understanding their generalization capabilities remains challenging due to the complex structural dependencies inherent in such data. Existing generalization analyses largely follow the classical machine learning paradigm, focusing primarily on model complexity while overlooking the fundamental role of graph structure. Therefore, in this work, we systematically investigate this role by asking: does the graph structur","authors_text":"Jiye Liang, Liang Bai, Peiyao Wang, Richard Yi Da Xu, Xian Yang","cross_cats":[],"headline":"More edges in a graph make GNN input representations overly accommodating to the model and induce overfitting.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T14:32:46Z","title":"Rethinking Generalization in Graph Neural Networks: A Structural Complexity Perspective"},"references":{"count":61,"internal_anchors":2,"resolved_work":61,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Journal of Machine Learning Research , volume=","work_id":"2243b6d9-ded6-47a2-b296-75de96ce7d57","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Proceedings of the Thirty-Ninth AAAI Conference on Artificial Intelligence , volume=","work_id":"3475faff-3f96-44b1-9a77-46d4e8c3a46a","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Journal of Machine Learning Research , volume=","work_id":"9cc583a8-db09-4dba-98bd-684897cb7241","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Proceedings of the Thirty-First ACM SIGKDD Conference on Knowledge Discovery and Data Mining , pages=","work_id":"53950890-64fa-43b6-9e85-b9ab7bc41092","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Proceedings of the Thirty-Ninth AAAI Conference on Artificial Intelligence , volume=","work_id":"a916e0d9-d82d-4eab-a827-ad0d35843ef5","year":null}],"snapshot_sha256":"74712fc57889350a2e81f73a9d7557ed6dea2a4eb8d23291546a25da9377f612"},"source":{"id":"2605.13597","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T19:40:30.850593Z","id":"ee04d74d-d8d3-4043-ae85-51ca41f4f399","model_set":{"reader":"grok-4.3"},"one_line_summary":"GNN generalization depends explicitly on graph structural complexity measured by effective edges, with a new regularization method shown to balance underfitting and overfitting.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"More edges in a graph make GNN input representations overly accommodating to the model and induce overfitting.","strongest_claim":"we theoretically prove that incorporating more edges into the prediction process transforms the input representations to be overly accommodating to the output model, thereby inducing overfitting... GNN generalization depends explicitly on structural complexity, alongside traditional parameter-dependent factors.","weakest_assumption":"That the number of effective edges (as defined in the structural complexity measure) is the dominant structural factor controlling generalization and that the Rademacher bound derived from it remains meaningful after the proposed regularization is applied."}},"verdict_id":"ee04d74d-d8d3-4043-ae85-51ca41f4f399"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:28ad3347a13db63aa17566761f5206c4948a4718128f404b19e4a5341440d3b0","target":"record","created_at":"2026-05-18T02:44: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":"329373dee28472628ba5f1452fb6c598137acf030ef3ef7708fb9127e2790799","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T14:32:46Z","title_canon_sha256":"b1b19cc5f3c0b0434bccc9d834d75428b5ab2a9e7e018b93f2d10676b4754ea5"},"schema_version":"1.0","source":{"id":"2605.13597","kind":"arxiv","version":1}},"canonical_sha256":"558070c59f0b7aca262fc013d54f05b2f5eab7a3dc946b64195e7e520eeeb6d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"558070c59f0b7aca262fc013d54f05b2f5eab7a3dc946b64195e7e520eeeb6d6","first_computed_at":"2026-05-18T02:44:22.993265Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:22.993265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5OdtU/iZ0pNIEtv5qwmD62RF+K7g8E+Uw8a1RbIKzPakwSUV/mThvG0fdRsWNybuIQYknyxAH0KJ9GORaiK5Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:22.993739Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13597","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:28ad3347a13db63aa17566761f5206c4948a4718128f404b19e4a5341440d3b0","sha256:f49f5ec9d597b530c8508da7e10d450d78a7a777d93d476f99abeb192c6e43b0"],"state_sha256":"669bd91b7aba45ca78e5a1ef623df0e48e0d409ca462e3eb49018343f50717e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZWaoa/DyK5ROm5vf5q8vWb1cTfFGZyD6IjZK+S7tk8dat8XfxJhdax0N3oZjw3asWX0uwx7I6pDmy4sywG6rBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T12:02:33.618437Z","bundle_sha256":"69773817406be9d680b17f5cfdf462642b37486532e6dba550d3f0331ee6c0d7"}}