{"id":"W2407951356","doi":"","title":"On the path-connectivity of lexicographic product graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Lexicographical order; Mathematics; Path (computing); Product (mathematics); Combinatorics; Computer science; Computer network; Geometry","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.001610442,0.0005521476,0.0007988669,0.002974381,0.002100043,0.003331643,0.001442634,0.001800279,0.01798823],"category_scores_gemma":[0.02100571,0.0007659343,0.0006341168,0.004584475,0.00345268,0.01237765,0.003128911,0.002412259,0.00180815],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001187462,"about_ca_system_score_gemma":0.0008789519,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002136814,"about_ca_topic_score_gemma":0.002765166,"domain_scores_codex":[0.9983595,0.000674113,0.0001107377,0.0003607223,0.0002931349,0.0002018881],"domain_scores_gemma":[0.9754754,0.01963745,0.001320323,0.001669873,0.001037464,0.000859393],"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.0001772339,0.00008890642,0.002496117,0.0002487543,0.00004112535,0.0003723711,0.0007680018,0.007968294,0.001211769,0.9340376,0.01121478,0.04137506],"study_design_scores_gemma":[0.00002790086,0.00003761961,0.0006986106,0.00007335112,0.0000293026,0.0003591814,0.0002946644,0.01646912,0.000617066,0.9734514,0.007925525,0.00001638895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3481658,0.003943325,0.4935607,0.008492144,0.0003220707,0.000274412,0.003408567,0.0009901221,0.1408429],"genre_scores_gemma":[0.8422279,0.003520003,0.1294376,0.001105158,0.0004586805,0.0003186287,0.003548017,0.0004104205,0.01897368],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01798823,"threshold_uncertainty_score":0.06017661,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02439873067870579,"score_gpt":0.2342230279553638,"score_spread":0.2098242972766581,"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."}}