{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:WWXUHWBDX6BQQGNZSC7IMZ24Q7","short_pith_number":"pith:WWXUHWBD","schema_version":"1.0","canonical_sha256":"b5af43d823bf830819b990be86675c87e595abdfa3c42958fc9a9bb6d43ca204","source":{"kind":"arxiv","id":"2311.11368","version":1},"attestation_state":"computed","paper":{"title":"Self-Supervised Pretraining for Heterogeneous Hypergraph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Abdalgader Abubaker, Madhav Nimishakavi, Takanori Maehara, Vassilis Plachouras","submitted_at":"2023-11-19T16:34:56Z","abstract_excerpt":"Recently, pretraining methods for the Graph Neural Networks (GNNs) have been successful at learning effective representations from unlabeled graph data. However, most of these methods rely on pairwise relations in the graph and do not capture the underling higher-order relations between entities. Hypergraphs are versatile and expressive structures that can effectively model higher-order relationships among entities in the data. Despite the efforts to adapt GNNs to hypergraphs (HyperGNN), there are currently no fully self-supervised pretraining methods for HyperGNN on heterogeneous hypergraphs."},"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":"2311.11368","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-11-19T16:34:56Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"3bb18993dcc26f3830b0c89b4646a71211517e0bc1952d402403b21074e9be8a","abstract_canon_sha256":"1b759ad796ec26d7b3fe1bc3d6cecc21c7a1dd00e9b85d7f16d13a11283ce2d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:14:32.209636Z","signature_b64":"Xh8N7+Pd0prWuTdE1rqZ6VB32XqtWHn9qk72KcF2WZGyrn8+Rl2gsgGOSSwcYkPjLm0vXdYPlnLlmQE8upC7AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5af43d823bf830819b990be86675c87e595abdfa3c42958fc9a9bb6d43ca204","last_reissued_at":"2026-07-05T07:14:32.209169Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:14:32.209169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Self-Supervised Pretraining for Heterogeneous Hypergraph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Abdalgader Abubaker, Madhav Nimishakavi, Takanori Maehara, Vassilis Plachouras","submitted_at":"2023-11-19T16:34:56Z","abstract_excerpt":"Recently, pretraining methods for the Graph Neural Networks (GNNs) have been successful at learning effective representations from unlabeled graph data. However, most of these methods rely on pairwise relations in the graph and do not capture the underling higher-order relations between entities. Hypergraphs are versatile and expressive structures that can effectively model higher-order relationships among entities in the data. Despite the efforts to adapt GNNs to hypergraphs (HyperGNN), there are currently no fully self-supervised pretraining methods for HyperGNN on heterogeneous hypergraphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.11368","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/2311.11368/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":"2311.11368","created_at":"2026-07-05T07:14:32.209224+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.11368v1","created_at":"2026-07-05T07:14:32.209224+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.11368","created_at":"2026-07-05T07:14:32.209224+00:00"},{"alias_kind":"pith_short_12","alias_value":"WWXUHWBDX6BQ","created_at":"2026-07-05T07:14:32.209224+00:00"},{"alias_kind":"pith_short_16","alias_value":"WWXUHWBDX6BQQGNZ","created_at":"2026-07-05T07:14:32.209224+00:00"},{"alias_kind":"pith_short_8","alias_value":"WWXUHWBD","created_at":"2026-07-05T07:14:32.209224+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2506.12362","citing_title":"HYPER: A Foundation Model for Inductive Link Prediction with Knowledge Hypergraphs","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WWXUHWBDX6BQQGNZSC7IMZ24Q7","json":"https://pith.science/pith/WWXUHWBDX6BQQGNZSC7IMZ24Q7.json","graph_json":"https://pith.science/api/pith-number/WWXUHWBDX6BQQGNZSC7IMZ24Q7/graph.json","events_json":"https://pith.science/api/pith-number/WWXUHWBDX6BQQGNZSC7IMZ24Q7/events.json","paper":"https://pith.science/paper/WWXUHWBD"},"agent_actions":{"view_html":"https://pith.science/pith/WWXUHWBDX6BQQGNZSC7IMZ24Q7","download_json":"https://pith.science/pith/WWXUHWBDX6BQQGNZSC7IMZ24Q7.json","view_paper":"https://pith.science/paper/WWXUHWBD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.11368&json=true","fetch_graph":"https://pith.science/api/pith-number/WWXUHWBDX6BQQGNZSC7IMZ24Q7/graph.json","fetch_events":"https://pith.science/api/pith-number/WWXUHWBDX6BQQGNZSC7IMZ24Q7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WWXUHWBDX6BQQGNZSC7IMZ24Q7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WWXUHWBDX6BQQGNZSC7IMZ24Q7/action/storage_attestation","attest_author":"https://pith.science/pith/WWXUHWBDX6BQQGNZSC7IMZ24Q7/action/author_attestation","sign_citation":"https://pith.science/pith/WWXUHWBDX6BQQGNZSC7IMZ24Q7/action/citation_signature","submit_replication":"https://pith.science/pith/WWXUHWBDX6BQQGNZSC7IMZ24Q7/action/replication_record"}},"created_at":"2026-07-05T07:14:32.209224+00:00","updated_at":"2026-07-05T07:14:32.209224+00:00"}