{"id":"W1802444145","doi":"10.37236/2698","title":"Product Dimension of Forests and Bounded Treewidth Graphs","year":2013,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"Microsoft Research","keywords":"Combinatorics; Treewidth; Mathematics; Bounded function; Dimension (graph theory); Upper and lower bounds; Discrete mathematics; Graph; Product (mathematics); Partial k-tree; Chordal graph; Pathwidth; 1-planar graph; Line graph; Geometry","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.0006839937,0.0004287683,0.0005242477,0.001049069,0.0009132322,0.001800382,0.0008395116,0.0005091218,0.003031202],"category_scores_gemma":[0.003345478,0.0005363735,0.0006025599,0.001289748,0.001941448,0.004297808,0.001903577,0.001329285,0.0002739629],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009727376,"about_ca_system_score_gemma":0.0003260918,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008642129,"about_ca_topic_score_gemma":0.0009155837,"domain_scores_codex":[0.9991441,0.0002090651,0.00004198071,0.0002766091,0.000154361,0.0001739498],"domain_scores_gemma":[0.9952266,0.002960922,0.0005040708,0.0006146086,0.0002721277,0.0004215963],"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.0007139025,0.0001264902,0.02254552,0.00037733,0.0001080809,0.000369265,0.001216254,0.03442108,0.02173784,0.8596851,0.009393163,0.04930611],"study_design_scores_gemma":[0.0000449521,0.0001175582,0.009985396,0.00006656624,0.000076914,0.001528523,0.0005069009,0.1207092,0.01040411,0.8408274,0.01567654,0.00005595207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8536507,0.002894171,0.1196338,0.001086452,0.00006314193,0.00002739567,0.0009448405,0.0002423829,0.02145703],"genre_scores_gemma":[0.9748917,0.0006656967,0.02185553,0.000142811,0.00005347847,0.00004459243,0.0005772344,0.00007364287,0.001695362],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003031202,"threshold_uncertainty_score":0.01014036,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009660454865182485,"score_gpt":0.2238191868941672,"score_spread":0.2141587320289847,"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."}}