{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001776493,0.0001124124,0.00009973397,0.0001378065,0.0001137799,0.00006079983,0.00105601,0.00007347368,0.00001301909],"category_scores_gemma":[0.00004199796,0.00007555896,0.00005074495,0.00113917,0.00009015776,0.0001452156,0.0002006593,0.0004845948,0.00003050538],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003109948,"about_ca_system_score_gemma":0.0000195859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005711383,"about_ca_topic_score_gemma":0.00003388763,"domain_scores_codex":[0.9985085,0.0001198571,0.0001869573,0.0003135384,0.0002984129,0.0005727392],"domain_scores_gemma":[0.9983331,0.0008706917,0.00004543499,0.0006331383,0.00003808726,0.00007952744],"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.00003022491,0.00005471512,0.0008344934,0.000001992649,0.000004173587,0.00004333914,0.0002227991,0.007031074,0.0000337906,0.9442044,0.001845811,0.04569319],"study_design_scores_gemma":[0.0003857215,0.0001710951,0.004433442,0.00006301205,9.817944e-7,0.000007497234,0.0000485092,0.1594657,0.0001175133,0.833174,0.001919334,0.0002132392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04419839,0.0002900935,0.9327719,0.0009718525,0.0002567141,0.0004623898,3.887766e-7,0.0001231279,0.02092509],"genre_scores_gemma":[0.9922215,0.00002567077,0.006588059,0.0008317913,0.00005402859,0.00002333341,6.233662e-7,0.00001091546,0.0002440817],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9480231,"threshold_uncertainty_score":0.3081205,"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."}}