{"id":"W3099726793","doi":"10.29007/91wj","title":"The SAT+CAS Method for Combinatorial Search with Applications to Best Matrices","year":2019,"lang":"en","type":"paratext","venue":"EasyChair preprint","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"DPLL algorithm; Mathematics; Satisfiability; Combinatorics; Solver; Conjecture; Computer science; Discrete mathematics; Mathematical optimization","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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000943178,0.0003353785,0.0003968822,0.00009527826,0.0002522294,0.0001620659,0.0007424236,0.0002453208,0.00008415496],"category_scores_gemma":[0.00001073296,0.0002438719,0.0001580307,0.0002759037,0.00003588116,0.00003913915,0.0001181736,0.0004120178,0.008830937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001009638,"about_ca_system_score_gemma":0.00007426539,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004451481,"about_ca_topic_score_gemma":0.00002170134,"domain_scores_codex":[0.99832,0.0001281649,0.0003430608,0.0005057314,0.0002749565,0.0004280362],"domain_scores_gemma":[0.9980575,0.0004443387,0.00007741445,0.001133864,0.0001447945,0.0001421286],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002354847,0.00008867118,0.00003165617,0.001332967,0.0005444594,7.485771e-7,0.001224039,0.8586217,0.0004235696,0.08836553,0.0377306,0.01140061],"study_design_scores_gemma":[0.0004903905,0.0001620637,0.00002961821,0.0001862655,0.00002039021,0.00001007463,0.0004383397,0.004127254,0.001281865,0.002192338,0.9905759,0.0004855595],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003427273,0.001331652,0.935784,0.0001230764,0.004038183,0.005234304,0.0001705261,0.0001568331,0.05281863],"genre_scores_gemma":[0.8760073,0.0003808993,0.0119837,0.00006188781,0.003139473,0.01654684,0.000234119,0.0004017683,0.09124397],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9528452,"threshold_uncertainty_score":0.9944808,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0171623392903355,"score_gpt":0.3016068056143432,"score_spread":0.2844444663240077,"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."}}