{"id":"W4398180128","doi":"10.1007/978-3-031-59835-7_30","title":"Online Algorithms for Spectral Hypergraph Sparsification","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Hypergraph; Algorithm; Theoretical computer science; Discrete mathematics; Mathematics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007139561,0.0006148978,0.0005583962,0.001360026,0.0003097426,0.0008062962,0.003773909,0.0003258059,0.00001562204],"category_scores_gemma":[0.00005033833,0.000579991,0.0003505163,0.00106637,0.0007513263,0.0005149615,0.0009684277,0.0008950284,0.00004891086],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002529675,"about_ca_system_score_gemma":0.0004019621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001801822,"about_ca_topic_score_gemma":0.00005805338,"domain_scores_codex":[0.9956031,0.00001520516,0.0006152646,0.002089673,0.000881119,0.0007956696],"domain_scores_gemma":[0.9973508,0.0004605519,0.0002072392,0.001522391,0.0002655706,0.0001934404],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003539409,0.00007142938,0.000005312362,0.00007584537,0.00002389313,0.00004318238,0.0003007666,0.003776067,0.00007247877,0.3264778,0.00006790383,0.6690818],"study_design_scores_gemma":[0.0001290109,0.0001385315,0.00003421882,0.0002020437,0.00001105096,0.00005130026,1.408811e-7,0.4931099,0.0003406957,0.4997313,0.005819305,0.000432549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003518503,0.001306631,0.9889569,0.002251711,0.004719041,0.0006492409,0.00007466687,0.0003814436,0.001625224],"genre_scores_gemma":[0.008970366,0.000141142,0.9864017,0.0009344982,0.001736671,0.00002970344,0.00005322032,0.00006280141,0.001669946],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6686493,"threshold_uncertainty_score":0.9996651,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04017852604300817,"score_gpt":0.2785800312538569,"score_spread":0.2384015052108488,"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."}}