{"id":"W4230596415","doi":"10.1002/net.20169","title":"On the minimum path problem in Knödel graphs","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Combinatorics; Mathematics; Logarithm; Bipartite graph; Longest path problem; Degree (music); Discrete mathematics; Shortest path problem; 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.000951337,0.0007317136,0.0009660168,0.0008651785,0.0009024806,0.001723542,0.001385504,0.001147162,0.006514387],"category_scores_gemma":[0.008058915,0.0003748765,0.0005335095,0.00154384,0.0008211336,0.004821153,0.001621999,0.001316048,0.0007470225],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00163904,"about_ca_system_score_gemma":0.001205073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002344067,"about_ca_topic_score_gemma":0.002764138,"domain_scores_codex":[0.999049,0.0003305117,0.00004407079,0.0002406756,0.0001671161,0.0001686434],"domain_scores_gemma":[0.9953751,0.003468774,0.0003292492,0.0004260589,0.0002058843,0.0001949753],"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.001867224,0.0005818399,0.002886015,0.0009136166,0.0001214437,0.0004513344,0.000618508,0.4708867,0.01142434,0.2431416,0.03647268,0.2306347],"study_design_scores_gemma":[0.0001842807,0.0001859401,0.0004737273,0.00004704764,0.00003225505,0.000346751,0.000245033,0.6025095,0.004301036,0.3832726,0.008374142,0.00002770548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3117298,0.001441756,0.6656733,0.003503476,0.0001624103,0.0002825754,0.001351685,0.001529527,0.01432554],"genre_scores_gemma":[0.6755664,0.001165506,0.310384,0.0004804247,0.0001429089,0.0002577553,0.002384997,0.0003668119,0.009251084],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006514387,"threshold_uncertainty_score":0.02179283,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0166651210907677,"score_gpt":0.2722070489307143,"score_spread":0.2555419278399467,"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."}}