{"id":"W4417194548","doi":"10.1007/s10107-025-02315-z","title":"Online Algorithms for Spectral Hypergraph Sparsification","year":2025,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Japan Society for the Promotion of Science","keywords":"Hypergraph; Multiplicative function; Exponential function; Computational complexity theory; Online algorithm; Exponential growth; Rank (graph theory); Space (punctuation)","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003582035,0.0001524205,0.0002211278,0.0001676476,0.0002125403,0.0002335221,0.00074623,0.00006679643,0.000008970564],"category_scores_gemma":[0.0001550914,0.0001381454,0.0001716317,0.0006792105,0.00009466171,0.000190008,0.0001539146,0.0001356671,0.00001479279],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000304178,"about_ca_system_score_gemma":0.00003667378,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000298939,"about_ca_topic_score_gemma":0.000001555198,"domain_scores_codex":[0.9986745,0.00002528892,0.000339395,0.0003883373,0.0001907195,0.0003818003],"domain_scores_gemma":[0.9989874,0.0002847422,0.00006219346,0.0005056229,0.0000851057,0.00007490783],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00000159771,0.0003325485,0.00001769778,0.00008392749,0.00001879676,0.000001133115,0.00009178383,0.000003509878,0.00004533194,0.6564105,0.0001410079,0.3428522],"study_design_scores_gemma":[0.0003096839,0.00007080544,0.0001618383,0.00007953067,0.00001829114,0.000007562876,0.0000690693,0.3117296,0.000601414,0.6712462,0.01553369,0.0001722595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001811297,0.0001174387,0.9935175,0.00227451,0.0002464049,0.0005625561,0.000004183937,0.0003658968,0.001100216],"genre_scores_gemma":[0.04360899,0.000004204906,0.9554896,0.0001864096,0.0000825864,0.0001290455,0.00001186927,0.000008703815,0.000478573],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3426799,"threshold_uncertainty_score":0.5633407,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05109511184521867,"score_gpt":0.3198945985697845,"score_spread":0.2687994867245658,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}