{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:OB7ZRHGQUCL76J2CJCRXZGW2RS","short_pith_number":"pith:OB7ZRHGQ","schema_version":"1.0","canonical_sha256":"707f989cd0a097ff274248a37c9ada8ca5e19add1dfe51ced19b58bb597c847f","source":{"kind":"arxiv","id":"2508.09427","version":1},"attestation_state":"computed","paper":{"title":"Implicit Hypergraph Neural Networks: A Stable Framework for Higher-Order Relational Learning with Provable Guarantees","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Guangyu Tang, Jiaojiao Jiang, Xiaoyu Li","submitted_at":"2025-08-13T02:06:29Z","abstract_excerpt":"Many real-world interactions are group-based rather than pairwise such as papers with multiple co-authors and users jointly engaging with items. Hypergraph neural networks have shown great promise at modeling higher-order relations, but their reliance on a fixed number of explicit message-passing layers limits long-range dependency capture and can destabilize training as depth grows. In this work, we introduce Implicit Hypergraph Neural Networks (IHGNN), which bring the implicit equilibrium formulation to hypergraphs: instead of stacking layers, IHGNN computes representations as the solution t"},"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":"2508.09427","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2025-08-13T02:06:29Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"931fda65621325238cec372540d8f50a8c9eed52091fd9a9b15bd649322bffd9","abstract_canon_sha256":"4a21948a1c3cabfffb9facbca78400adcc5e6ce24e82c5f78d82cf2cb26a247c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:53:14.626401Z","signature_b64":"YgpO6PZTPp6uaDDQ8m4fDPe0CEQ1TPaGssZ7GQT7JV+9chuyE+s0UCDRFQmo3Z+NHqxrxDInLZCPxTLWfI9VAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"707f989cd0a097ff274248a37c9ada8ca5e19add1dfe51ced19b58bb597c847f","last_reissued_at":"2026-07-05T11:53:14.625942Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:53:14.625942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Implicit Hypergraph Neural Networks: A Stable Framework for Higher-Order Relational Learning with Provable Guarantees","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Guangyu Tang, Jiaojiao Jiang, Xiaoyu Li","submitted_at":"2025-08-13T02:06:29Z","abstract_excerpt":"Many real-world interactions are group-based rather than pairwise such as papers with multiple co-authors and users jointly engaging with items. Hypergraph neural networks have shown great promise at modeling higher-order relations, but their reliance on a fixed number of explicit message-passing layers limits long-range dependency capture and can destabilize training as depth grows. In this work, we introduce Implicit Hypergraph Neural Networks (IHGNN), which bring the implicit equilibrium formulation to hypergraphs: instead of stacking layers, IHGNN computes representations as the solution t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.09427","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/2508.09427/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":"2508.09427","created_at":"2026-07-05T11:53:14.626010+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.09427v1","created_at":"2026-07-05T11:53:14.626010+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.09427","created_at":"2026-07-05T11:53:14.626010+00:00"},{"alias_kind":"pith_short_12","alias_value":"OB7ZRHGQUCL7","created_at":"2026-07-05T11:53:14.626010+00:00"},{"alias_kind":"pith_short_16","alias_value":"OB7ZRHGQUCL76J2C","created_at":"2026-07-05T11:53:14.626010+00:00"},{"alias_kind":"pith_short_8","alias_value":"OB7ZRHGQ","created_at":"2026-07-05T11:53:14.626010+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.13690","citing_title":"The WidthWall: A Strict Expressivity Hierarchy for Hypergraph Neural Networks","ref_index":35,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OB7ZRHGQUCL76J2CJCRXZGW2RS","json":"https://pith.science/pith/OB7ZRHGQUCL76J2CJCRXZGW2RS.json","graph_json":"https://pith.science/api/pith-number/OB7ZRHGQUCL76J2CJCRXZGW2RS/graph.json","events_json":"https://pith.science/api/pith-number/OB7ZRHGQUCL76J2CJCRXZGW2RS/events.json","paper":"https://pith.science/paper/OB7ZRHGQ"},"agent_actions":{"view_html":"https://pith.science/pith/OB7ZRHGQUCL76J2CJCRXZGW2RS","download_json":"https://pith.science/pith/OB7ZRHGQUCL76J2CJCRXZGW2RS.json","view_paper":"https://pith.science/paper/OB7ZRHGQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.09427&json=true","fetch_graph":"https://pith.science/api/pith-number/OB7ZRHGQUCL76J2CJCRXZGW2RS/graph.json","fetch_events":"https://pith.science/api/pith-number/OB7ZRHGQUCL76J2CJCRXZGW2RS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OB7ZRHGQUCL76J2CJCRXZGW2RS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OB7ZRHGQUCL76J2CJCRXZGW2RS/action/storage_attestation","attest_author":"https://pith.science/pith/OB7ZRHGQUCL76J2CJCRXZGW2RS/action/author_attestation","sign_citation":"https://pith.science/pith/OB7ZRHGQUCL76J2CJCRXZGW2RS/action/citation_signature","submit_replication":"https://pith.science/pith/OB7ZRHGQUCL76J2CJCRXZGW2RS/action/replication_record"}},"created_at":"2026-07-05T11:53:14.626010+00:00","updated_at":"2026-07-05T11:53:14.626010+00:00"}