{"id":"W2293521544","doi":"","title":"A Linear Time Algorithm for Computing Longest Paths in 2-Trees","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Time complexity; Algorithm; Running time; Computer science; Combinatorics","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.0009558043,0.002034915,0.001741255,0.002493402,0.001738011,0.003588888,0.003831375,0.002427332,0.01890895],"category_scores_gemma":[0.00459556,0.001146774,0.002033366,0.005336051,0.001134633,0.00753861,0.003263904,0.002506726,0.005029812],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002529545,"about_ca_system_score_gemma":0.003362424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005624803,"about_ca_topic_score_gemma":0.01267621,"domain_scores_codex":[0.9984385,0.0002036313,0.000131779,0.0005234102,0.0004383123,0.0002643158],"domain_scores_gemma":[0.9970185,0.00172719,0.0001963106,0.0005548861,0.0003012656,0.0002018024],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001371592,0.0008894181,0.002274275,0.001544744,0.0002256505,0.0002471177,0.0005889575,0.04497622,0.02740969,0.04089949,0.03899662,0.8405762],"study_design_scores_gemma":[0.001653113,0.0008953967,0.00322507,0.0002468939,0.0005086377,0.0009940289,0.00105454,0.5658602,0.02936966,0.3507782,0.04517484,0.0002393343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06516807,0.001405213,0.8975995,0.001411522,0.000321064,0.0006738502,0.003042698,0.0148486,0.01552942],"genre_scores_gemma":[0.1042168,0.0003119442,0.8825235,0.0002972914,0.0001054288,0.0004290279,0.004316353,0.0008243799,0.006975202],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01890895,"threshold_uncertainty_score":0.06325674,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01351568641662012,"score_gpt":0.2757339437695265,"score_spread":0.2622182573529064,"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."}}