{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001039491,0.0004824085,0.0005819799,0.001057465,0.00104543,0.001306527,0.001048079,0.001076515,0.002922745],"category_scores_gemma":[0.01122545,0.0005602441,0.0004804646,0.001267205,0.00170474,0.004159607,0.001943147,0.0009778328,0.000470093],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001403374,"about_ca_system_score_gemma":0.0007149868,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008233449,"about_ca_topic_score_gemma":0.001567982,"domain_scores_codex":[0.9991297,0.0003588812,0.00004270004,0.0001938083,0.0001331724,0.0001416489],"domain_scores_gemma":[0.9932278,0.004310693,0.0008480935,0.000867679,0.0003265799,0.0004192146],"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.0005430671,0.0001325033,0.004556571,0.0003204083,0.00005854886,0.0003319927,0.0006614063,0.1532453,0.01499959,0.7622883,0.005947754,0.05691471],"study_design_scores_gemma":[0.00009913426,0.0001108174,0.001489333,0.00005622815,0.00005035911,0.0004464943,0.0001653079,0.3738446,0.005745794,0.6124967,0.00546546,0.00002967274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6779695,0.0009008481,0.306066,0.001856556,0.00005021567,0.0001360935,0.0005678851,0.0008378134,0.011615],"genre_scores_gemma":[0.9452521,0.000704611,0.04871671,0.0004514006,0.0000613376,0.0001737013,0.0004010482,0.000106006,0.004133227],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002922745,"threshold_uncertainty_score":0.01018226,"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."}}