{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:FMNDIMFSPK6577EJHKJH4OMOW7","short_pith_number":"pith:FMNDIMFS","canonical_record":{"source":{"id":"2507.05533","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-07-07T23:10:53Z","cross_cats_sorted":[],"title_canon_sha256":"0756805429d32a1b4dce6124ccd78680d1205d9fbfef63208a19f3a68f56cbcf","abstract_canon_sha256":"b319b9d40fa1466f902624967a9b62a58ccd186de6ad0daa0a6874216914c188"},"schema_version":"1.0"},"canonical_sha256":"2b1a3430b27abddffc893a927e398eb7da4553a6071542a544a1f6a6d9f404d9","source":{"kind":"arxiv","id":"2507.05533","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.05533","created_at":"2026-07-05T11:33:31Z"},{"alias_kind":"arxiv_version","alias_value":"2507.05533v1","created_at":"2026-07-05T11:33:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.05533","created_at":"2026-07-05T11:33:31Z"},{"alias_kind":"pith_short_12","alias_value":"FMNDIMFSPK65","created_at":"2026-07-05T11:33:31Z"},{"alias_kind":"pith_short_16","alias_value":"FMNDIMFSPK6577EJ","created_at":"2026-07-05T11:33:31Z"},{"alias_kind":"pith_short_8","alias_value":"FMNDIMFS","created_at":"2026-07-05T11:33:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:FMNDIMFSPK6577EJHKJH4OMOW7","target":"record","payload":{"canonical_record":{"source":{"id":"2507.05533","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-07-07T23:10:53Z","cross_cats_sorted":[],"title_canon_sha256":"0756805429d32a1b4dce6124ccd78680d1205d9fbfef63208a19f3a68f56cbcf","abstract_canon_sha256":"b319b9d40fa1466f902624967a9b62a58ccd186de6ad0daa0a6874216914c188"},"schema_version":"1.0"},"canonical_sha256":"2b1a3430b27abddffc893a927e398eb7da4553a6071542a544a1f6a6d9f404d9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:33:31.873481Z","signature_b64":"+SKpzTZ/vWKGjXOfro7a3EdRXh0sLQqfm6PK8i9X1jb2AlcqtiWykPCzmkgEhPGj4lquppN+7tqZyGmohTtNAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b1a3430b27abddffc893a927e398eb7da4553a6071542a544a1f6a6d9f404d9","last_reissued_at":"2026-07-05T11:33:31.873018Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:33:31.873018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.05533","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:33:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Zode/BRAPG4EW2AZbEnNWdTdberrB8gnh2V1O+X8TjszWFk1VFM04wrVUgNQiA4UQGjP8pQxQG1yT+C1nXjBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T11:50:19.427984Z"},"content_sha256":"241823a7d224138f17c87c94e205ffef228de106e80dcde15137a23b6deb2ccc","schema_version":"1.0","event_id":"sha256:241823a7d224138f17c87c94e205ffef228de106e80dcde15137a23b6deb2ccc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:FMNDIMFSPK6577EJHKJH4OMOW7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Theoretical Learning Performance of Graph Neural Networks: The Impact of Jumping Connections and Layer-wise Sparsification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Hongkang Li, Jiawei Sun, Meng Wang","submitted_at":"2025-07-07T23:10:53Z","abstract_excerpt":"Jumping connections enable Graph Convolutional Networks (GCNs) to overcome over-smoothing, while graph sparsification reduces computational demands by selecting a sub-matrix of the graph adjacency matrix during neighborhood aggregation. Learning GCNs with graph sparsification has shown empirical success across various applications, but a theoretical understanding of the generalization guarantees remains limited, with existing analyses ignoring either graph sparsification or jumping connections. This paper presents the first learning dynamics and generalization analysis of GCNs with jumping con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.05533","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/2507.05533/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:33:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NYT//iFwTcEIfmVGJW4tMAjlW1BLOaaLHYdz2JsDbyHJMEWG7NKIqpSPcBLhk6uYAZojdE5kJnq3ykd2jeBxCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T11:50:19.428758Z"},"content_sha256":"6dfbfdb19e49c2241f86c0a46455012c256ee0094c8b1be9eb3b9eb5cae7c1cc","schema_version":"1.0","event_id":"sha256:6dfbfdb19e49c2241f86c0a46455012c256ee0094c8b1be9eb3b9eb5cae7c1cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FMNDIMFSPK6577EJHKJH4OMOW7/bundle.json","state_url":"https://pith.science/pith/FMNDIMFSPK6577EJHKJH4OMOW7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FMNDIMFSPK6577EJHKJH4OMOW7/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-09T11:50:19Z","links":{"resolver":"https://pith.science/pith/FMNDIMFSPK6577EJHKJH4OMOW7","bundle":"https://pith.science/pith/FMNDIMFSPK6577EJHKJH4OMOW7/bundle.json","state":"https://pith.science/pith/FMNDIMFSPK6577EJHKJH4OMOW7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FMNDIMFSPK6577EJHKJH4OMOW7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:FMNDIMFSPK6577EJHKJH4OMOW7","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":"b319b9d40fa1466f902624967a9b62a58ccd186de6ad0daa0a6874216914c188","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-07-07T23:10:53Z","title_canon_sha256":"0756805429d32a1b4dce6124ccd78680d1205d9fbfef63208a19f3a68f56cbcf"},"schema_version":"1.0","source":{"id":"2507.05533","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.05533","created_at":"2026-07-05T11:33:31Z"},{"alias_kind":"arxiv_version","alias_value":"2507.05533v1","created_at":"2026-07-05T11:33:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.05533","created_at":"2026-07-05T11:33:31Z"},{"alias_kind":"pith_short_12","alias_value":"FMNDIMFSPK65","created_at":"2026-07-05T11:33:31Z"},{"alias_kind":"pith_short_16","alias_value":"FMNDIMFSPK6577EJ","created_at":"2026-07-05T11:33:31Z"},{"alias_kind":"pith_short_8","alias_value":"FMNDIMFS","created_at":"2026-07-05T11:33:31Z"}],"graph_snapshots":[{"event_id":"sha256:6dfbfdb19e49c2241f86c0a46455012c256ee0094c8b1be9eb3b9eb5cae7c1cc","target":"graph","created_at":"2026-07-05T11:33:31Z","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/2507.05533/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Jumping connections enable Graph Convolutional Networks (GCNs) to overcome over-smoothing, while graph sparsification reduces computational demands by selecting a sub-matrix of the graph adjacency matrix during neighborhood aggregation. Learning GCNs with graph sparsification has shown empirical success across various applications, but a theoretical understanding of the generalization guarantees remains limited, with existing analyses ignoring either graph sparsification or jumping connections. This paper presents the first learning dynamics and generalization analysis of GCNs with jumping con","authors_text":"Hongkang Li, Jiawei Sun, Meng Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-07-07T23:10:53Z","title":"Theoretical Learning Performance of Graph Neural Networks: The Impact of Jumping Connections and Layer-wise Sparsification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.05533","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:241823a7d224138f17c87c94e205ffef228de106e80dcde15137a23b6deb2ccc","target":"record","created_at":"2026-07-05T11:33:31Z","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":"b319b9d40fa1466f902624967a9b62a58ccd186de6ad0daa0a6874216914c188","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-07-07T23:10:53Z","title_canon_sha256":"0756805429d32a1b4dce6124ccd78680d1205d9fbfef63208a19f3a68f56cbcf"},"schema_version":"1.0","source":{"id":"2507.05533","kind":"arxiv","version":1}},"canonical_sha256":"2b1a3430b27abddffc893a927e398eb7da4553a6071542a544a1f6a6d9f404d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b1a3430b27abddffc893a927e398eb7da4553a6071542a544a1f6a6d9f404d9","first_computed_at":"2026-07-05T11:33:31.873018Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:33:31.873018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+SKpzTZ/vWKGjXOfro7a3EdRXh0sLQqfm6PK8i9X1jb2AlcqtiWykPCzmkgEhPGj4lquppN+7tqZyGmohTtNAA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:33:31.873481Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.05533","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:241823a7d224138f17c87c94e205ffef228de106e80dcde15137a23b6deb2ccc","sha256:6dfbfdb19e49c2241f86c0a46455012c256ee0094c8b1be9eb3b9eb5cae7c1cc"],"state_sha256":"45ba499936125ec65f7820c7ad604fc5f91b09c7a7ac48cda12a29757180217b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k/qflgvRYb5hmIIe1EMH7mv3bL5S5G2eug9jHwjtCXn3Ep+6MJhEJiTwKSNtbrErtR/4/pacNXmnqvqqTHreCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T11:50:19.433610Z","bundle_sha256":"c85deaadecddec81d25ee4299b417a2c33796b1f187109fec8f5b5ccb8fb735c"}}