{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003188635,0.0007046091,0.0005661044,0.001343754,0.001335578,0.001975254,0.001576264,0.001004999,0.006709909],"category_scores_gemma":[0.00455967,0.0004316113,0.002117382,0.001602355,0.002809572,0.005664913,0.002366259,0.00340616,0.001093973],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001213001,"about_ca_system_score_gemma":0.002066391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001111397,"about_ca_topic_score_gemma":0.00200875,"domain_scores_codex":[0.9980179,0.0008961094,0.0001541758,0.0002477601,0.0005515784,0.0001325226],"domain_scores_gemma":[0.9979805,0.001115116,0.0001743677,0.0003540986,0.00025893,0.0001169794],"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.00001707697,0.00002340331,0.0001130251,0.0001122643,0.00001742816,0.00004380816,0.0001335247,0.007807035,0.0008784389,0.9722177,0.0007243476,0.01791201],"study_design_scores_gemma":[0.00001405332,0.0000314356,0.00006156382,0.00004488891,0.00002146555,0.00007539598,0.00005903992,0.04300721,0.001746711,0.9440746,0.0108408,0.00002281875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004545987,0.000267241,0.9894843,0.00019593,0.00004291403,0.0001120364,0.00007815335,0.0002415343,0.005031867],"genre_scores_gemma":[0.1687251,0.001013553,0.8242202,0.0001801048,0.0001380269,0.0005300512,0.000372758,0.00013748,0.004682667],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006709909,"threshold_uncertainty_score":0.02244687,"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."}}