{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:IDRDAC5Z2GPKQXBW3GI62TGH5V","short_pith_number":"pith:IDRDAC5Z","canonical_record":{"source":{"id":"2207.06680","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-07-14T06:17:00Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"4e404f4036ca9505d239115dbdec6c054570b99a2b47a6784a2d79f8815a092e","abstract_canon_sha256":"38194b83ad1e2c012027557484e6f32d49f4d94bdc3325c29273a90fdf7f3545"},"schema_version":"1.0"},"canonical_sha256":"40e2300bb9d19ea85c36d991ed4cc7ed45ef2e3cfb59e78ba5d3465574a7d909","source":{"kind":"arxiv","id":"2207.06680","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.06680","created_at":"2026-07-05T05:41:50Z"},{"alias_kind":"arxiv_version","alias_value":"2207.06680v3","created_at":"2026-07-05T05:41:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.06680","created_at":"2026-07-05T05:41:50Z"},{"alias_kind":"pith_short_12","alias_value":"IDRDAC5Z2GPK","created_at":"2026-07-05T05:41:50Z"},{"alias_kind":"pith_short_16","alias_value":"IDRDAC5Z2GPKQXBW","created_at":"2026-07-05T05:41:50Z"},{"alias_kind":"pith_short_8","alias_value":"IDRDAC5Z","created_at":"2026-07-05T05:41:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:IDRDAC5Z2GPKQXBW3GI62TGH5V","target":"record","payload":{"canonical_record":{"source":{"id":"2207.06680","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-07-14T06:17:00Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"4e404f4036ca9505d239115dbdec6c054570b99a2b47a6784a2d79f8815a092e","abstract_canon_sha256":"38194b83ad1e2c012027557484e6f32d49f4d94bdc3325c29273a90fdf7f3545"},"schema_version":"1.0"},"canonical_sha256":"40e2300bb9d19ea85c36d991ed4cc7ed45ef2e3cfb59e78ba5d3465574a7d909","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:41:50.773850Z","signature_b64":"jbGXkKvSjC+d/TE0luUL1LARLUAt0k+WuVZ33k+n9ctsjUukwwV/IO3zeWjcQnwR9fxGSbEvXFik2y4jqoBnDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40e2300bb9d19ea85c36d991ed4cc7ed45ef2e3cfb59e78ba5d3465574a7d909","last_reissued_at":"2026-07-05T05:41:50.773374Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:41:50.773374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2207.06680","source_version":3,"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:41:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UEAuEf+dOlia9T6A8U77ggibp9nMYof70F0U0YMRNVGHTu9mJBA2pRtQ64cBKkjQJrtx5EzAXzHQXlgpN/lcDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T21:46:38.448609Z"},"content_sha256":"24d313748e015ddf3ca8de01244778c46afe9439e03c63b1cb6e28b560057668","schema_version":"1.0","event_id":"sha256:24d313748e015ddf3ca8de01244778c46afe9439e03c63b1cb6e28b560057668"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:IDRDAC5Z2GPKQXBW3GI62TGH5V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Equivariant Hypergraph Diffusion Neural Operators","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Pan Li, Peihao Wang, Shenghao Yang, Yunyu Liu, Zhangyang Wang","submitted_at":"2022-07-14T06:17:00Z","abstract_excerpt":"Hypergraph neural networks (HNNs) using neural networks to encode hypergraphs provide a promising way to model higher-order relations in data and further solve relevant prediction tasks built upon such higher-order relations. However, higher-order relations in practice contain complex patterns and are often highly irregular. So, it is often challenging to design an HNN that suffices to express those relations while keeping computational efficiency. Inspired by hypergraph diffusion algorithms, this work proposes a new HNN architecture named ED-HNN, which provably represents any continuous equiv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.06680","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/2207.06680/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:41:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AyM5BWQMur6nA/7CVMLpsebW4m540dTSmzJjyiFgN08UUTpZiDwTBdkdrU7vb3oRqRlqr1VYH/jiG05hovQNCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T21:46:38.449139Z"},"content_sha256":"2fcda3842529007fa88f6f03719e941030b8f2248a9a224ae626575e3a847ccc","schema_version":"1.0","event_id":"sha256:2fcda3842529007fa88f6f03719e941030b8f2248a9a224ae626575e3a847ccc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IDRDAC5Z2GPKQXBW3GI62TGH5V/bundle.json","state_url":"https://pith.science/pith/IDRDAC5Z2GPKQXBW3GI62TGH5V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IDRDAC5Z2GPKQXBW3GI62TGH5V/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-07-31T21:46:38Z","links":{"resolver":"https://pith.science/pith/IDRDAC5Z2GPKQXBW3GI62TGH5V","bundle":"https://pith.science/pith/IDRDAC5Z2GPKQXBW3GI62TGH5V/bundle.json","state":"https://pith.science/pith/IDRDAC5Z2GPKQXBW3GI62TGH5V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IDRDAC5Z2GPKQXBW3GI62TGH5V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:IDRDAC5Z2GPKQXBW3GI62TGH5V","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":"38194b83ad1e2c012027557484e6f32d49f4d94bdc3325c29273a90fdf7f3545","cross_cats_sorted":["cs.SI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-07-14T06:17:00Z","title_canon_sha256":"4e404f4036ca9505d239115dbdec6c054570b99a2b47a6784a2d79f8815a092e"},"schema_version":"1.0","source":{"id":"2207.06680","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.06680","created_at":"2026-07-05T05:41:50Z"},{"alias_kind":"arxiv_version","alias_value":"2207.06680v3","created_at":"2026-07-05T05:41:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.06680","created_at":"2026-07-05T05:41:50Z"},{"alias_kind":"pith_short_12","alias_value":"IDRDAC5Z2GPK","created_at":"2026-07-05T05:41:50Z"},{"alias_kind":"pith_short_16","alias_value":"IDRDAC5Z2GPKQXBW","created_at":"2026-07-05T05:41:50Z"},{"alias_kind":"pith_short_8","alias_value":"IDRDAC5Z","created_at":"2026-07-05T05:41:50Z"}],"graph_snapshots":[{"event_id":"sha256:2fcda3842529007fa88f6f03719e941030b8f2248a9a224ae626575e3a847ccc","target":"graph","created_at":"2026-07-05T05:41:50Z","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/2207.06680/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Hypergraph neural networks (HNNs) using neural networks to encode hypergraphs provide a promising way to model higher-order relations in data and further solve relevant prediction tasks built upon such higher-order relations. However, higher-order relations in practice contain complex patterns and are often highly irregular. So, it is often challenging to design an HNN that suffices to express those relations while keeping computational efficiency. Inspired by hypergraph diffusion algorithms, this work proposes a new HNN architecture named ED-HNN, which provably represents any continuous equiv","authors_text":"Pan Li, Peihao Wang, Shenghao Yang, Yunyu Liu, Zhangyang Wang","cross_cats":["cs.SI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-07-14T06:17:00Z","title":"Equivariant Hypergraph Diffusion Neural Operators"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.06680","kind":"arxiv","version":3},"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:24d313748e015ddf3ca8de01244778c46afe9439e03c63b1cb6e28b560057668","target":"record","created_at":"2026-07-05T05:41:50Z","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":"38194b83ad1e2c012027557484e6f32d49f4d94bdc3325c29273a90fdf7f3545","cross_cats_sorted":["cs.SI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-07-14T06:17:00Z","title_canon_sha256":"4e404f4036ca9505d239115dbdec6c054570b99a2b47a6784a2d79f8815a092e"},"schema_version":"1.0","source":{"id":"2207.06680","kind":"arxiv","version":3}},"canonical_sha256":"40e2300bb9d19ea85c36d991ed4cc7ed45ef2e3cfb59e78ba5d3465574a7d909","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"40e2300bb9d19ea85c36d991ed4cc7ed45ef2e3cfb59e78ba5d3465574a7d909","first_computed_at":"2026-07-05T05:41:50.773374Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:41:50.773374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jbGXkKvSjC+d/TE0luUL1LARLUAt0k+WuVZ33k+n9ctsjUukwwV/IO3zeWjcQnwR9fxGSbEvXFik2y4jqoBnDA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:41:50.773850Z","signed_message":"canonical_sha256_bytes"},"source_id":"2207.06680","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24d313748e015ddf3ca8de01244778c46afe9439e03c63b1cb6e28b560057668","sha256:2fcda3842529007fa88f6f03719e941030b8f2248a9a224ae626575e3a847ccc"],"state_sha256":"9fe8c2c24669476aad8b2dcf5a9dbad8691f53f9fc4c95ae34bc9c95ba4e453b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3kAKTYSGmix6Ry5I60fwQSBFziG+tr0DR8a0pVRha4vB3MSfNm3h/i07g53LYCu9QEcMHFqZkZgR9+pyh19SAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-31T21:46:38.453173Z","bundle_sha256":"ae4f6c3a9e74a346416e73ea9041f2a8fad12968400e51cdb6ab20236b77de98"}}