{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009382363,0.0009009972,0.0008435289,0.001739763,0.002708574,0.003030189,0.001625811,0.002173574,0.02208195],"category_scores_gemma":[0.007574889,0.0006227452,0.001098914,0.001551631,0.001538015,0.006315933,0.002013594,0.001712174,0.003583681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009884773,"about_ca_system_score_gemma":0.001011626,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007389244,"about_ca_topic_score_gemma":0.001930297,"domain_scores_codex":[0.9989015,0.0002650911,0.00008665042,0.0002896719,0.0002055208,0.000251481],"domain_scores_gemma":[0.9905143,0.005629779,0.0009387005,0.0007886052,0.0008159103,0.001312639],"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.003082608,0.0005505085,0.01478654,0.003258189,0.0005282947,0.001539691,0.001806006,0.02293187,0.0564614,0.676735,0.04999219,0.1683277],"study_design_scores_gemma":[0.0001973781,0.0002707801,0.005481641,0.0003413341,0.0002879415,0.002661321,0.0008907722,0.02031305,0.01730379,0.9017227,0.0504517,0.00007763658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6745445,0.003346705,0.1447884,0.009575427,0.0005662479,0.0003126077,0.01964309,0.001999028,0.145224],"genre_scores_gemma":[0.818477,0.002081976,0.1411552,0.0008773261,0.0002526389,0.0003652903,0.007109514,0.0004601288,0.02922091],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02208195,"threshold_uncertainty_score":0.07387143,"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."}}