{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:BBSMF53HBDFZDAOUQRLUK4B7DB","short_pith_number":"pith:BBSMF53H","schema_version":"1.0","canonical_sha256":"0864c2f76708cb9181d4845745703f1855c276cc641f826069a69e9079becdc6","source":{"kind":"arxiv","id":"2402.05569","version":6},"attestation_state":"computed","paper":{"title":"Training-Free Message Passing for Learning on Hypergraphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI","eess.SP","stat.ML"],"primary_cat":"cs.LG","authors_text":"Bohan Tang, Keyue Jiang, Siheng Chen, Xiaowen Dong, Zexi Liu","submitted_at":"2024-02-08T11:10:39Z","abstract_excerpt":"Hypergraphs are crucial for modelling higher-order interactions in real-world data. Hypergraph neural networks (HNNs) effectively utilise these structures by message passing to generate informative node features for various downstream tasks like node classification. However, the message passing module in existing HNNs typically requires a computationally intensive training process, which limits their practical use. To tackle this challenge, we propose an alternative approach by decoupling the usage of hypergraph structural information from the model learning stage. This leads to a novel traini"},"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":"2402.05569","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-08T11:10:39Z","cross_cats_sorted":["cs.AI","eess.SP","stat.ML"],"title_canon_sha256":"e18ad7600ad6837489d0bb8afed08b0e2156f341b1d77f3e87738f729cc03cc5","abstract_canon_sha256":"c241ee3d6cb0e3c07c126c04a8fa35c990bc921b92bdd683106a8a4920162ebf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:28:14.336428Z","signature_b64":"sNx2MX3tLLmIiYgnHs8EuCcCJopAo0iiI6ayYpz+IhKB8R8EVzxbUMgPnMjQeFRVMu8TYcIZExOlics3ZucYDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0864c2f76708cb9181d4845745703f1855c276cc641f826069a69e9079becdc6","last_reissued_at":"2026-07-05T10:28:14.335428Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:28:14.335428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Training-Free Message Passing for Learning on Hypergraphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI","eess.SP","stat.ML"],"primary_cat":"cs.LG","authors_text":"Bohan Tang, Keyue Jiang, Siheng Chen, Xiaowen Dong, Zexi Liu","submitted_at":"2024-02-08T11:10:39Z","abstract_excerpt":"Hypergraphs are crucial for modelling higher-order interactions in real-world data. Hypergraph neural networks (HNNs) effectively utilise these structures by message passing to generate informative node features for various downstream tasks like node classification. However, the message passing module in existing HNNs typically requires a computationally intensive training process, which limits their practical use. To tackle this challenge, we propose an alternative approach by decoupling the usage of hypergraph structural information from the model learning stage. This leads to a novel traini"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.05569","kind":"arxiv","version":6},"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/2402.05569/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":"2402.05569","created_at":"2026-07-05T10:28:14.335583+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.05569v6","created_at":"2026-07-05T10:28:14.335583+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.05569","created_at":"2026-07-05T10:28:14.335583+00:00"},{"alias_kind":"pith_short_12","alias_value":"BBSMF53HBDFZ","created_at":"2026-07-05T10:28:14.335583+00:00"},{"alias_kind":"pith_short_16","alias_value":"BBSMF53HBDFZDAOU","created_at":"2026-07-05T10:28:14.335583+00:00"},{"alias_kind":"pith_short_8","alias_value":"BBSMF53H","created_at":"2026-07-05T10:28:14.335583+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2601.03173","citing_title":"Predicting Time Pressure of Powered Two-Wheeler Riders for Proactive Safety Interventions","ref_index":52,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BBSMF53HBDFZDAOUQRLUK4B7DB","json":"https://pith.science/pith/BBSMF53HBDFZDAOUQRLUK4B7DB.json","graph_json":"https://pith.science/api/pith-number/BBSMF53HBDFZDAOUQRLUK4B7DB/graph.json","events_json":"https://pith.science/api/pith-number/BBSMF53HBDFZDAOUQRLUK4B7DB/events.json","paper":"https://pith.science/paper/BBSMF53H"},"agent_actions":{"view_html":"https://pith.science/pith/BBSMF53HBDFZDAOUQRLUK4B7DB","download_json":"https://pith.science/pith/BBSMF53HBDFZDAOUQRLUK4B7DB.json","view_paper":"https://pith.science/paper/BBSMF53H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.05569&json=true","fetch_graph":"https://pith.science/api/pith-number/BBSMF53HBDFZDAOUQRLUK4B7DB/graph.json","fetch_events":"https://pith.science/api/pith-number/BBSMF53HBDFZDAOUQRLUK4B7DB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BBSMF53HBDFZDAOUQRLUK4B7DB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BBSMF53HBDFZDAOUQRLUK4B7DB/action/storage_attestation","attest_author":"https://pith.science/pith/BBSMF53HBDFZDAOUQRLUK4B7DB/action/author_attestation","sign_citation":"https://pith.science/pith/BBSMF53HBDFZDAOUQRLUK4B7DB/action/citation_signature","submit_replication":"https://pith.science/pith/BBSMF53HBDFZDAOUQRLUK4B7DB/action/replication_record"}},"created_at":"2026-07-05T10:28:14.335583+00:00","updated_at":"2026-07-05T10:28:14.335583+00:00"}