{"id":"W2898662501","doi":"10.1007/978-3-030-01325-7_17","title":"Explorable Families of Graphs","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Theoretical computer science; Graph; Mathematics; Discrete mathematics; Combinatorics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008139903,0.0003355493,0.0004361538,0.001110143,0.000162847,0.0002712405,0.003164548,0.0002089546,0.0001017002],"category_scores_gemma":[0.00007405593,0.0002978991,0.0001135643,0.0008854473,0.001192346,0.0007004113,0.001183937,0.000402412,0.00006577445],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008118692,"about_ca_system_score_gemma":0.000468194,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001621778,"about_ca_topic_score_gemma":0.00003234834,"domain_scores_codex":[0.9969994,0.00003228105,0.0004847509,0.001011114,0.0009690643,0.0005034322],"domain_scores_gemma":[0.9976055,0.0002348036,0.0002495912,0.001274322,0.0004939673,0.0001418319],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001141644,0.00009541916,0.000112907,0.0001692651,0.00003177154,0.00004599764,0.006262341,0.08348113,0.0003917232,0.2057785,0.0004279813,0.7031915],"study_design_scores_gemma":[0.000256214,0.0003267152,0.00002451631,0.0003755562,0.00000380066,0.00001643194,5.343779e-7,0.5100361,0.003228397,0.4821069,0.003104279,0.000520557],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00004940793,0.0002179025,0.9870093,0.0003138034,0.0009491412,0.0002728939,0.000003401226,0.0001145116,0.01106959],"genre_scores_gemma":[0.03802066,0.0003757019,0.9589092,0.00104438,0.0002020612,0.00001109689,0.000005490702,0.00003835235,0.001393051],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.702671,"threshold_uncertainty_score":0.9999473,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02724811559871579,"score_gpt":0.2538213882877647,"score_spread":0.2265732726890489,"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."}}