{"id":"W4409121235","doi":"10.1090/proc/17139","title":"Spanning trees in pseudorandom graphs via sorting networks","year":2025,"lang":"lv","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"Fondo Nacional de Desarrollo Científico y Tecnológico; Comisión Nacional de Investigación Científica y Tecnológica; European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Pseudorandom number generator; Spanning tree; Computer science; Sorting; Combinatorics; Mathematics; Algorithm","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001214875,0.0006423505,0.0006079377,0.001703709,0.001197526,0.002362602,0.001081967,0.001663761,0.01001843],"category_scores_gemma":[0.01194194,0.0005372945,0.00073741,0.002020743,0.001301145,0.004942648,0.002035039,0.001217664,0.002284442],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001817158,"about_ca_system_score_gemma":0.001207019,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001703985,"about_ca_topic_score_gemma":0.003247249,"domain_scores_codex":[0.9988594,0.0003878381,0.00007278424,0.0002525019,0.0002653582,0.0001621253],"domain_scores_gemma":[0.9936306,0.004046674,0.000685122,0.0007086469,0.0006004302,0.0003285207],"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.0002287373,0.00009760856,0.001811917,0.0002669066,0.00004112306,0.0003082991,0.0004882176,0.09814147,0.003836975,0.8221779,0.01254756,0.06005331],"study_design_scores_gemma":[0.0000654637,0.00004829651,0.0005805348,0.00006008467,0.00003261794,0.0002845124,0.0001292251,0.282874,0.002536765,0.7046699,0.008696014,0.00002262896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2335584,0.0007632752,0.7160298,0.003392126,0.0001377275,0.0002774042,0.001598552,0.002459083,0.04178357],"genre_scores_gemma":[0.7939205,0.001412339,0.1685396,0.001144465,0.000148489,0.0004955287,0.002446771,0.0006229962,0.03126928],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01001843,"threshold_uncertainty_score":0.03351504,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01756879409270014,"score_gpt":0.277140470574157,"score_spread":0.2595716764814569,"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."}}