{"id":"W4413472863","doi":"10.61091/jcmcc126-23","title":"Constructing strong starters of orders 3p: triplication with SAT solver","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Computer science; Parallel computing; Boolean satisfiability problem; Problem solver; Solver; Arithmetic; Algorithm; Mathematics; Programming language; Computational science","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001090566,0.001345486,0.0009925308,0.0009876522,0.0009820529,0.001655106,0.001663022,0.0008937517,0.02795687],"category_scores_gemma":[0.003355413,0.0008744081,0.002279071,0.001208649,0.001337629,0.002942278,0.003467959,0.002802235,0.008848087],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000818109,"about_ca_system_score_gemma":0.001367468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007055273,"about_ca_topic_score_gemma":0.001974544,"domain_scores_codex":[0.9989593,0.0002410229,0.00006866059,0.0002705862,0.0002817448,0.0001786043],"domain_scores_gemma":[0.9981738,0.0009567409,0.0001155915,0.000434356,0.0002173885,0.0001020958],"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.0006393868,0.0004150573,0.001339123,0.001042479,0.0001416258,0.0006403162,0.0008005372,0.07207365,0.02242495,0.5641809,0.04234715,0.2939548],"study_design_scores_gemma":[0.0002998551,0.0004599972,0.0002560876,0.0001620924,0.0001386748,0.0002499256,0.0003137308,0.2299568,0.03422293,0.682874,0.05098593,0.00008005248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06102556,0.0002730679,0.8959125,0.0006013841,0.0002619487,0.0003960255,0.001400214,0.006561953,0.03356733],"genre_scores_gemma":[0.2797681,0.0002635399,0.6811848,0.0006173709,0.0001802755,0.0006403271,0.004845299,0.002668798,0.02983143],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02795687,"threshold_uncertainty_score":0.09352505,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006000475268581502,"score_gpt":0.2121616487559696,"score_spread":0.2061611734873881,"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."}}