{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:BWMFPEAPBGY75BU32MQSXGFZZG","short_pith_number":"pith:BWMFPEAP","schema_version":"1.0","canonical_sha256":"0d9857900f09b1fe869bd3212b98b9c996443f22b8ebccc142bc4bdb921e89a1","source":{"kind":"arxiv","id":"2203.16939","version":3},"attestation_state":"computed","paper":{"title":"Hypergraph Convolutional Networks via Equivalency between Hypergraphs and Undirected Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Fuyang Li, Jiying Zhang, Junzhou Huang, Tingyang Xu, Xi Xiao, Yatao Bian, Yu Rong","submitted_at":"2022-03-31T10:46:47Z","abstract_excerpt":"As a powerful tool for modeling complex relationships, hypergraphs are gaining popularity from the graph learning community. However, commonly used frameworks in deep hypergraph learning focus on hypergraphs with edge-independent vertex weights (EIVWs), without considering hypergraphs with edge-dependent vertex weights (EDVWs) that have more modeling power. To compensate for this, we present General Hypergraph Spectral Convolution (GHSC), a general learning framework that not only handles EDVW and EIVW hypergraphs, but more importantly, enables theoretically explicitly utilizing the existing p"},"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":"2203.16939","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-03-31T10:46:47Z","cross_cats_sorted":[],"title_canon_sha256":"2b74bd4b0e852e3f28a45c121e78a4ef3ab61d355eec51de3e992fe6b766f05c","abstract_canon_sha256":"51daa31347c42dbd379bdb584b148ff9e3597678840ae118de4a4db50a95ca52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:43:00.651382Z","signature_b64":"vj6mh19a6F7ncfW1g91jggI97MJZ9tGMv/X//zvnVSz2FA1fKwqwtQig3W4kTGA+tAT0MCsQMerQLZoOSgYCAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d9857900f09b1fe869bd3212b98b9c996443f22b8ebccc142bc4bdb921e89a1","last_reissued_at":"2026-07-05T04:43:00.650957Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:43:00.650957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hypergraph Convolutional Networks via Equivalency between Hypergraphs and Undirected Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Fuyang Li, Jiying Zhang, Junzhou Huang, Tingyang Xu, Xi Xiao, Yatao Bian, Yu Rong","submitted_at":"2022-03-31T10:46:47Z","abstract_excerpt":"As a powerful tool for modeling complex relationships, hypergraphs are gaining popularity from the graph learning community. However, commonly used frameworks in deep hypergraph learning focus on hypergraphs with edge-independent vertex weights (EIVWs), without considering hypergraphs with edge-dependent vertex weights (EDVWs) that have more modeling power. To compensate for this, we present General Hypergraph Spectral Convolution (GHSC), a general learning framework that not only handles EDVW and EIVW hypergraphs, but more importantly, enables theoretically explicitly utilizing the existing p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.16939","kind":"arxiv","version":3},"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.16939/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":"2203.16939","created_at":"2026-07-05T04:43:00.651010+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.16939v3","created_at":"2026-07-05T04:43:00.651010+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.16939","created_at":"2026-07-05T04:43:00.651010+00:00"},{"alias_kind":"pith_short_12","alias_value":"BWMFPEAPBGY7","created_at":"2026-07-05T04:43:00.651010+00:00"},{"alias_kind":"pith_short_16","alias_value":"BWMFPEAPBGY75BU3","created_at":"2026-07-05T04:43:00.651010+00:00"},{"alias_kind":"pith_short_8","alias_value":"BWMFPEAP","created_at":"2026-07-05T04:43:00.651010+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.08679","citing_title":"Attention-based graph neural networks: a survey","ref_index":125,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BWMFPEAPBGY75BU32MQSXGFZZG","json":"https://pith.science/pith/BWMFPEAPBGY75BU32MQSXGFZZG.json","graph_json":"https://pith.science/api/pith-number/BWMFPEAPBGY75BU32MQSXGFZZG/graph.json","events_json":"https://pith.science/api/pith-number/BWMFPEAPBGY75BU32MQSXGFZZG/events.json","paper":"https://pith.science/paper/BWMFPEAP"},"agent_actions":{"view_html":"https://pith.science/pith/BWMFPEAPBGY75BU32MQSXGFZZG","download_json":"https://pith.science/pith/BWMFPEAPBGY75BU32MQSXGFZZG.json","view_paper":"https://pith.science/paper/BWMFPEAP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.16939&json=true","fetch_graph":"https://pith.science/api/pith-number/BWMFPEAPBGY75BU32MQSXGFZZG/graph.json","fetch_events":"https://pith.science/api/pith-number/BWMFPEAPBGY75BU32MQSXGFZZG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BWMFPEAPBGY75BU32MQSXGFZZG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BWMFPEAPBGY75BU32MQSXGFZZG/action/storage_attestation","attest_author":"https://pith.science/pith/BWMFPEAPBGY75BU32MQSXGFZZG/action/author_attestation","sign_citation":"https://pith.science/pith/BWMFPEAPBGY75BU32MQSXGFZZG/action/citation_signature","submit_replication":"https://pith.science/pith/BWMFPEAPBGY75BU32MQSXGFZZG/action/replication_record"}},"created_at":"2026-07-05T04:43:00.651010+00:00","updated_at":"2026-07-05T04:43:00.651010+00:00"}