{"id":"W2059590924","doi":"10.1016/j.tcs.2010.07.017","title":"Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>O</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mi>ϵ</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:math>time","year":2010,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Constant (computer programming); Minor (academic); Scroll; Grid; Planar; Mathematics; Factor (programming language); Combinatorics; Computer science; Discrete mathematics; Computer graphics (images); Geometry; Programming language; Humanities; Engineering","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":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.005839814,0.00182345,0.0008573871,0.001918415,0.003585396,0.00347854,0.007445853,0.003656339,0.1914309],"category_scores_gemma":[0.003433924,0.003385871,0.002854798,0.004414275,0.01248319,0.004362368,0.006148352,0.004125734,0.001836462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000407546,"about_ca_system_score_gemma":0.003284211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001413833,"about_ca_topic_score_gemma":0.001002909,"domain_scores_codex":[0.9786567,0.001390144,0.003935916,0.004438388,0.006236157,0.005342667],"domain_scores_gemma":[0.9829223,0.005295321,0.003544348,0.004612903,0.0007142798,0.002910915],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.002664021,0.0009419942,0.00004774575,0.001678616,0.001419662,0.001515889,0.003245561,0.002110416,0.01187865,0.8997527,0.07029989,0.004444842],"study_design_scores_gemma":[0.003298798,0.003713428,0.0002222477,0.001880978,0.0011909,0.003273414,0.001024714,0.1689851,0.8060274,0.006750271,0.0008283528,0.002804419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7201959,0.00138929,0.01973504,0.001387665,0.004852016,0.0001712424,0.001256611,0.0005344239,0.2504779],"genre_scores_gemma":[0.9753631,0.00103094,0.01614415,0.001701093,0.002222774,0.001309698,0.001119765,0.0009955218,0.0001129601],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8930025,"threshold_uncertainty_score":0.999451,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01383103064045403,"score_gpt":0.2509247616131342,"score_spread":0.2370937309726802,"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."}}