{"id":"W2579550659","doi":"10.1090/dimacs/069/11","title":"How far is, should and could be conjecture-making in graph theory an automated process?","year":2007,"lang":"en","type":"book-chapter","venue":"DIMACS series in discrete mathematics and theoretical computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Computer science; Process (computing); Conjecture; Graph; Graph theory; Mathematics; Theoretical computer science; Combinatorics; Programming language","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","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002977581,0.0007232992,0.0008386245,0.0008250354,0.0003852498,0.001523263,0.001943024,0.0003901725,0.00001900725],"category_scores_gemma":[0.00009436061,0.0005793929,0.00009512642,0.0005958669,0.006364327,0.00134584,0.001233334,0.0008337875,0.000001118236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000043269,"about_ca_system_score_gemma":0.0001023005,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.410183e-7,"about_ca_topic_score_gemma":0.000007652429,"domain_scores_codex":[0.9961138,0.00007862588,0.0006669909,0.001405971,0.0009049309,0.0008296763],"domain_scores_gemma":[0.99782,0.0004373809,0.0002905334,0.0009929155,0.0001529249,0.0003062808],"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.0000188908,0.00004535646,0.000008923223,0.000205929,0.0000141954,0.0001069617,0.00508309,0.00001903197,0.00001341859,0.9878453,0.000002065584,0.006636859],"study_design_scores_gemma":[0.0002509897,0.0002435098,0.00002217016,0.0004889229,0.00001491205,0.0001568219,0.0001740513,0.2011207,0.0001523241,0.7966199,0.0001385286,0.0006171865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006589992,0.0008310701,0.9560279,0.001331441,0.0004892957,0.001003824,0.00005255427,0.0005472901,0.03312668],"genre_scores_gemma":[0.8269851,0.0002943499,0.1704107,0.00148208,0.0001014534,0.00002709668,0.00001143039,0.00009992701,0.0005879286],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8203951,"threshold_uncertainty_score":0.9996657,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02330091641513424,"score_gpt":0.295659915652048,"score_spread":0.2723589992369137,"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."}}