{"id":"W4301487879","doi":"10.48550/arxiv.1109.0562","title":"A tight bound on the length of odd cycles in the incompatibility graph\\n of a non-C1P matrix","year":2011,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Binary number; Logical matrix; Graph; Mathematics; Matrix (chemical analysis); Upper and lower bounds; Discrete mathematics; Physics; Chemistry; Arithmetic; Quantum mechanics","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.001448604,0.001206352,0.0009637103,0.00159966,0.002793779,0.00297932,0.001901632,0.001800509,0.006730007],"category_scores_gemma":[0.01311718,0.001118639,0.0008710449,0.001628574,0.003229444,0.005674698,0.002515264,0.003549487,0.001041128],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001595548,"about_ca_system_score_gemma":0.00119373,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001767966,"about_ca_topic_score_gemma":0.002469712,"domain_scores_codex":[0.9980271,0.0003593831,0.0001258942,0.0005381618,0.0004495987,0.0004998227],"domain_scores_gemma":[0.983648,0.01183491,0.001160845,0.001663897,0.0008390773,0.0008532106],"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.00211994,0.0002920763,0.009627863,0.0009483407,0.0001439369,0.001077937,0.001920187,0.05941726,0.05075638,0.7567487,0.0177192,0.09922818],"study_design_scores_gemma":[0.00009478336,0.0003122047,0.003101371,0.0001466616,0.00009727207,0.000838714,0.0003238796,0.107842,0.02340145,0.846435,0.01727299,0.0001337759],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.552089,0.002930051,0.3621845,0.005455533,0.0003948673,0.0002129217,0.002524175,0.001269275,0.07293962],"genre_scores_gemma":[0.9247792,0.001415359,0.06191852,0.001048037,0.000225095,0.0003647161,0.001420741,0.0004469008,0.008381488],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006730007,"threshold_uncertainty_score":0.02251416,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05833929322000066,"score_gpt":0.1827294328882003,"score_spread":0.1243901396681997,"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."}}