{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:IVLDJQI7ODKV2GZ7TN3C7C4Y5X","short_pith_number":"pith:IVLDJQI7","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"},"canonical_sha256":"455634c11f70d55d1b3f9b762f8b98edfdbb6d7ada0257430a9d96f38fc75af9","source":{"kind":"arxiv","id":"2209.15454","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.15454","created_at":"2026-07-05T05:02:20Z"},{"alias_kind":"arxiv_version","alias_value":"2209.15454v1","created_at":"2026-07-05T05:02:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.15454","created_at":"2026-07-05T05:02:20Z"},{"alias_kind":"pith_short_12","alias_value":"IVLDJQI7ODKV","created_at":"2026-07-05T05:02:20Z"},{"alias_kind":"pith_short_16","alias_value":"IVLDJQI7ODKV2GZ7","created_at":"2026-07-05T05:02:20Z"},{"alias_kind":"pith_short_8","alias_value":"IVLDJQI7","created_at":"2026-07-05T05:02:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:IVLDJQI7ODKV2GZ7TN3C7C4Y5X","target":"record","payload":{"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"},"canonical_sha256":"455634c11f70d55d1b3f9b762f8b98edfdbb6d7ada0257430a9d96f38fc75af9","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"},"source_kind":"arxiv","source_id":"2209.15454","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-05T05:02:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LfrNYWtNWk2NpU9ywUev0pVkAqDRNAGHXjWoAjmzXiGhX8KK1lp5kxSkDNlSDfnSX7Vq7o1Bl4642DvMvXBFCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T00:08:18.227479Z"},"content_sha256":"2b583bdcdade756a9804038d243b34c63778ca987324e1e5c11b2afd29acb547","schema_version":"1.0","event_id":"sha256:2b583bdcdade756a9804038d243b34c63778ca987324e1e5c11b2afd29acb547"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:IVLDJQI7ODKV2GZ7TN3C7C4Y5X","target":"graph","payload":{"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"},"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-05T05:02:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bIUXFaa7+xlyLif16c4Pb697GSPJIdow6YDL6AHN2TjDNnsFtbFnV3n4cS9N2PUkcTmdkVEmcVLhD5a8xj/9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T00:08:18.227984Z"},"content_sha256":"a729613b425a100f6f42fbb4fb88a016854a54c0fcac2ee133a92fe4dcfcaeff","schema_version":"1.0","event_id":"sha256:a729613b425a100f6f42fbb4fb88a016854a54c0fcac2ee133a92fe4dcfcaeff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IVLDJQI7ODKV2GZ7TN3C7C4Y5X/bundle.json","state_url":"https://pith.science/pith/IVLDJQI7ODKV2GZ7TN3C7C4Y5X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IVLDJQI7ODKV2GZ7TN3C7C4Y5X/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-21T00:08:18Z","links":{"resolver":"https://pith.science/pith/IVLDJQI7ODKV2GZ7TN3C7C4Y5X","bundle":"https://pith.science/pith/IVLDJQI7ODKV2GZ7TN3C7C4Y5X/bundle.json","state":"https://pith.science/pith/IVLDJQI7ODKV2GZ7TN3C7C4Y5X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IVLDJQI7ODKV2GZ7TN3C7C4Y5X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:IVLDJQI7ODKV2GZ7TN3C7C4Y5X","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":"b6a9f5233e2be52b67d434ea307d68ebfb52d30f326370f0367bb480f934dd16","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-09-30T13:03:57Z","title_canon_sha256":"6c864f2ad3278e9bcdb9917878943442a7f4ba0bad6abd8e57279519f7f460d2"},"schema_version":"1.0","source":{"id":"2209.15454","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.15454","created_at":"2026-07-05T05:02:20Z"},{"alias_kind":"arxiv_version","alias_value":"2209.15454v1","created_at":"2026-07-05T05:02:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.15454","created_at":"2026-07-05T05:02:20Z"},{"alias_kind":"pith_short_12","alias_value":"IVLDJQI7ODKV","created_at":"2026-07-05T05:02:20Z"},{"alias_kind":"pith_short_16","alias_value":"IVLDJQI7ODKV2GZ7","created_at":"2026-07-05T05:02:20Z"},{"alias_kind":"pith_short_8","alias_value":"IVLDJQI7","created_at":"2026-07-05T05:02:20Z"}],"graph_snapshots":[{"event_id":"sha256:a729613b425a100f6f42fbb4fb88a016854a54c0fcac2ee133a92fe4dcfcaeff","target":"graph","created_at":"2026-07-05T05:02:20Z","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/2209.15454/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Alex Hay-Man Ng, FangYuan Lei, Xun Liu, Yikuan Zhang, Zhengmin Li","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-09-30T13:03:57Z","title":"GPNet: Simplifying Graph Neural Networks via Multi-channel Geometric Polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.15454","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:2b583bdcdade756a9804038d243b34c63778ca987324e1e5c11b2afd29acb547","target":"record","created_at":"2026-07-05T05:02:20Z","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":"b6a9f5233e2be52b67d434ea307d68ebfb52d30f326370f0367bb480f934dd16","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-09-30T13:03:57Z","title_canon_sha256":"6c864f2ad3278e9bcdb9917878943442a7f4ba0bad6abd8e57279519f7f460d2"},"schema_version":"1.0","source":{"id":"2209.15454","kind":"arxiv","version":1}},"canonical_sha256":"455634c11f70d55d1b3f9b762f8b98edfdbb6d7ada0257430a9d96f38fc75af9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"455634c11f70d55d1b3f9b762f8b98edfdbb6d7ada0257430a9d96f38fc75af9","first_computed_at":"2026-07-05T05:02:20.124376Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:02:20.124376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JGOZtWMB65cP+79t9MyQnL/gFACj/G3t5/X0H45i6hM0lc/gXcYoShAif/o1gkHFhQoA8+YxinoBnP4tWYXICA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:02:20.124732Z","signed_message":"canonical_sha256_bytes"},"source_id":"2209.15454","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b583bdcdade756a9804038d243b34c63778ca987324e1e5c11b2afd29acb547","sha256:a729613b425a100f6f42fbb4fb88a016854a54c0fcac2ee133a92fe4dcfcaeff"],"state_sha256":"ae7158bdb93caa0ac12b3ea0ef0e76a34a063c27245c8310ebad4e90c5c88a3f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OMtZqatWqUSkdVBTNRZlPLvIfMYuOMvK/aR8TepnoyyzE0jgncwNOMMa/BOaQiF46qDmSP+G6oki4+p4RaB2Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T00:08:18.231702Z","bundle_sha256":"82d6ab747b6e032fac8d06fd6c76de125c277da9adfcd86bdcdff31273080190"}}