{"id":"W2026304802","doi":"10.1016/j.jda.2014.11.008","title":"The shortest path problem in the Knödel graph","year":2014,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"","keywords":"Combinatorics; Mathematics; Path graph; Shortest path problem; Distance; Graph; Upper and lower bounds; Discrete mathematics; Graph power; Line graph","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003124892,0.0001066985,0.0001742521,0.00007480649,0.0002142069,0.0003979493,0.001327226,0.00004294551,0.000001927551],"category_scores_gemma":[0.00004727939,0.00004707267,0.0001612087,0.0003454015,0.00004512094,0.0003537317,0.00006444033,0.0003581073,0.000005362179],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002227523,"about_ca_system_score_gemma":0.00003564241,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000281578,"about_ca_topic_score_gemma":0.00003723539,"domain_scores_codex":[0.998286,0.0003496852,0.0005523345,0.0001230921,0.0004447958,0.0002440666],"domain_scores_gemma":[0.9987648,0.0003472911,0.0003385393,0.0003506533,0.0001429054,0.00005588666],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000681963,0.0003492369,0.003719319,0.00003229287,0.0002753263,0.0002432487,0.01784479,0.01565692,0.0002263847,0.4092397,0.08341188,0.4689327],"study_design_scores_gemma":[0.001170457,0.001329298,0.008129116,0.0002996296,0.00002570196,0.001585975,0.002159174,0.8031752,0.00005047621,0.05263222,0.1290495,0.0003932943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004414072,0.0006817434,0.9810322,0.006804112,0.001767134,0.0001884912,8.901479e-7,0.00001675555,0.005094605],"genre_scores_gemma":[0.9923608,0.0001031922,0.006232187,0.0004114338,0.0007442476,0.00000600338,2.339285e-7,0.000007145076,0.0001347709],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9879467,"threshold_uncertainty_score":0.3837434,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009150218732017937,"score_gpt":0.2336056213119924,"score_spread":0.2244554025799745,"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."}}