{"id":"W2068865948","doi":"10.1016/j.ejc.2006.07.001","title":"Minimal paths and cycles in set systems","year":2006,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":27,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Combinatorics; Mathematics; Disjoint sets; Conjecture; Modulo; Disjoint union (topology); Family of sets; Set (abstract data type); Discrete mathematics","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.001372199,0.000117963,0.0002563139,0.0001553397,0.00006930649,0.0000504767,0.0002013851,0.00002635467,0.00000369429],"category_scores_gemma":[0.0001461263,0.00009084856,0.00005903832,0.0001267577,0.0000556452,0.00009129508,0.00007095579,0.0002489737,0.000001237511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002479361,"about_ca_system_score_gemma":0.00001319224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000177147,"about_ca_topic_score_gemma":4.505444e-7,"domain_scores_codex":[0.9985405,0.0004242286,0.0005689033,0.00008323995,0.0002311993,0.0001519312],"domain_scores_gemma":[0.999121,0.0002312719,0.0003591072,0.000135305,0.00009384612,0.00005952648],"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.00003696327,0.0000945849,0.016442,0.00008844041,0.00002066239,0.0007446987,0.0007081102,0.00002231189,0.00008598697,0.9775444,0.003812528,0.0003993222],"study_design_scores_gemma":[0.002261174,0.0003996371,0.07285468,0.0002534277,0.00004936168,0.0007906482,0.0006225661,0.00009016542,0.000090647,0.9132333,0.009072917,0.0002815164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9851865,0.001319312,0.0002364617,0.00003874025,0.0007490324,0.00005352982,0.000002816123,0.00001094081,0.01240269],"genre_scores_gemma":[0.9992159,0.00005817023,0.0003832011,0.00001303672,0.0001666301,1.745318e-7,3.248716e-7,0.00002605493,0.0001365246],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06431114,"threshold_uncertainty_score":0.3704697,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02241512389590421,"score_gpt":0.2542392567298244,"score_spread":0.2318241328339202,"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."}}