{"id":"W1996888602","doi":"10.1016/j.disc.2011.05.037","title":"Decomposition tree of a lexicographic product of binary structures","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Lexicographical order; Binary number; Mathematics; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003047067,0.0001222048,0.0002443351,0.0002653309,0.00004000151,0.00001130274,0.0008283764,0.00003314892,0.00002207723],"category_scores_gemma":[0.00006270997,0.0000969924,0.0001097094,0.0006007761,0.0002299809,0.0002567446,0.0002225862,0.00009197275,0.000002517437],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006312698,"about_ca_system_score_gemma":0.00002519552,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004921362,"about_ca_topic_score_gemma":0.000002128838,"domain_scores_codex":[0.9988413,0.00006439597,0.0003613394,0.0002154997,0.0003244101,0.0001930819],"domain_scores_gemma":[0.998688,0.00008249513,0.0002451669,0.0008032786,0.0001285325,0.00005256556],"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.00002698624,0.00019559,0.0005558327,0.0004043138,0.0000516111,0.000005576103,0.005448732,0.00002063141,0.05550247,0.9332846,0.00001797593,0.004485626],"study_design_scores_gemma":[0.0001902574,0.0002523184,0.004686013,0.00008346193,0.00001385737,0.00001511946,0.0001821357,0.004741866,0.1963021,0.7933913,0.000005312635,0.000136224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6192247,0.0002153712,0.3750899,0.00003617761,0.00007158386,0.0003668503,0.00001023508,0.00007662968,0.004908581],"genre_scores_gemma":[0.7362888,0.000009676794,0.2636562,0.000003639225,0.000006140804,0.000007418237,0.000001672244,0.000008932419,0.00001754758],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1407997,"threshold_uncertainty_score":0.3955235,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04022835857118656,"score_gpt":0.3115154555253675,"score_spread":0.2712870969541809,"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."}}