{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:74DTPCMPUDF6M6LLD5CF73RSJC","short_pith_number":"pith:74DTPCMP","canonical_record":{"source":{"id":"2508.14338","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-08-20T01:26:56Z","cross_cats_sorted":[],"title_canon_sha256":"59f8c9652d111e7b224c56d711bd49fc86acc578e5245655e5180b64e8dbb37b","abstract_canon_sha256":"afb82f030bba75e30e1e91e9a695f88b5720242645ee3c1fdb1f7afe3510b376"},"schema_version":"1.0"},"canonical_sha256":"ff0737898fa0cbe6796b1f445fee3248a485a7e9b7a1b06a0ebb833d93dab98a","source":{"kind":"arxiv","id":"2508.14338","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.14338","created_at":"2026-07-05T11:56:30Z"},{"alias_kind":"arxiv_version","alias_value":"2508.14338v1","created_at":"2026-07-05T11:56:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.14338","created_at":"2026-07-05T11:56:30Z"},{"alias_kind":"pith_short_12","alias_value":"74DTPCMPUDF6","created_at":"2026-07-05T11:56:30Z"},{"alias_kind":"pith_short_16","alias_value":"74DTPCMPUDF6M6LL","created_at":"2026-07-05T11:56:30Z"},{"alias_kind":"pith_short_8","alias_value":"74DTPCMP","created_at":"2026-07-05T11:56:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:74DTPCMPUDF6M6LLD5CF73RSJC","target":"record","payload":{"canonical_record":{"source":{"id":"2508.14338","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-08-20T01:26:56Z","cross_cats_sorted":[],"title_canon_sha256":"59f8c9652d111e7b224c56d711bd49fc86acc578e5245655e5180b64e8dbb37b","abstract_canon_sha256":"afb82f030bba75e30e1e91e9a695f88b5720242645ee3c1fdb1f7afe3510b376"},"schema_version":"1.0"},"canonical_sha256":"ff0737898fa0cbe6796b1f445fee3248a485a7e9b7a1b06a0ebb833d93dab98a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:56:30.056109Z","signature_b64":"CU1qemLI+x3ldI4C0nl6d1hbm7kUxr91NzSLC6/jfx4IhLAZ7nT1gZaxYpSNhd9J0QKR7t+2tQxNKLaL0GeWBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff0737898fa0cbe6796b1f445fee3248a485a7e9b7a1b06a0ebb833d93dab98a","last_reissued_at":"2026-07-05T11:56:30.055685Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:56:30.055685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.14338","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-05T11:56:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5RBTXoGL1S/cTk8B3dekL6nc0S1Yx48Nw88qDKgOtn46tkVHmpT0f7i/aX9RCNoyySPfdqgI8FX43uLgEnvuBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T07:57:23.827763Z"},"content_sha256":"08219ef1d44366bc9d50fad22987005fdc9f6c3a465efc4a90670fcc87425445","schema_version":"1.0","event_id":"sha256:08219ef1d44366bc9d50fad22987005fdc9f6c3a465efc4a90670fcc87425445"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:74DTPCMPUDF6M6LLD5CF73RSJC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Interplay between Graph Structure and Learning Algorithms in Graph Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chuan Wu, Junwei Su","submitted_at":"2025-08-20T01:26:56Z","abstract_excerpt":"This paper studies the interplay between learning algorithms and graph structure for graph neural networks (GNNs). Existing theoretical studies on the learning dynamics of GNNs primarily focus on the convergence rates of learning algorithms under the interpolation regime (noise-free) and offer only a crude connection between these dynamics and the actual graph structure (e.g., maximum degree). This paper aims to bridge this gap by investigating the excessive risk (generalization performance) of learning algorithms in GNNs within the generalization regime (with noise). Specifically, we extend t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.14338","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/2508.14338/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-05T11:56:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GPQG3gmK3rZt8NF+ydpYLqk4wpKUI1jK8W9JiA1oY8MiyjZXQcfB520Qe9ADjLOe4b6IbBzcZ9DIAXeJ95/2Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T07:57:23.828738Z"},"content_sha256":"204e341763bf48480a88d106de953b1a784ffcc8ce4951bf28823306dcf2a6cd","schema_version":"1.0","event_id":"sha256:204e341763bf48480a88d106de953b1a784ffcc8ce4951bf28823306dcf2a6cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/74DTPCMPUDF6M6LLD5CF73RSJC/bundle.json","state_url":"https://pith.science/pith/74DTPCMPUDF6M6LLD5CF73RSJC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/74DTPCMPUDF6M6LLD5CF73RSJC/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-07T07:57:23Z","links":{"resolver":"https://pith.science/pith/74DTPCMPUDF6M6LLD5CF73RSJC","bundle":"https://pith.science/pith/74DTPCMPUDF6M6LLD5CF73RSJC/bundle.json","state":"https://pith.science/pith/74DTPCMPUDF6M6LLD5CF73RSJC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/74DTPCMPUDF6M6LLD5CF73RSJC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:74DTPCMPUDF6M6LLD5CF73RSJC","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":"afb82f030bba75e30e1e91e9a695f88b5720242645ee3c1fdb1f7afe3510b376","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-08-20T01:26:56Z","title_canon_sha256":"59f8c9652d111e7b224c56d711bd49fc86acc578e5245655e5180b64e8dbb37b"},"schema_version":"1.0","source":{"id":"2508.14338","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.14338","created_at":"2026-07-05T11:56:30Z"},{"alias_kind":"arxiv_version","alias_value":"2508.14338v1","created_at":"2026-07-05T11:56:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.14338","created_at":"2026-07-05T11:56:30Z"},{"alias_kind":"pith_short_12","alias_value":"74DTPCMPUDF6","created_at":"2026-07-05T11:56:30Z"},{"alias_kind":"pith_short_16","alias_value":"74DTPCMPUDF6M6LL","created_at":"2026-07-05T11:56:30Z"},{"alias_kind":"pith_short_8","alias_value":"74DTPCMP","created_at":"2026-07-05T11:56:30Z"}],"graph_snapshots":[{"event_id":"sha256:204e341763bf48480a88d106de953b1a784ffcc8ce4951bf28823306dcf2a6cd","target":"graph","created_at":"2026-07-05T11:56:30Z","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/2508.14338/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper studies the interplay between learning algorithms and graph structure for graph neural networks (GNNs). Existing theoretical studies on the learning dynamics of GNNs primarily focus on the convergence rates of learning algorithms under the interpolation regime (noise-free) and offer only a crude connection between these dynamics and the actual graph structure (e.g., maximum degree). This paper aims to bridge this gap by investigating the excessive risk (generalization performance) of learning algorithms in GNNs within the generalization regime (with noise). Specifically, we extend t","authors_text":"Chuan Wu, Junwei Su","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-08-20T01:26:56Z","title":"On the Interplay between Graph Structure and Learning Algorithms in Graph Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.14338","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:08219ef1d44366bc9d50fad22987005fdc9f6c3a465efc4a90670fcc87425445","target":"record","created_at":"2026-07-05T11:56:30Z","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":"afb82f030bba75e30e1e91e9a695f88b5720242645ee3c1fdb1f7afe3510b376","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-08-20T01:26:56Z","title_canon_sha256":"59f8c9652d111e7b224c56d711bd49fc86acc578e5245655e5180b64e8dbb37b"},"schema_version":"1.0","source":{"id":"2508.14338","kind":"arxiv","version":1}},"canonical_sha256":"ff0737898fa0cbe6796b1f445fee3248a485a7e9b7a1b06a0ebb833d93dab98a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff0737898fa0cbe6796b1f445fee3248a485a7e9b7a1b06a0ebb833d93dab98a","first_computed_at":"2026-07-05T11:56:30.055685Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:56:30.055685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CU1qemLI+x3ldI4C0nl6d1hbm7kUxr91NzSLC6/jfx4IhLAZ7nT1gZaxYpSNhd9J0QKR7t+2tQxNKLaL0GeWBA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:56:30.056109Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.14338","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:08219ef1d44366bc9d50fad22987005fdc9f6c3a465efc4a90670fcc87425445","sha256:204e341763bf48480a88d106de953b1a784ffcc8ce4951bf28823306dcf2a6cd"],"state_sha256":"a740a19e3d62936382b6c6e2ff5ff8ee8ede13e46800b299a7cdec069788b45d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RxiM1XcuapSJ6Mt+VawBfOmQ3o15aVT5rXkW83+68Rf1j96j6KXaa9SDe0f0QYT/wuJ8qsALeRCeWCzj94twAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T07:57:23.834975Z","bundle_sha256":"679b4353b5fb568b96768d6c45ab7d9098132d4119abcd5ed3e892abc6f0dbd7"}}