{"id":"W2086629303","doi":"10.1016/j.disc.2005.03.005","title":"Supersolvable LL-lattices of binary trees","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Combinatorics; Binary number; Discrete mathematics; Binary tree; Arithmetic","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.0006727573,0.0006934356,0.001303056,0.001304492,0.002502328,0.00517721,0.001292226,0.000982797,0.01183799],"category_scores_gemma":[0.003480289,0.001027136,0.001091216,0.001319801,0.002347934,0.004110544,0.002739769,0.004132924,0.002091036],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001546347,"about_ca_system_score_gemma":0.0008939706,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001433177,"about_ca_topic_score_gemma":0.002870455,"domain_scores_codex":[0.9985754,0.0003563137,0.00009080225,0.000199713,0.0003992419,0.000378427],"domain_scores_gemma":[0.9963731,0.00190626,0.0003663737,0.0003729583,0.0003563109,0.0006249173],"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.0002683878,0.00009129955,0.0006100174,0.0001448212,0.00002411354,0.000270023,0.0007092648,0.002309183,0.003461205,0.97488,0.00432195,0.01290965],"study_design_scores_gemma":[0.00004657225,0.00001707238,0.0001830924,0.00002210721,0.00001582205,0.0001349364,0.0002342918,0.004729831,0.001273188,0.9888265,0.00450161,0.00001489501],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6822551,0.001490095,0.1351011,0.003164649,0.0003313332,0.0001497186,0.001723196,0.0009856968,0.1747991],"genre_scores_gemma":[0.9286853,0.0006598493,0.0379234,0.0007078158,0.0003499926,0.0001608601,0.002018569,0.0002723465,0.02922193],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01183799,"threshold_uncertainty_score":0.03960204,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04033738929752605,"score_gpt":0.3223062354964241,"score_spread":0.2819688461988981,"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."}}