{"id":"W4361865602","doi":"10.48550/arxiv.2303.17028","title":"On the Complexity of Embedding in Graph Products","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Treewidth; Pathwidth; Tree-depth; Combinatorics; Embedding; Discrete mathematics; Mathematics; Tree decomposition; Partial k-tree; Graph; Computer science; 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.002003578,0.001147011,0.001686309,0.0009415752,0.001446262,0.005300736,0.002979791,0.002407827,0.009173093],"category_scores_gemma":[0.02169861,0.001045957,0.001639067,0.002603704,0.002720624,0.01652839,0.003715439,0.003730769,0.0009621709],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00267061,"about_ca_system_score_gemma":0.001532565,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00312541,"about_ca_topic_score_gemma":0.003439272,"domain_scores_codex":[0.9968167,0.0009603535,0.0001890884,0.0008604674,0.0007448547,0.0004286026],"domain_scores_gemma":[0.9633538,0.03102184,0.001623501,0.002270205,0.0008361691,0.0008945689],"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.001781961,0.0006618815,0.01108297,0.001857871,0.0003407038,0.0008777152,0.001513957,0.5669351,0.01146706,0.258498,0.02884648,0.1161363],"study_design_scores_gemma":[0.0001108562,0.000100093,0.001392677,0.0000561181,0.00008696433,0.0003981069,0.0003410594,0.5390386,0.003018156,0.4515045,0.003907876,0.00004492064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.674387,0.00325768,0.2770607,0.01191709,0.0002458994,0.0003159679,0.004916667,0.001507034,0.02639199],"genre_scores_gemma":[0.8795359,0.002390996,0.1026345,0.0008196697,0.000436859,0.0002904394,0.004719126,0.0007182657,0.00845428],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009173093,"threshold_uncertainty_score":0.03068703,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2468155303741425,"score_gpt":0.2605355533776101,"score_spread":0.01372002300346756,"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."}}