{"id":"W4388482096","doi":"10.48550/arxiv.2311.03185","title":"Spanning trees in pseudorandom graphs via sorting networks","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Agencia Nacional de Investigación y Desarrollo; Centre National de la Recherche Scientifique; European Commission; Natural Sciences and Engineering Research Council of Canada; University of Warwick","keywords":"Combinatorics; Lambda; Disjoint sets; Mathematics; Logarithm; Spanning tree; Bounded function; Discrete mathematics; Vertex (graph theory); Sorting; Upper and lower bounds; Graph; Algorithm; Physics","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008263912,0.000348766,0.0005322976,0.0005930349,0.0001892513,0.0002322996,0.001529918,0.0004011312,0.00001011119],"category_scores_gemma":[0.00003187636,0.0003990355,0.0003333406,0.001321129,0.00005714436,0.0003579506,0.00149826,0.0009252525,0.00005613107],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001728716,"about_ca_system_score_gemma":0.00006720879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001070136,"about_ca_topic_score_gemma":0.001276846,"domain_scores_codex":[0.9973722,0.0002837988,0.0004608374,0.001213854,0.00009785223,0.0005714872],"domain_scores_gemma":[0.9981616,0.0002391763,0.0004068193,0.0009528316,0.0001087315,0.0001308292],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002281934,0.00002479802,0.01018847,0.00002814097,0.00005465496,0.0004804678,0.0002924305,0.9504191,0.00000467455,0.03750521,0.0003201553,0.0006591083],"study_design_scores_gemma":[0.0006053951,0.00002572346,0.001679138,0.0003287898,0.00001734532,0.00000752996,0.000114761,0.9663422,0.000004426277,0.03040187,0.00007093507,0.0004019437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09758103,0.0001058231,0.8973829,0.00006514634,0.002903413,0.0002923473,0.000001293643,0.0004858083,0.001182291],"genre_scores_gemma":[0.9977817,0.0001400602,0.0003643824,0.00005962063,0.0002185542,0.000003079072,0.000008568934,0.00003009483,0.001393968],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9002007,"threshold_uncertainty_score":0.9998462,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07785570620457882,"score_gpt":0.1943868824061837,"score_spread":0.1165311762016048,"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."}}