{"id":"W4297416040","doi":"10.4230/lipics.cp.2022.6","title":"Acquiring Maps of Interrelated Conjectures on Sharp Bounds","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"","keywords":"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.005148218,0.0009535504,0.001417507,0.002721493,0.001532276,0.004841107,0.001809704,0.001760352,0.007434845],"category_scores_gemma":[0.02786542,0.001499386,0.001482436,0.001966651,0.003977051,0.0124057,0.007872616,0.004718606,0.001308237],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001885267,"about_ca_system_score_gemma":0.00140777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006438129,"about_ca_topic_score_gemma":0.0005246801,"domain_scores_codex":[0.9957718,0.001089437,0.0003579962,0.001326945,0.001055351,0.0003983079],"domain_scores_gemma":[0.9754146,0.01369352,0.001497772,0.006635617,0.001869134,0.0008892988],"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.0006365291,0.0003528944,0.01190731,0.0005601611,0.0001023359,0.0004068446,0.002006308,0.06625377,0.03167404,0.7691119,0.004136991,0.1128509],"study_design_scores_gemma":[0.00007480904,0.0002987314,0.001710471,0.00006206846,0.00006370102,0.0002230016,0.0005910792,0.2467556,0.03291675,0.7101067,0.007114664,0.00008240287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2792302,0.0002467291,0.7060214,0.0008399644,0.0000706827,0.0001850039,0.0004251604,0.002242378,0.0107384],"genre_scores_gemma":[0.7686003,0.0001676761,0.2265036,0.0002009474,0.00006702034,0.0002333062,0.0007455075,0.0004654002,0.003016305],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007434845,"threshold_uncertainty_score":0.02722669,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02198069804840611,"score_gpt":0.2693342674417731,"score_spread":0.247353569393367,"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."}}