{"id":"W180549117","doi":"","title":"Maximum number of 3-paths in a graph.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; 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.0004649792,0.000114604,0.0001956185,0.0002057176,0.00004120557,0.0000263262,0.001026481,0.00005972957,0.00004146633],"category_scores_gemma":[0.00007769252,0.0001159053,0.00006697305,0.001618095,0.00009968229,0.0004039155,0.0002912535,0.0002007144,0.00008656435],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003591915,"about_ca_system_score_gemma":0.00004535302,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003869227,"about_ca_topic_score_gemma":0.000008301919,"domain_scores_codex":[0.9985973,0.0001223002,0.0002461704,0.0003108894,0.00034527,0.0003781212],"domain_scores_gemma":[0.9988905,0.0001536908,0.00006771925,0.0007020506,0.00009665425,0.00008941384],"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.00001562515,0.0001473769,0.06096207,0.00000684467,0.000005775693,0.00007188325,0.0002185145,0.000009286667,0.0003389078,0.9334273,0.00009665287,0.004699789],"study_design_scores_gemma":[0.0007065592,0.00005230538,0.009446759,0.00001982905,8.928023e-7,0.00002592554,0.00002239099,0.0004163343,0.001151148,0.9874479,0.0005896962,0.0001202889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9830787,0.0000989156,0.004606708,0.0002000036,0.0005951681,0.000167959,8.3624e-7,0.0000777261,0.01117404],"genre_scores_gemma":[0.9960585,0.00004795154,0.003650812,0.00004348906,0.000002203437,0.00001793046,6.310707e-7,0.00001043719,0.0001680474],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05402059,"threshold_uncertainty_score":0.4726483,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01570994867429192,"score_gpt":0.2926897269549101,"score_spread":0.2769797782806181,"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."}}