{"id":"W124024561","doi":"","title":"Composite path algebras for solving path problems in graphs","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Path (computing); Mathematics; Mathematical proof; Longest path problem; Algebraic structure; Algebraic number; Mathematical optimization; Composite number; Algebra over a field; Computer science; Shortest path problem; Algorithm; Discrete mathematics; Graph; Pure mathematics; Geometry; Mathematical analysis","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.0008465488,0.0001625373,0.0002000651,0.0001584636,0.0001334565,0.0001397413,0.0007712828,0.00009051379,0.000001477928],"category_scores_gemma":[0.00005611494,0.0001689067,0.00007365926,0.0005955521,0.00004201175,0.0005962272,0.0001393529,0.0001478824,0.00001262387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008717447,"about_ca_system_score_gemma":0.00004173162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001150804,"about_ca_topic_score_gemma":0.000008646324,"domain_scores_codex":[0.9984918,0.00008606539,0.0003828804,0.0004107881,0.0002381328,0.0003903055],"domain_scores_gemma":[0.9990022,0.0001362474,0.0001578156,0.0005510548,0.0001002454,0.00005243253],"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.000003428883,0.0001331315,0.008757072,0.00003226873,0.000003660371,0.000002213749,0.0002182895,0.0001033247,0.003023055,0.9852691,0.0004211623,0.002033332],"study_design_scores_gemma":[0.000802028,0.0001109522,0.03167901,0.00005428498,0.00000359871,0.000004400784,0.000007665374,0.04619283,0.004090256,0.9161851,0.0006396074,0.0002302558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7311738,0.0003283763,0.262031,0.0001900671,0.003038448,0.001034586,0.000004655846,0.0003464578,0.001852648],"genre_scores_gemma":[0.7720744,0.000006140743,0.227678,0.00006244351,0.000007427092,0.0001154598,0.000008470522,0.00001434966,0.00003327099],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06908395,"threshold_uncertainty_score":0.6887814,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01506254988379686,"score_gpt":0.2523109143564071,"score_spread":0.2372483644726103,"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."}}