{"id":"W4323557190","doi":"10.4230/lipics.itcs.2024.55","title":"Electrical Flows for Polylogarithmic Competitive Oblivious Routing","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft; Austrian Science Fund; European Commission","keywords":"Routing (electronic design automation); Routing algorithm; Regular polygon; Tree (set theory); Computer science; Combinatorics; Scheme (mathematics); Mathematics; Discrete mathematics; Computer network; Routing protocol; Geometry","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001531209,0.001039289,0.0006404452,0.0008741519,0.001659051,0.003507816,0.002077455,0.001484839,0.0191332],"category_scores_gemma":[0.008895676,0.0005273374,0.0008336317,0.001453797,0.002501791,0.005948722,0.002350188,0.003151682,0.003551626],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004878155,"about_ca_system_score_gemma":0.002387433,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003025259,"about_ca_topic_score_gemma":0.00425857,"domain_scores_codex":[0.9980547,0.0004076542,0.0000773718,0.0003715314,0.0007211752,0.0003675907],"domain_scores_gemma":[0.9951609,0.002726967,0.0003385597,0.001223884,0.0003683688,0.0001813315],"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.0005252762,0.0001684062,0.0004092664,0.0003001057,0.00002524942,0.00009408115,0.0001465627,0.09491796,0.008805376,0.8202737,0.01539073,0.05894333],"study_design_scores_gemma":[0.00009330823,0.00006800636,0.0002655829,0.00004392865,0.0000275912,0.0001617814,0.00005496131,0.3229374,0.007168389,0.6408324,0.02831182,0.0000347862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04873154,0.001251007,0.8531138,0.004465112,0.0003125301,0.0003199815,0.0008001695,0.002410158,0.08859572],"genre_scores_gemma":[0.5647677,0.001463785,0.3926489,0.00193127,0.0004280711,0.0009654177,0.001103744,0.001169898,0.03552123],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0191332,"threshold_uncertainty_score":0.06400698,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1015721886456913,"score_gpt":0.2388495910131597,"score_spread":0.1372774023674684,"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."}}