{"id":"W2010884279","doi":"10.1007/s10878-013-9656-2","title":"A 0.5358-approximation for Bandpass-2","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"Alberta Innovates - Technology Futures","keywords":"Partition (number theory); Theory of computation; Mathematics; Matching (statistics); Travelling salesman problem; Combinatorics; Approximation algorithm; Band-pass filter; Partition problem; Bipartite graph; Discrete mathematics; Algorithm; Graph; Physics; Optics","routes":{"ca_aff":true,"ca_fund":true,"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.0006408696,0.000087904,0.0001781514,0.0002282995,0.00009992429,0.0002134852,0.000549126,0.00006353701,0.0000245538],"category_scores_gemma":[0.0004242722,0.0000757067,0.0001002315,0.0003938568,0.00002600588,0.002108193,0.00005452571,0.0001253694,0.000006683439],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007090045,"about_ca_system_score_gemma":0.0001253957,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001090246,"about_ca_topic_score_gemma":2.341365e-8,"domain_scores_codex":[0.9988215,0.00009309615,0.0004048166,0.000116737,0.0003835259,0.000180311],"domain_scores_gemma":[0.9977552,0.0002230491,0.000412446,0.0001990075,0.001311354,0.00009894671],"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.00008999169,0.0001785909,0.00005284981,0.00002458171,0.00003691121,0.000001691339,0.0002474031,0.1753229,0.001233951,0.809953,0.002335199,0.010523],"study_design_scores_gemma":[0.001774197,0.0004529912,0.00004871697,0.00001999459,0.00000669742,0.00001522134,0.00001575328,0.4934157,0.002197362,0.5013359,0.0006177315,0.00009977831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00118904,0.00004321089,0.9951225,0.000979535,0.001947262,0.0003822846,4.535879e-7,0.00002566218,0.0003100668],"genre_scores_gemma":[0.1964217,0.00002543202,0.8029981,0.00005876363,0.0003800376,0.00003450899,0.000002538116,0.00001446313,0.00006449731],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3180929,"threshold_uncertainty_score":0.3087229,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01351814418577305,"score_gpt":0.2725983338319691,"score_spread":0.2590801896461961,"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."}}