{"id":"W2784290514","doi":"10.1016/j.jco.2018.05.004","title":"The rank of random regular digraphs of constant degree","year":2018,"lang":"en","type":"preprint","venue":"Journal of Complexity","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"Agence Nationale de la Recherche","keywords":"Combinatorics; Adjacency matrix; Mathematics; Rank (graph theory); Degree (music); Eigenvalues and eigenvectors; Infinity; Constant (computer programming); Graph; Integer (computer science); Regular graph; Simple (philosophy); Adjacency list; Random graph; Discrete mathematics; Simple graph; Directed graph; Line graph; Graph power; Computer science; Physics","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":[],"consensus_categories":[],"category_scores_codex":[0.003012257,0.0001937681,0.000904131,0.0001305318,0.0001514109,0.00002376752,0.0009115468,0.0001447935,0.00007781929],"category_scores_gemma":[0.0006263494,0.0001210865,0.0007496961,0.0001498238,0.001427926,0.00003560296,0.0002404472,0.0005538997,0.000001213362],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001962059,"about_ca_system_score_gemma":0.0001811703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007299994,"about_ca_topic_score_gemma":0.00001876898,"domain_scores_codex":[0.9974189,0.0003712976,0.001448966,0.0001229158,0.0004794581,0.0001584145],"domain_scores_gemma":[0.993251,0.001603519,0.003268961,0.0008178795,0.0009816784,0.00007702101],"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.000698518,0.000223916,0.0001711501,0.0002746137,0.0004886913,0.000002056948,0.0003369849,0.000003258431,0.0006008195,0.9935704,0.003130763,0.0004988138],"study_design_scores_gemma":[0.001265911,0.00008958596,0.0007713221,0.0004414999,0.0002830042,0.00004131911,0.0001435455,0.00004144922,0.004539915,0.990612,0.001665979,0.000104418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9696606,0.001183155,0.01975066,0.0007216199,0.0004719315,0.0006343455,0.0001538623,0.00001514676,0.007408612],"genre_scores_gemma":[0.9755253,0.0002695209,0.02395768,0.0000131423,0.0001500124,0.000007022564,0.000002513095,0.00001840077,0.00005641605],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007352196,"threshold_uncertainty_score":0.5261252,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1607622231782364,"score_gpt":0.3530931797143105,"score_spread":0.1923309565360741,"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."}}