{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:IMZXJ5SBJ2ZZJTGO2VLN2YYCUZ","short_pith_number":"pith:IMZXJ5SB","schema_version":"1.0","canonical_sha256":"433374f6414eb394ccced556dd6302a645d25908506a455821bff2e8942a667d","source":{"kind":"arxiv","id":"2308.10051","version":1},"attestation_state":"computed","paper":{"title":"The Snowflake Hypothesis: Training Deep GNN with One Node One Receptive field","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Guibin Zhang, Guohao Li, Kai Wang, Kun Wang, Shilong Wang, Xiaojiang Peng, Yang Wang, Yang You, Yuxuan Liang","submitted_at":"2023-08-19T15:21:12Z","abstract_excerpt":"Despite Graph Neural Networks demonstrating considerable promise in graph representation learning tasks, GNNs predominantly face significant issues with over-fitting and over-smoothing as they go deeper as models of computer vision realm. In this work, we conduct a systematic study of deeper GNN research trajectories. Our findings indicate that the current success of deep GNNs primarily stems from (I) the adoption of innovations from CNNs, such as residual/skip connections, or (II) the tailor-made aggregation algorithms like DropEdge. However, these algorithms often lack intrinsic interpretabi"},"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":"2308.10051","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-08-19T15:21:12Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"7d6396d53954af4b32e36dab24aae809b9deb822d3f8faba242bc6b65f379efd","abstract_canon_sha256":"7ad833823ac327669cb7c14d2b65fa4414581532caae72b502d782b0ffa9d6be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:42:50.713506Z","signature_b64":"3j5jhl0iiFHCLyMdyFkvL4/pMc6QbF7mz1Sy1Y9d1sMe7cKUrVBALa2pO/R+sq75RgKvc7pIJk8IyGQc27aYBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"433374f6414eb394ccced556dd6302a645d25908506a455821bff2e8942a667d","last_reissued_at":"2026-07-05T06:42:50.713003Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:42:50.713003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Snowflake Hypothesis: Training Deep GNN with One Node One Receptive field","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Guibin Zhang, Guohao Li, Kai Wang, Kun Wang, Shilong Wang, Xiaojiang Peng, Yang Wang, Yang You, Yuxuan Liang","submitted_at":"2023-08-19T15:21:12Z","abstract_excerpt":"Despite Graph Neural Networks demonstrating considerable promise in graph representation learning tasks, GNNs predominantly face significant issues with over-fitting and over-smoothing as they go deeper as models of computer vision realm. In this work, we conduct a systematic study of deeper GNN research trajectories. Our findings indicate that the current success of deep GNNs primarily stems from (I) the adoption of innovations from CNNs, such as residual/skip connections, or (II) the tailor-made aggregation algorithms like DropEdge. However, these algorithms often lack intrinsic interpretabi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.10051","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/2308.10051/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":"2308.10051","created_at":"2026-07-05T06:42:50.713066+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.10051v1","created_at":"2026-07-05T06:42:50.713066+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.10051","created_at":"2026-07-05T06:42:50.713066+00:00"},{"alias_kind":"pith_short_12","alias_value":"IMZXJ5SBJ2ZZ","created_at":"2026-07-05T06:42:50.713066+00:00"},{"alias_kind":"pith_short_16","alias_value":"IMZXJ5SBJ2ZZJTGO","created_at":"2026-07-05T06:42:50.713066+00:00"},{"alias_kind":"pith_short_8","alias_value":"IMZXJ5SB","created_at":"2026-07-05T06:42:50.713066+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.17576","citing_title":"Towards a deeper GCN: Alleviate over-smoothing with iterative training and fine-tuning","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IMZXJ5SBJ2ZZJTGO2VLN2YYCUZ","json":"https://pith.science/pith/IMZXJ5SBJ2ZZJTGO2VLN2YYCUZ.json","graph_json":"https://pith.science/api/pith-number/IMZXJ5SBJ2ZZJTGO2VLN2YYCUZ/graph.json","events_json":"https://pith.science/api/pith-number/IMZXJ5SBJ2ZZJTGO2VLN2YYCUZ/events.json","paper":"https://pith.science/paper/IMZXJ5SB"},"agent_actions":{"view_html":"https://pith.science/pith/IMZXJ5SBJ2ZZJTGO2VLN2YYCUZ","download_json":"https://pith.science/pith/IMZXJ5SBJ2ZZJTGO2VLN2YYCUZ.json","view_paper":"https://pith.science/paper/IMZXJ5SB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.10051&json=true","fetch_graph":"https://pith.science/api/pith-number/IMZXJ5SBJ2ZZJTGO2VLN2YYCUZ/graph.json","fetch_events":"https://pith.science/api/pith-number/IMZXJ5SBJ2ZZJTGO2VLN2YYCUZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IMZXJ5SBJ2ZZJTGO2VLN2YYCUZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IMZXJ5SBJ2ZZJTGO2VLN2YYCUZ/action/storage_attestation","attest_author":"https://pith.science/pith/IMZXJ5SBJ2ZZJTGO2VLN2YYCUZ/action/author_attestation","sign_citation":"https://pith.science/pith/IMZXJ5SBJ2ZZJTGO2VLN2YYCUZ/action/citation_signature","submit_replication":"https://pith.science/pith/IMZXJ5SBJ2ZZJTGO2VLN2YYCUZ/action/replication_record"}},"created_at":"2026-07-05T06:42:50.713066+00:00","updated_at":"2026-07-05T06:42:50.713066+00:00"}