{"paper":{"title":"HyBridge: Bridge-Guided Self-Supervised Hyperbolic Hypergraph Representation Learning","arxiv_id":"2611.16351","primary_cat":"cs.SI","submitted_at":"2026-11-12T06:10:00+00:00","version_compiled":"v1"},"notice":"Every quoted sentence is the authors' text from the arXiv listing abstract. Labels and probabilities are the outputs of classifier-1.13.0 on the question bank abstract-p1-20260923, exactly as returned. No sentence in this record was written by a language model.","schema":"pith.compiled-record/v0","status":"compiled","abstract":{"source":"arXiv listing abstract v1","sentences":[{"i":0,"p":1.0,"id":"s0","own":false,"role":"background","text":"Hypergraphs capture groupwise relationships among multiple nodes and often exhibit tree-like structures.","hedge":{"p":0.83,"label":"asserted"},"own_p":0.07,"main_claim_p":0.01,"quantitative":false,"quantitative_p":0.04,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.0,"background":1.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":1,"p":0.69,"id":"s1","own":false,"role":"gap","text":"Although hyperbolic space is well suited for modeling such structures, simply extending existing hypergraph representation learning (HRL) methods to hyperbolic space does not consistently improve performance.","hedge":{"p":0.94,"label":"asserted"},"own_p":0.12,"main_claim_p":0.04,"quantitative":false,"quantitative_p":0.13,"role_probabilities":{"gap":0.69,"method":0.0,"result":0.0,"background":0.31,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":2,"p":0.98,"id":"s2","own":true,"role":"result","text":"In this paper, we investigate the relationship between node structural properties and hyperbolic embedding radii and find that bridge nodes tend to lie closer to the center in graphs, whereas this relationship is not consistently observed in hypergraphs.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.95,"main_claim_p":0.09,"quantitative":false,"quantitative_p":0.44,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.98,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.02,"interpretation":0.0}},{"i":3,"p":0.86,"id":"s3","own":true,"role":"result","text":"We further find that conventional bridge score estimation may fail to capture the groupwise connectivity of hypergraphs.","hedge":{"p":0.86,"label":"hedged_possibility"},"own_p":0.8,"main_claim_p":0.04,"quantitative":false,"quantitative_p":0.04,"role_probabilities":{"gap":0.13,"method":0.0,"result":0.86,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.01}},{"i":4,"p":0.66,"id":"s4","own":true,"role":"method","text":"Motivated by these findings, we propose HyBridge, a self-supervised hyperbolic HRL framework that (1) estimates node bridge scores by considering the external connectivity of individual hyperedges, (2) learns node and hyperedge embeddings through hyperbolic hypergraph encoding, (3) guides node radial positions according to their bridge scores, and (4) employs contrastive learning to preserve node discriminability.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.87,"main_claim_p":0.15,"quantitative":false,"quantitative_p":0.29,"role_probabilities":{"gap":0.0,"method":0.66,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.34,"interpretation":0.0}},{"i":5,"p":1.0,"id":"s5","own":true,"role":"result","text":"Extensive experiments on 10 real-world hypergraphs demonstrate that HyBridge outperforms 22 competing methods, achieving performance improvements of up to 9.82% in node classification.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.97,"main_claim_p":0.78,"quantitative":true,"quantitative_p":0.99,"role_probabilities":{"gap":0.0,"method":0.0,"result":1.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":6,"p":0.64,"id":"s6","own":true,"role":"contribution","text":"For reproducibility, we provide the code at https://anonymous.4open.science/r/HyBridge/.","hedge":{"p":0.95,"label":"asserted"},"own_p":0.68,"main_claim_p":0.02,"quantitative":false,"quantitative_p":0.05,"role_probabilities":{"gap":0.0,"method":0.07,"result":0.02,"background":0.01,"limitation":0.01,"future_work":0.25,"contribution":0.64,"interpretation":0.0}}]},"compiled":{"main_claim":{"p":0.99,"text":"Extensive experiments on 10 real-world hypergraphs demonstrate that HyBridge outperforms 22 competing methods, achieving performance improvements of up to 9.82% in node classification.","location":"abstract s5","hedge_strength":{"p":1.0,"label":"asserted"}},"provenance":{"route":{"via":"TypeSafe API","model":"classifier-1.13.0","endpoint":"https://api.typesafe.ai/v1/systemone","provider":"TypeSafe"},"packing":"one request per paper","requests":1,"input_tokens":5794,"cost_usd_reported":0.0},"compiled_at":"2026-11-13","bank_version":"abstract-p1-20260923","model_version":"classifier-1.13.0","abstract_states":{"claims_first":0.05,"states_limitation":0.14,"human_participants":0.03,"controlled_comparison":0.66,"randomized_assignment":0.01,"states_quantitative_result":0.99,"compares_with_prior_results":0.96,"mentions_code_or_data_availability":0.99},"evidential_basis":{"p":0.98,"value":"observation or experiment","probabilities":{"argument":0.0,"literature":0.0,"proof_or_derivation":0.0,"analysis_of_existing_data":0.0,"observation_or_experiment":0.98,"simulation_or_computation":0.02}},"contribution_type":{"p":1.0,"value":"method or tool","probabilities":{"review":0.0,"method_or_tool":1.0,"empirical_study":0.0,"simulation_study":0.0,"theoretical_result":0.0,"dataset_or_benchmark":0.0,"position_or_commentary":0.0}},"contribution_statement":{"p":1.0,"text":"Motivated by these findings, we propose HyBridge, a self-supervised hyperbolic HRL framework that (1) estimates node bridge scores by considering the external connectivity of individual hyperedges, (2) learns node and hyperedge embeddings through hyperbolic hypergraph encoding, (3) guides node radial positions according to their bridge scores, and (4) employs contrastive learning to preserve node discriminability.","location":"abstract s4"}},"coverage":{"tier":"abstract","levels_run":["P abstract"],"not_examined":["full text","figures and tables","references and citing sentences","relations to other papers"],"sources_read":["arXiv listing abstract v1"],"levels_not_run":["S sections","T body sentences","C citations","R cross-paper relations"],"sentences_examined":7,"sentences_in_abstract":7},"measured_accuracy":{"url":"https://pith.science/accuracy","measured_on":"2026-10-02","method":"two independent model families labelled a fresh random sample blind; the figure is how often the published label matches their consensus","sentence_role_agreement":0.92,"main_claim_agreement":0.908,"typed_citation_agreement":0.933,"typed_citation_agreement_95_interval":[0.917,0.945],"review_comments_accurate":0.758,"review_comments_accurate_95_interval":[0.684,0.82],"review_caught_admitted_error_found_or_related":0.448,"review_comments_judged":{"judged_by":["gpt-5.6-luna","grok-4.7"],"judged_against":"Pith's own text copy of each paper: text extracted from the PDF, the first 90,000 characters","measured_on":"2026-10-04","accurate":113,"decided":149,"sampled_reviews":200,"split_by_lane":false,"by_lane":"https://pith.science/accuracy#by-lane"}}}