{"id":"W2579153743","doi":"","title":"Turan-type problem for a cycle of length 6 in bipartite Eulerian digraph.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Digraph; Mathematics; Bipartite graph; Eulerian path; Type (biology); Combinatorics; Pure mathematics; Graph; Biology","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.0006615344,0.0006650565,0.0009671744,0.0009289299,0.001684983,0.002121182,0.00179592,0.002580554,0.02110506],"category_scores_gemma":[0.004556892,0.0004285476,0.0007671991,0.0009823201,0.0009761085,0.003330142,0.001496363,0.001858619,0.001284241],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001701582,"about_ca_system_score_gemma":0.001676171,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003608769,"about_ca_topic_score_gemma":0.005526219,"domain_scores_codex":[0.9993796,0.0002358866,0.00003036649,0.000130063,0.00006252036,0.0001614264],"domain_scores_gemma":[0.9972963,0.001776723,0.0002248325,0.0002206132,0.0001641493,0.0003173538],"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.0007932927,0.0005554032,0.002891521,0.001032092,0.0002081249,0.0007432801,0.0006985211,0.1083053,0.004447627,0.7395462,0.07426874,0.06650981],"study_design_scores_gemma":[0.0001825949,0.0001726536,0.00159092,0.0001263527,0.00009603226,0.0004933025,0.0007543078,0.2670813,0.003830526,0.7091736,0.01643762,0.00006077103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.658342,0.00157555,0.1826233,0.009724932,0.0006919396,0.0006402361,0.00483047,0.001036333,0.1405352],"genre_scores_gemma":[0.90018,0.0005676218,0.05275596,0.0009729404,0.0002009413,0.0002809658,0.002591157,0.0001891944,0.04226119],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02110506,"threshold_uncertainty_score":0.07060343,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007220281594415526,"score_gpt":0.2022339823357442,"score_spread":0.1950137007413287,"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."}}