{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008497714,0.0007225227,0.001404157,0.001059452,0.001153409,0.002317349,0.00184532,0.002429082,0.009590401],"category_scores_gemma":[0.006730882,0.0006311411,0.0008014236,0.001654624,0.001067602,0.006260948,0.001715125,0.001821995,0.0008668082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001783405,"about_ca_system_score_gemma":0.001865268,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007337636,"about_ca_topic_score_gemma":0.008314552,"domain_scores_codex":[0.9992705,0.0002797831,0.00003115842,0.0002146278,0.00009950063,0.000104425],"domain_scores_gemma":[0.9970133,0.002075822,0.0002898848,0.0001986397,0.0001826914,0.0002396228],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002918711,0.0001669908,0.001092346,0.0004439916,0.00008407875,0.0003357252,0.000262041,0.5638083,0.002238631,0.3763236,0.01211608,0.04283641],"study_design_scores_gemma":[0.00005237346,0.00004813825,0.0002530054,0.00003633835,0.00002362776,0.00009964123,0.0001634112,0.5576121,0.0006839623,0.4360774,0.004926666,0.00002337406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1605113,0.00112618,0.8040934,0.004375333,0.000226821,0.000164547,0.001900934,0.0004772978,0.02712417],"genre_scores_gemma":[0.7403504,0.002204319,0.2112922,0.0006087826,0.000234791,0.0002750285,0.002787435,0.0004150989,0.04183204],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009590401,"threshold_uncertainty_score":0.03208303,"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."}}