{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000296249,0.0002281969,0.0003893308,0.0002087201,0.00008532849,0.00002736292,0.0002211896,0.000133714,0.00006153645],"category_scores_gemma":[0.00005045243,0.0002370544,0.0001383892,0.0008968121,0.00006636335,0.000185399,0.00002927481,0.0001793867,0.00003390287],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003782142,"about_ca_system_score_gemma":0.00001702744,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006681868,"about_ca_topic_score_gemma":0.00001277992,"domain_scores_codex":[0.998672,0.0001132385,0.0004161471,0.000207731,0.0002059721,0.0003849037],"domain_scores_gemma":[0.999181,0.0001449259,0.0000826629,0.0003761038,0.00009249879,0.0001228346],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002473264,0.0003510813,0.5127391,0.0003326793,0.0007239304,0.0001333287,0.002222744,0.00140487,0.03950493,0.4335896,0.006043978,0.002706437],"study_design_scores_gemma":[0.005890885,0.0005096602,0.3776484,0.0009306673,0.0002136105,0.00009754903,0.0008512674,0.01908328,0.06115864,0.5213684,0.01022963,0.002018001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9863895,0.001072455,0.00001103531,0.000009628557,0.002038009,0.0001822556,0.00000801302,0.001501814,0.008787242],"genre_scores_gemma":[0.9995988,0.00007463742,0.00004358035,0.00001252503,0.000009794066,0.00003090595,0.00001410196,0.00005077575,0.0001648696],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1350907,"threshold_uncertainty_score":0.9666797,"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."}}