{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007467491,0.001098308,0.0007332996,0.002524684,0.001417803,0.00447251,0.001128697,0.0007978331,0.1820387],"category_scores_gemma":[0.006495078,0.0006645758,0.0008545483,0.002862033,0.001445446,0.005749709,0.00218589,0.002966398,0.09848022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001492939,"about_ca_system_score_gemma":0.0009045489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003564165,"about_ca_topic_score_gemma":0.005411726,"domain_scores_codex":[0.9990019,0.0002224853,0.00006134045,0.0002010018,0.0004162614,0.00009710417],"domain_scores_gemma":[0.9987881,0.0005293919,0.00005624846,0.0001965737,0.000343071,0.00008673665],"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.00008818036,0.00002216287,0.0001737936,0.0001444278,0.000009788674,0.0001028102,0.0003167871,0.001356307,0.001140153,0.6814299,0.2318821,0.0833336],"study_design_scores_gemma":[0.00002003351,0.00001719895,0.0004107,0.0001355565,0.00000879454,0.0001629794,0.0001217642,0.004683301,0.001589122,0.4087635,0.5840569,0.00003020906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.00710948,0.002320056,0.2266179,0.005070501,0.006317603,0.0001224622,0.004654713,0.002580131,0.7452071],"genre_scores_gemma":[0.1319762,0.005437568,0.1781779,0.001866273,0.001827665,0.0004182383,0.00967144,0.007196474,0.6634282],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.1820387,"threshold_uncertainty_score":0.6089801,"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."}}