{"id":"W1965799704","doi":"10.1016/j.dam.2012.02.004","title":"On edge-sets of bicliques in graphs","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Wilfrid Laurier University; Simon Fraser University","funders":"Secretaría de Ciencia y Técnica, Universidad de Buenos Aires; Natural Sciences and Engineering Research Council of Canada; Fondation Sciences Mathématiques de Paris; Consejo Nacional de Investigaciones Científicas y Técnicas","keywords":"Combinatorics; Hypergraph; Mathematics; Bipartite graph; Complete bipartite graph; Intersection graph; Discrete mathematics; Graph; Line graph","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006414368,0.0001467086,0.0002501312,0.0002664146,0.00003420488,0.00002447682,0.0007191753,0.00005865552,0.00001569603],"category_scores_gemma":[0.00007243004,0.0001205265,0.00005939941,0.0005894735,0.0001029543,0.0002378698,0.0002270977,0.0001694094,0.0000803278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002285225,"about_ca_system_score_gemma":0.00001633087,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001475925,"about_ca_topic_score_gemma":0.000001271549,"domain_scores_codex":[0.9986796,0.00002847719,0.0003230277,0.000192214,0.0003600703,0.0004165525],"domain_scores_gemma":[0.9986415,0.0003810409,0.0001236906,0.0007231226,0.00002866397,0.0001020047],"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.000007931162,0.000167745,0.00008579752,0.00007436854,0.000007046482,9.347208e-7,0.001834715,0.0000202869,0.002678958,0.9920116,0.00005267183,0.003057946],"study_design_scores_gemma":[0.0002457895,0.00004541871,0.0003015914,0.00005042423,0.000002655348,0.000002081132,0.0001737169,0.00156314,0.03022722,0.9671672,0.00006092845,0.0001598531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3734639,0.0001771975,0.5474705,0.0001284669,0.0001332493,0.0007898152,0.000008412239,0.0001903575,0.07763813],"genre_scores_gemma":[0.8631328,0.0000136942,0.1367023,0.00005019816,0.000008545822,0.00004605628,0.000001668814,0.00001559972,0.00002914478],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4896689,"threshold_uncertainty_score":0.4914928,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02616491105721845,"score_gpt":0.3129889405099723,"score_spread":0.2868240294527539,"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."}}