{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:IVLDJQI7ODKV2GZ7TN3C7C4Y5X","short_pith_number":"pith:IVLDJQI7","schema_version":"1.0","canonical_sha256":"455634c11f70d55d1b3f9b762f8b98edfdbb6d7ada0257430a9d96f38fc75af9","source":{"kind":"arxiv","id":"2209.15454","version":1},"attestation_state":"computed","paper":{"title":"GPNet: Simplifying Graph Neural Networks via Multi-channel Geometric Polynomials","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Alex Hay-Man Ng, FangYuan Lei, Xun Liu, Yikuan Zhang, Zhengmin Li","submitted_at":"2022-09-30T13:03:57Z","abstract_excerpt":"Graph Neural Networks (GNNs) are a promising deep learning approach for circumventing many real-world problems on graph-structured data. However, these models usually have at least one of four fundamental limitations: over-smoothing, over-fitting, difficult to train, and strong homophily assumption. For example, Simple Graph Convolution (SGC) is known to suffer from the first and fourth limitations. To tackle these limitations, we identify a set of key designs including (D1) dilated convolution, (D2) multi-channel learning, (D3) self-attention score, and (D4) sign factor to boost learning from"},"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":"2209.15454","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-09-30T13:03:57Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"6c864f2ad3278e9bcdb9917878943442a7f4ba0bad6abd8e57279519f7f460d2","abstract_canon_sha256":"b6a9f5233e2be52b67d434ea307d68ebfb52d30f326370f0367bb480f934dd16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:02:20.124732Z","signature_b64":"JGOZtWMB65cP+79t9MyQnL/gFACj/G3t5/X0H45i6hM0lc/gXcYoShAif/o1gkHFhQoA8+YxinoBnP4tWYXICA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"455634c11f70d55d1b3f9b762f8b98edfdbb6d7ada0257430a9d96f38fc75af9","last_reissued_at":"2026-07-05T05:02:20.124376Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:02:20.124376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GPNet: Simplifying Graph Neural Networks via Multi-channel Geometric Polynomials","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Alex Hay-Man Ng, FangYuan Lei, Xun Liu, Yikuan Zhang, Zhengmin Li","submitted_at":"2022-09-30T13:03:57Z","abstract_excerpt":"Graph Neural Networks (GNNs) are a promising deep learning approach for circumventing many real-world problems on graph-structured data. However, these models usually have at least one of four fundamental limitations: over-smoothing, over-fitting, difficult to train, and strong homophily assumption. For example, Simple Graph Convolution (SGC) is known to suffer from the first and fourth limitations. To tackle these limitations, we identify a set of key designs including (D1) dilated convolution, (D2) multi-channel learning, (D3) self-attention score, and (D4) sign factor to boost learning from"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.15454","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/2209.15454/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":"2209.15454","created_at":"2026-07-05T05:02:20.124441+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.15454v1","created_at":"2026-07-05T05:02:20.124441+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.15454","created_at":"2026-07-05T05:02:20.124441+00:00"},{"alias_kind":"pith_short_12","alias_value":"IVLDJQI7ODKV","created_at":"2026-07-05T05:02:20.124441+00:00"},{"alias_kind":"pith_short_16","alias_value":"IVLDJQI7ODKV2GZ7","created_at":"2026-07-05T05:02:20.124441+00:00"},{"alias_kind":"pith_short_8","alias_value":"IVLDJQI7","created_at":"2026-07-05T05:02:20.124441+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IVLDJQI7ODKV2GZ7TN3C7C4Y5X","json":"https://pith.science/pith/IVLDJQI7ODKV2GZ7TN3C7C4Y5X.json","graph_json":"https://pith.science/api/pith-number/IVLDJQI7ODKV2GZ7TN3C7C4Y5X/graph.json","events_json":"https://pith.science/api/pith-number/IVLDJQI7ODKV2GZ7TN3C7C4Y5X/events.json","paper":"https://pith.science/paper/IVLDJQI7"},"agent_actions":{"view_html":"https://pith.science/pith/IVLDJQI7ODKV2GZ7TN3C7C4Y5X","download_json":"https://pith.science/pith/IVLDJQI7ODKV2GZ7TN3C7C4Y5X.json","view_paper":"https://pith.science/paper/IVLDJQI7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.15454&json=true","fetch_graph":"https://pith.science/api/pith-number/IVLDJQI7ODKV2GZ7TN3C7C4Y5X/graph.json","fetch_events":"https://pith.science/api/pith-number/IVLDJQI7ODKV2GZ7TN3C7C4Y5X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IVLDJQI7ODKV2GZ7TN3C7C4Y5X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IVLDJQI7ODKV2GZ7TN3C7C4Y5X/action/storage_attestation","attest_author":"https://pith.science/pith/IVLDJQI7ODKV2GZ7TN3C7C4Y5X/action/author_attestation","sign_citation":"https://pith.science/pith/IVLDJQI7ODKV2GZ7TN3C7C4Y5X/action/citation_signature","submit_replication":"https://pith.science/pith/IVLDJQI7ODKV2GZ7TN3C7C4Y5X/action/replication_record"}},"created_at":"2026-07-05T05:02:20.124441+00:00","updated_at":"2026-07-05T05:02:20.124441+00:00"}