{"id":"W4302064060","doi":"","title":"Homomorphisms of signed bipartite graphs","year":2013,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Bipartite graph; Homomorphism; Signed graph; Combinatorics; Computer science; Mathematics; Discrete mathematics; Graph","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004000416,0.0003410784,0.0005259947,0.0002535996,0.0002456151,0.0001439925,0.001334871,0.0003240699,0.0005060988],"category_scores_gemma":[0.001311735,0.0003490577,0.0003603173,0.0004656652,0.0004467534,0.00009509923,0.0009158981,0.000524076,0.00008032039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003402272,"about_ca_system_score_gemma":0.0001282772,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003064653,"about_ca_topic_score_gemma":0.0001710316,"domain_scores_codex":[0.9948322,0.003125993,0.0007581254,0.000601751,0.0003691073,0.0003128855],"domain_scores_gemma":[0.991667,0.002466224,0.0008883813,0.002888397,0.0019216,0.0001683628],"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.000004122797,0.0005519586,0.0001494527,0.0002250132,0.00008097783,6.265914e-7,0.002597853,0.000005595774,0.006881102,0.984809,0.001796945,0.002897304],"study_design_scores_gemma":[0.0002700963,2.925339e-7,0.0004330411,0.0009500555,0.00009054675,0.00000327182,0.00007557265,0.000949358,0.08162793,0.9130906,0.002184544,0.0003247356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8232384,0.0006731612,0.09932967,0.004273285,0.000186262,0.001401575,0.0002157372,0.0004438106,0.07023814],"genre_scores_gemma":[0.9221177,0.0001884514,0.07133735,0.00003851343,0.00001213507,0.0003077263,0.0002279294,0.00006021385,0.005710024],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0988793,"threshold_uncertainty_score":0.9998962,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02643762645179724,"score_gpt":0.2541438144133301,"score_spread":0.2277061879615328,"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."}}