{"id":"W206202451","doi":"","title":"Directed Bipartite Graphs Containing Every Possible Pair of Directed Cycles.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Discrete mathematics; Graph","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.0005776316,0.0009173047,0.0007098612,0.002412798,0.002184738,0.002713713,0.001295613,0.00192705,0.02238741],"category_scores_gemma":[0.004521437,0.0006464223,0.0006631982,0.002197196,0.00120826,0.00328747,0.001463467,0.001406332,0.004228916],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009707161,"about_ca_system_score_gemma":0.001113181,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001371797,"about_ca_topic_score_gemma":0.002355466,"domain_scores_codex":[0.9987875,0.0004167551,0.00007045289,0.0003483709,0.0001927428,0.0001841436],"domain_scores_gemma":[0.9972743,0.001453048,0.000341575,0.0003228852,0.0003901523,0.0002180529],"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.0002867907,0.0001619117,0.001066868,0.0006048307,0.0001308681,0.0009831941,0.0002905006,0.004901014,0.00767803,0.9079763,0.02169476,0.05422488],"study_design_scores_gemma":[0.00005481802,0.00004853422,0.0005813471,0.000191268,0.00009839203,0.001077849,0.0002825734,0.01505704,0.004087843,0.8985712,0.07990839,0.00004072991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1079217,0.003142566,0.6035883,0.002854136,0.000969348,0.0008742017,0.01560857,0.001759375,0.2632818],"genre_scores_gemma":[0.6087632,0.002812575,0.2896019,0.00206497,0.0004411102,0.001384346,0.01414157,0.0003758205,0.08041465],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02238741,"threshold_uncertainty_score":0.07489336,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009180906024946346,"score_gpt":0.2063024404419248,"score_spread":0.1971215344169784,"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."}}