{"id":"W1572651318","doi":"10.1016/j.disc.2006.05.018","title":"A characterization of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si4.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>-comparability graphs","year":2006,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Bipartite graph; Mathematics; Comparability; Combinatorics; Graph; Transitive relation; Characterization (materials science); Path (computing); Discrete mathematics; Computer science","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","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.003155838,0.0009749446,0.0005323027,0.0007203884,0.001387068,0.001550385,0.003469922,0.001660278,0.1804625],"category_scores_gemma":[0.001679231,0.001749643,0.001909447,0.002183456,0.002411663,0.00216326,0.002600585,0.00159101,0.001618263],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002411728,"about_ca_system_score_gemma":0.001242108,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005702953,"about_ca_topic_score_gemma":0.0005014182,"domain_scores_codex":[0.9888258,0.000670083,0.002558029,0.001992061,0.003355326,0.002598719],"domain_scores_gemma":[0.9902014,0.001947569,0.002746569,0.003817717,0.0003325029,0.0009542853],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00084578,0.0006568991,0.00003898821,0.002762236,0.0009370885,0.0005610519,0.004215539,0.00133379,0.01267304,0.9323502,0.04229216,0.001333197],"study_design_scores_gemma":[0.00139523,0.001137337,0.0002348854,0.00130541,0.0006588034,0.0005524864,0.001106258,0.1603818,0.8275115,0.003391737,0.0009033801,0.001421147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6942892,0.0005647061,0.01657766,0.000481474,0.001516945,0.00009488749,0.0004503712,0.000271098,0.2857536],"genre_scores_gemma":[0.9838052,0.0005299336,0.01137057,0.0005483218,0.000876745,0.0007126142,0.001131993,0.0006026858,0.0004219421],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9289585,"threshold_uncertainty_score":0.999913,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02100426682101677,"score_gpt":0.257866261394366,"score_spread":0.2368619945733492,"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."}}