{"id":"W2605659461","doi":"10.1016/j.laa.2018.07.029","title":"Recovering the structure of random linear graphs","year":2018,"lang":"en","type":"preprint","venue":"Linear Algebra and its Applications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Combinatorics; Random graph; Mathematics; Random regular graph; Discrete mathematics; Path graph; Graph; Graph embedding; Line graph; Embedding; Graph power; 1-planar graph; Computer science","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.000110151,0.0002197908,0.0003576129,0.00007328515,0.0001926658,0.00003792534,0.0004070503,0.0001028041,0.0003119355],"category_scores_gemma":[0.000005096827,0.000162834,0.0001999181,0.0002321135,0.0001041487,0.00003180154,0.0004637608,0.0003924208,0.000007580605],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006306364,"about_ca_system_score_gemma":0.00004178964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007997891,"about_ca_topic_score_gemma":0.000009962414,"domain_scores_codex":[0.9989361,0.00004394453,0.0003733589,0.0003624278,0.0001297836,0.0001544504],"domain_scores_gemma":[0.998679,0.0001144445,0.0003126425,0.0006719675,0.0001699916,0.00005192769],"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.0001544536,0.0005442888,0.01373235,0.0006658481,0.003722513,4.258395e-7,0.001956216,0.003363461,0.01829781,0.8400431,0.01148555,0.1060339],"study_design_scores_gemma":[0.0009260367,0.00006123244,0.001404593,0.0002113123,0.0009996392,0.000001783582,0.0001461888,0.06447446,0.03858503,0.7978202,0.09442469,0.0009448006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7449371,0.001966127,0.243094,0.0006159801,0.000179371,0.003202648,0.001213305,0.0002317785,0.004559704],"genre_scores_gemma":[0.9944113,0.0001224193,0.003900518,0.00003345895,0.0009290563,0.0001256544,0.000319098,0.0000269359,0.000131594],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2494742,"threshold_uncertainty_score":0.6640179,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01123864451457831,"score_gpt":0.2680506862240013,"score_spread":0.256812041709423,"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."}}