{"id":"W2223734161","doi":"10.1016/j.ejc.2016.09.004","title":"Uniform linear embeddings of graphons","year":2016,"lang":"en","type":"preprint","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Embedding; Combinatorics; Mathematics; Vertex (graph theory); Random graph; Space (punctuation); Discrete mathematics; Random element; Graph; Random variable; Statistics; Computer science","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002681229,0.0003631132,0.0008567095,0.0004573309,0.0001131339,0.00002853059,0.001354455,0.0001410059,0.00005411818],"category_scores_gemma":[0.0008569291,0.0002457626,0.0006957729,0.0001955253,0.0002084428,0.0000896803,0.0009891829,0.001207822,0.000004489279],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006433888,"about_ca_system_score_gemma":0.0001236711,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.095307e-7,"about_ca_topic_score_gemma":6.369241e-8,"domain_scores_codex":[0.9968308,0.000546886,0.001473424,0.0001993342,0.0006781874,0.0002714],"domain_scores_gemma":[0.9948701,0.0004767757,0.002831915,0.0007294034,0.0009035811,0.0001882684],"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.00009484767,0.0001896973,0.0004271604,0.0005020376,0.0004388826,0.0002471379,0.00157913,0.00001644813,0.000136209,0.9875106,0.007797804,0.001060007],"study_design_scores_gemma":[0.000931186,0.000315331,0.0003121105,0.0009845231,0.0002062183,0.000114279,0.00007955695,0.00001183623,0.0009936191,0.9886004,0.007163349,0.0002876412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8411982,0.001423473,0.03375793,0.0003288938,0.01245014,0.0003659088,0.00009958287,0.00008844093,0.1102874],"genre_scores_gemma":[0.9929487,0.000479545,0.005479568,0.00003259179,0.0004352183,3.812886e-7,0.000001358229,0.0001089659,0.0005136441],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1517505,"threshold_uncertainty_score":0.9999995,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03627176269484287,"score_gpt":0.2972184459093014,"score_spread":0.2609466832144585,"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."}}