{"id":"W1706312069","doi":"10.1016/j.dam.2014.05.007","title":"On the van der Waerden numbers<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si167.gif\" display=\"inline\" overflow=\"scroll\"><mml:mstyle mathvariant=\"normal\"><mml:mi>w</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>;</mml:mo><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>","year":2014,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"","keywords":"Van der Waerden's theorem; Conjecture; Combinatorics; Mathematics; Upper and lower bounds; Solver; Heuristic; Algorithm; Discrete mathematics; Mathematical analysis","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","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.006903182,0.003452067,0.001562813,0.00152166,0.006246754,0.006137236,0.009762289,0.005614414,0.06503346],"category_scores_gemma":[0.003324498,0.005560599,0.005172417,0.003897214,0.005280651,0.00355685,0.00829623,0.005804083,0.008571585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001039042,"about_ca_system_score_gemma":0.002781519,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002212533,"about_ca_topic_score_gemma":0.001549714,"domain_scores_codex":[0.9723553,0.001277591,0.005756364,0.00568206,0.007789794,0.007138887],"domain_scores_gemma":[0.976655,0.006222455,0.006043863,0.007133588,0.00068291,0.003262186],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001721444,0.001258911,0.000008763396,0.002775782,0.003613181,0.001395206,0.006173065,0.002986734,0.002418191,0.7957249,0.1772109,0.004712906],"study_design_scores_gemma":[0.00555225,0.003596651,0.00005744905,0.003902868,0.004807777,0.004161098,0.006104105,0.2880603,0.6313552,0.03110983,0.01467272,0.006619786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5583548,0.002439783,0.02963053,0.002775002,0.008022109,0.0005651489,0.002424966,0.00185917,0.3939285],"genre_scores_gemma":[0.954663,0.001849468,0.02419579,0.004794092,0.005073473,0.003747445,0.002497457,0.002416322,0.0007629493],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7646151,"threshold_uncertainty_score":0.9997245,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01702655834171202,"score_gpt":0.2347572535155489,"score_spread":0.2177306951738369,"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."}}