{"id":"W2952000975","doi":"10.48550/arxiv.1109.0562","title":"A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Logical matrix; Binary number; Graph; Mathematics; Matrix (chemical analysis); Upper and lower bounds; Discrete mathematics; Physics; Chemistry; Arithmetic; Quantum mechanics","routes":{"ca_aff":true,"ca_fund":true,"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.001326505,0.001360819,0.001282384,0.001769901,0.002965784,0.003192958,0.001997019,0.002016467,0.007002383],"category_scores_gemma":[0.01495645,0.001355151,0.001027434,0.002055747,0.00291333,0.006025846,0.002687727,0.00343308,0.001305075],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001249903,"about_ca_system_score_gemma":0.001116427,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00130948,"about_ca_topic_score_gemma":0.001452911,"domain_scores_codex":[0.9977466,0.0003561259,0.000161652,0.0006205352,0.0005350536,0.0005800662],"domain_scores_gemma":[0.9802681,0.01330974,0.001894764,0.002064324,0.001179635,0.001283433],"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.003158549,0.000370241,0.01596186,0.001423511,0.0002013993,0.001927865,0.002683959,0.05579972,0.08889332,0.7018966,0.01570711,0.1119759],"study_design_scores_gemma":[0.0001222075,0.0004367625,0.003975749,0.0001594874,0.0001268471,0.001392583,0.0004199627,0.07779893,0.03086108,0.867906,0.01663755,0.0001628371],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6675446,0.00248972,0.2767844,0.003645657,0.0003056176,0.0002089415,0.002482434,0.001154709,0.04538385],"genre_scores_gemma":[0.9218377,0.001240431,0.06707483,0.0007875572,0.0002070277,0.0003899066,0.001507164,0.0005313203,0.006424043],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007002383,"threshold_uncertainty_score":0.02342528,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09947937265376473,"score_gpt":0.2435869787612181,"score_spread":0.1441076061074534,"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."}}