{"id":"bcea0dcb-5e84-40ac-b9a8-783a93efeb9b","arxiv_id":"2504.12011","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":4.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":5,"one_line_summary":"BSG adds neighbor, minimal, and divergence losses to graph self-supervised learning, balancing embedding smoothness and improving downstream node and link tasks.","lead":"This paper proposes a self-supervised graph learning method, BSG, that adds three loss terms to balance how similar a node's learned representation is to its neighbors. The authors report consistent accuracy gains over many baselines on node classification and link prediction benchmarks.","discovery_kind":"extension","skeptic_critique":null,"referee_report":null,"author_rebuttal":null,"desk_editor":null,"rs_alignment":null,"lean_confirmation":null,"pith_extraction":null,"created_at":"2026-08-16T12:40:46.792238+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":null,"supporting_citations":[],"review_version":1}