{"id":"W3046477764","doi":"10.19086/da.12058","title":"Finitely forcible graphons with an almost arbitrary structure","year":2020,"lang":"en","type":"article","venue":"Discrete Analysis","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"Engineering and Physical Sciences Research Council; Grantová Agentura České Republiky; European Commission; Leverhulme Trust; National Science Foundation","keywords":"Combinatorics; Mathematics; Statement (logic); Graph; Random graph; Discrete mathematics","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.00009861221,0.0002880071,0.000538888,0.000243883,0.0003175965,0.00007981164,0.0004252647,0.0001145744,0.0008286494],"category_scores_gemma":[0.00009730367,0.0001931089,0.000384031,0.001977826,0.0001379642,0.000242704,0.00008695193,0.0002774113,0.000003061025],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008515392,"about_ca_system_score_gemma":0.00002513238,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003608945,"about_ca_topic_score_gemma":0.0001933784,"domain_scores_codex":[0.998423,0.0001028077,0.0003035635,0.0004866338,0.0003619638,0.0003220499],"domain_scores_gemma":[0.9986579,0.0001735608,0.0001571652,0.0006588294,0.00007177673,0.0002807521],"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.0009675893,0.0001281884,0.0933628,0.0002797624,0.01532565,0.0002230339,0.01989486,0.001927336,0.001095432,0.8630043,0.002209555,0.001581462],"study_design_scores_gemma":[0.001178902,0.0008284174,0.01074117,0.00002857785,0.01067908,0.00001349513,0.003822246,0.01643734,0.003379387,0.9496696,0.001856654,0.001365134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9847443,0.0001075307,0.009370248,0.0005104254,0.00003679414,0.00017858,0.0003061096,0.0001799488,0.004566036],"genre_scores_gemma":[0.9849117,0.00001174549,0.013595,0.001066085,0.0001152655,0.000006439399,0.0001739763,0.00004167023,0.00007806716],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08666527,"threshold_uncertainty_score":0.907313,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03519003951355038,"score_gpt":0.2907537146227275,"score_spread":0.2555636751091771,"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."}}