{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00149125,0.001004086,0.000899551,0.002076587,0.0005870431,0.001786364,0.001579626,0.001476819,0.003239995],"category_scores_gemma":[0.0151282,0.0008960526,0.0006063479,0.001483085,0.001993593,0.004444555,0.0015079,0.002392354,0.0009121026],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008307599,"about_ca_system_score_gemma":0.0007575282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002268579,"about_ca_topic_score_gemma":0.002160675,"domain_scores_codex":[0.9991686,0.0003711936,0.00002222116,0.0002185459,0.0001410995,0.00007825334],"domain_scores_gemma":[0.9927885,0.004754914,0.0007979763,0.00094188,0.0004231005,0.0002936232],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001962659,0.0001676007,0.003173973,0.0002996928,0.0001302928,0.0002161336,0.0002604059,0.3710516,0.007565067,0.540607,0.01089205,0.06543992],"study_design_scores_gemma":[0.00001007602,0.00001152326,0.0005185023,0.00001222336,0.00000872715,0.00003530945,0.00003495187,0.6734594,0.0007409048,0.3241172,0.001034612,0.00001646189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09628554,0.0006541677,0.8941427,0.001945778,0.0001122505,0.00004547311,0.0008060978,0.0005058976,0.005502063],"genre_scores_gemma":[0.8881578,0.001517387,0.09566273,0.0005300956,0.0005479183,0.0001066114,0.001411945,0.0002570707,0.01180845],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003239995,"threshold_uncertainty_score":0.01083887,"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."}}