{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:XUZH6E4TGDDFG6UX5P4PXOEXC2","short_pith_number":"pith:XUZH6E4T","canonical_record":{"source":{"id":"2203.17159","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-03-31T16:33:31Z","cross_cats_sorted":[],"title_canon_sha256":"fe530955e3fea48cb246e1c83844925c6b6bb85228bd6c9bc80b558b95fb3700","abstract_canon_sha256":"1f28f50a46a42553a5d2a041741f7e47672038b354d8a6b220b8d0bc8d8a7a18"},"schema_version":"1.0"},"canonical_sha256":"bd327f139330c6537a97ebf8fbb8971695cbfe7ab29533997e628ab3ef79f585","source":{"kind":"arxiv","id":"2203.17159","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.17159","created_at":"2026-07-05T05:12:28Z"},{"alias_kind":"arxiv_version","alias_value":"2203.17159v2","created_at":"2026-07-05T05:12:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.17159","created_at":"2026-07-05T05:12:28Z"},{"alias_kind":"pith_short_12","alias_value":"XUZH6E4TGDDF","created_at":"2026-07-05T05:12:28Z"},{"alias_kind":"pith_short_16","alias_value":"XUZH6E4TGDDFG6UX","created_at":"2026-07-05T05:12:28Z"},{"alias_kind":"pith_short_8","alias_value":"XUZH6E4T","created_at":"2026-07-05T05:12:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:XUZH6E4TGDDFG6UX5P4PXOEXC2","target":"record","payload":{"canonical_record":{"source":{"id":"2203.17159","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-03-31T16:33:31Z","cross_cats_sorted":[],"title_canon_sha256":"fe530955e3fea48cb246e1c83844925c6b6bb85228bd6c9bc80b558b95fb3700","abstract_canon_sha256":"1f28f50a46a42553a5d2a041741f7e47672038b354d8a6b220b8d0bc8d8a7a18"},"schema_version":"1.0"},"canonical_sha256":"bd327f139330c6537a97ebf8fbb8971695cbfe7ab29533997e628ab3ef79f585","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:12:28.176875Z","signature_b64":"EQgJivdsYGV4krGPWdCPgJbcWE4VYBi1qe+VZE7HdxGmwrLooFJ5JJOLv5bQlOQ45k4PI0cEVTg1vvS9l7haCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd327f139330c6537a97ebf8fbb8971695cbfe7ab29533997e628ab3ef79f585","last_reissued_at":"2026-07-05T05:12:28.176349Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:12:28.176349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2203.17159","source_version":2,"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:12:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S+Wz90LFlPsAncD5QGNipmRVzwOtA4s27ontsU7+7KxQzChYQIVeTCuH/w4AnJn/Z//ZmGs/0F/D+1k9PEbwCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T16:45:19.410687Z"},"content_sha256":"237bd4452c3e42b6ca4eb6a91c4f33f7c23e0dbb3237368cc61295c03b3f2cb6","schema_version":"1.0","event_id":"sha256:237bd4452c3e42b6ca4eb6a91c4f33f7c23e0dbb3237368cc61295c03b3f2cb6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:XUZH6E4TGDDFG6UX5P4PXOEXC2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Preventing Over-Smoothing for Hypergraph Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Guanzi Chen, Jiying Zhang, Xi Xiao, Yang Li","submitted_at":"2022-03-31T16:33:31Z","abstract_excerpt":"In recent years, hypergraph learning has attracted great attention due to its capacity in representing complex and high-order relationships. However, current neural network approaches designed for hypergraphs are mostly shallow, thus limiting their ability to extract information from high-order neighbors. In this paper, we show both theoretically and empirically, that the performance of hypergraph neural networks does not improve as the number of layers increases, which is known as the over-smoothing problem. To avoid this issue, we develop a new deep hypergraph convolutional network called De"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.17159","kind":"arxiv","version":2},"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/2203.17159/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:12:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tZ592myRf9XzSqtew5zc5saJBXOqYOlaoMeFTt029hCKCPF80emquzYdQbMNP6jFneKGTwIQb8S1hbeJdhGBCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T16:45:19.411843Z"},"content_sha256":"3ef69ee652d400ce33380f3306c519bfe69e2244200ad0a2690ea591bbab9773","schema_version":"1.0","event_id":"sha256:3ef69ee652d400ce33380f3306c519bfe69e2244200ad0a2690ea591bbab9773"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XUZH6E4TGDDFG6UX5P4PXOEXC2/bundle.json","state_url":"https://pith.science/pith/XUZH6E4TGDDFG6UX5P4PXOEXC2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XUZH6E4TGDDFG6UX5P4PXOEXC2/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-11T16:45:19Z","links":{"resolver":"https://pith.science/pith/XUZH6E4TGDDFG6UX5P4PXOEXC2","bundle":"https://pith.science/pith/XUZH6E4TGDDFG6UX5P4PXOEXC2/bundle.json","state":"https://pith.science/pith/XUZH6E4TGDDFG6UX5P4PXOEXC2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XUZH6E4TGDDFG6UX5P4PXOEXC2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:XUZH6E4TGDDFG6UX5P4PXOEXC2","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":"1f28f50a46a42553a5d2a041741f7e47672038b354d8a6b220b8d0bc8d8a7a18","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-03-31T16:33:31Z","title_canon_sha256":"fe530955e3fea48cb246e1c83844925c6b6bb85228bd6c9bc80b558b95fb3700"},"schema_version":"1.0","source":{"id":"2203.17159","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.17159","created_at":"2026-07-05T05:12:28Z"},{"alias_kind":"arxiv_version","alias_value":"2203.17159v2","created_at":"2026-07-05T05:12:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.17159","created_at":"2026-07-05T05:12:28Z"},{"alias_kind":"pith_short_12","alias_value":"XUZH6E4TGDDF","created_at":"2026-07-05T05:12:28Z"},{"alias_kind":"pith_short_16","alias_value":"XUZH6E4TGDDFG6UX","created_at":"2026-07-05T05:12:28Z"},{"alias_kind":"pith_short_8","alias_value":"XUZH6E4T","created_at":"2026-07-05T05:12:28Z"}],"graph_snapshots":[{"event_id":"sha256:3ef69ee652d400ce33380f3306c519bfe69e2244200ad0a2690ea591bbab9773","target":"graph","created_at":"2026-07-05T05:12:28Z","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/2203.17159/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In recent years, hypergraph learning has attracted great attention due to its capacity in representing complex and high-order relationships. However, current neural network approaches designed for hypergraphs are mostly shallow, thus limiting their ability to extract information from high-order neighbors. In this paper, we show both theoretically and empirically, that the performance of hypergraph neural networks does not improve as the number of layers increases, which is known as the over-smoothing problem. To avoid this issue, we develop a new deep hypergraph convolutional network called De","authors_text":"Guanzi Chen, Jiying Zhang, Xi Xiao, Yang Li","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-03-31T16:33:31Z","title":"Preventing Over-Smoothing for Hypergraph Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.17159","kind":"arxiv","version":2},"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:237bd4452c3e42b6ca4eb6a91c4f33f7c23e0dbb3237368cc61295c03b3f2cb6","target":"record","created_at":"2026-07-05T05:12:28Z","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":"1f28f50a46a42553a5d2a041741f7e47672038b354d8a6b220b8d0bc8d8a7a18","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-03-31T16:33:31Z","title_canon_sha256":"fe530955e3fea48cb246e1c83844925c6b6bb85228bd6c9bc80b558b95fb3700"},"schema_version":"1.0","source":{"id":"2203.17159","kind":"arxiv","version":2}},"canonical_sha256":"bd327f139330c6537a97ebf8fbb8971695cbfe7ab29533997e628ab3ef79f585","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd327f139330c6537a97ebf8fbb8971695cbfe7ab29533997e628ab3ef79f585","first_computed_at":"2026-07-05T05:12:28.176349Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:12:28.176349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EQgJivdsYGV4krGPWdCPgJbcWE4VYBi1qe+VZE7HdxGmwrLooFJ5JJOLv5bQlOQ45k4PI0cEVTg1vvS9l7haCA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:12:28.176875Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.17159","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:237bd4452c3e42b6ca4eb6a91c4f33f7c23e0dbb3237368cc61295c03b3f2cb6","sha256:3ef69ee652d400ce33380f3306c519bfe69e2244200ad0a2690ea591bbab9773"],"state_sha256":"7d34e9302c2a2a77833a0584100aa0aee4a56d1fbf68d621534e14188b320aff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Eq5k7aC/1R2lTyslLRG6QKvtDxVZlYh7OIhdlb4PtAEXjJBS5D7Z62XkQpQaUesyNrnhV9cAjfZAPsHcS+BIBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T16:45:19.424396Z","bundle_sha256":"4762f160b9e2eaa41117cccaf661c612f3ec2c1b459932ba1e4e8733cf4d5983"}}