{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":755,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":755,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"84c791073ed1","filters":{"topic":"Complexity and Algorithms in Graphs"}},"results":[{"id":"W2026036943","doi":"10.1007/s00037-004-0182-6","title":"Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds","year":2004,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":384,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Polynomial; Arithmetic circuit complexity; Combinatorics; Nondeterministic algorithm; Discrete mathematics; Bounded function; Identity (music); Degree (music); Upper and lower bounds; Arithmetic; Arbitrary-precision arithmetic","authors":[{"name":"Valentine Kabanets","is_ca":true},{"name":"Russell Impagliazzo","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05471051344573013,"gpt":0.2880086850664225,"spread":0.2332981716206923,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01121547,0.003161337,0.0040759,0.002569047,0.003537974,0.009421405,0.009121137,0.005902006,0.01670546],"category_scores_gemma":[0.1016763,0.002284436,0.005622747,0.003682809,0.01241993,0.02525092,0.01391639,0.01946206,0.003557791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007584944,"about_ca_system_score_gemma":0.006049356,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002344676,"about_ca_topic_score_gemma":0.002917585,"domain_scores_codex":[0.9723041,0.01087232,0.001073435,0.005968978,0.005630726,0.004150483],"domain_scores_gemma":[0.7276943,0.2354011,0.003436155,0.02558283,0.005453487,0.002432057],"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.001336877,0.0006862612,0.00385777,0.0009436024,0.0002680207,0.0003014616,0.0008564426,0.07379137,0.006289975,0.8242863,0.02035287,0.06702907],"study_design_scores_gemma":[0.0001431807,0.00008412386,0.0003647086,0.00006580207,0.0001206004,0.0001192292,0.0001356754,0.1074015,0.008317246,0.8796413,0.003561433,0.00004522394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1022752,0.001231065,0.8325782,0.01568997,0.0009170226,0.0004763764,0.00132583,0.003026344,0.04248005],"genre_scores_gemma":[0.8415281,0.001424141,0.1312929,0.005365496,0.001629935,0.0008100466,0.002250286,0.002182998,0.01351606],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01670546,"threshold_uncertainty_score":0.05931377,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2158764863","doi":"10.1098/rspa.2005.1546","title":"Quantum computing, postselection, and probabilistic polynomial-time","year":2005,"lang":"en","type":"article","venue":"Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":319,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Corollary; Postselection; Complexity class; Probabilistic logic; Class (philosophy); Generalization; Axiom; Mathematical proof; Quantum computer; Simple (philosophy); Intersection (aeronautics); Time complexity; Mathematics; Discrete mathematics; Polynomial; Quantum; Computation; Computer science; Algorithm; Quantum mechanics","authors":[{"name":"Scott Aaronson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007382453605906405,"gpt":0.2061353419719982,"spread":0.1987528883660918,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001906188,0.0007444826,0.0007648873,0.001011368,0.001761334,0.002868731,0.002009423,0.001530093,0.005695296],"category_scores_gemma":[0.01200813,0.0003534834,0.001368891,0.001879148,0.005389874,0.01009633,0.003731887,0.004661893,0.000498904],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002539469,"about_ca_system_score_gemma":0.001190973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001117577,"about_ca_topic_score_gemma":0.000888755,"domain_scores_codex":[0.9982013,0.0004974521,0.00005939524,0.0003671569,0.0004266746,0.0004480039],"domain_scores_gemma":[0.9867216,0.01021601,0.001100733,0.001160746,0.0004025249,0.0003983475],"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.00004008269,0.00003786313,0.0004752057,0.00005569061,0.00001479916,0.00003549274,0.0001200386,0.007117519,0.0005550765,0.9841052,0.001238298,0.006204584],"study_design_scores_gemma":[0.000008221798,0.00002262577,0.0002629038,0.00001004767,0.00001099407,0.00004686608,0.00006193329,0.05415192,0.0009760326,0.9428359,0.001603897,0.00000868467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3053418,0.001845946,0.612833,0.01388988,0.0002470788,0.0001487128,0.0003335279,0.0003616353,0.06499846],"genre_scores_gemma":[0.9608769,0.0008068103,0.03290701,0.0004406913,0.0002484304,0.0001126591,0.0001535579,0.00006652384,0.004387422],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005695296,"threshold_uncertainty_score":0.01905262,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976584101","doi":"10.1145/2432622.2432628","title":"Steiner Tree Approximation via Iterative Randomized Rounding","year":2013,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":280,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; European Research Council; Division of Computing and Communication Foundations; Alexander von Humboldt-Stiftung; Ministerstwo Edukacji i Nauki; Fundacja na rzecz Nauki Polskiej; École Polytechnique Fédérale de Lausanne","keywords":"Steiner tree problem; Rounding; Mathematics; Combinatorics; Linear programming relaxation; Approximation algorithm; Randomized rounding; Tree (set theory); Sequence (biology); k-minimum spanning tree; Relaxation (psychology); Discrete mathematics; Minimum spanning tree; Iterative method; Mathematical optimization; Tree structure; K-ary tree; Computer science; Linear programming; Binary tree","authors":[{"name":"Jarosław Byrka","is_ca":false},{"name":"Fabrizio Grandoni","is_ca":false},{"name":"Thomas Rothvoß","is_ca":false},{"name":"Laura Sanità","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01898129140375479,"gpt":0.2430249264847187,"spread":0.2240436350809639,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002837859,0.001507418,0.002104799,0.001095274,0.0009169897,0.001826876,0.002518049,0.001503093,0.003809268],"category_scores_gemma":[0.01170962,0.0008173664,0.00176645,0.001860553,0.001203391,0.002637625,0.002316183,0.003284559,0.001119094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0017985,"about_ca_system_score_gemma":0.00233835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002809953,"about_ca_topic_score_gemma":0.00281278,"domain_scores_codex":[0.9959338,0.001610978,0.0002005935,0.000608566,0.001005488,0.0006405159],"domain_scores_gemma":[0.9933723,0.004305067,0.0005126798,0.001167235,0.0004854154,0.000157303],"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.0007310292,0.0003268339,0.001066172,0.0002780743,0.0001363334,0.0002244791,0.0001977635,0.8105972,0.006636602,0.06754618,0.009339406,0.1029198],"study_design_scores_gemma":[0.00007794381,0.00005162478,0.00008015446,0.00001520301,0.00002063945,0.00004844226,0.00002324035,0.972343,0.001082324,0.02526216,0.0009857269,0.00000955365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0282081,0.0004675903,0.9619129,0.0005607992,0.00009299698,0.0001616794,0.0001796779,0.001669955,0.006746237],"genre_scores_gemma":[0.3496252,0.0004038781,0.6454604,0.0004008299,0.0001232488,0.0005189707,0.0005467247,0.0003293334,0.002591488],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003809268,"threshold_uncertainty_score":0.01500815,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1554407673","doi":"10.1109/sffcs.1999.814580","title":"Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs","year":2003,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":228,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Transitive closure; Amortized analysis; Combinatorics; Binary logarithm; Integer (computer science); Algorithm; Mathematics; Shortest path problem; Closure (psychology); Discrete mathematics; Data structure; Time complexity; Computer science; Graph","authors":[{"name":"Valerie King","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02292567693488149,"gpt":0.2702413490047282,"spread":0.2473156720698468,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001191873,0.0009509433,0.001084401,0.001694891,0.001414305,0.002045583,0.00306846,0.000753486,0.003444087],"category_scores_gemma":[0.00729355,0.0009696217,0.0007884718,0.002649212,0.001150824,0.007363448,0.002885609,0.001189408,0.001083429],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001303924,"about_ca_system_score_gemma":0.001588348,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002571232,"about_ca_topic_score_gemma":0.003411192,"domain_scores_codex":[0.9978487,0.0004254262,0.0002175369,0.0006456822,0.000626916,0.0002357453],"domain_scores_gemma":[0.9935746,0.002299522,0.0006438242,0.002592148,0.0006525837,0.0002372734],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007038862,0.0002833366,0.002809973,0.0008715009,0.0002000952,0.000253288,0.0007488679,0.1297161,0.02149008,0.1648064,0.01568234,0.6624342],"study_design_scores_gemma":[0.0002211614,0.0003628201,0.001097067,0.00009377371,0.0001523901,0.0009840234,0.0003495505,0.5536904,0.03012653,0.3683909,0.04439881,0.0001325885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03435742,0.0006861492,0.9556017,0.0002543257,0.0000554948,0.0002349964,0.001271606,0.003731861,0.003806498],"genre_scores_gemma":[0.3106459,0.0006096452,0.6814339,0.0001433202,0.00006334409,0.0003609674,0.003353023,0.000504707,0.002885226],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003444087,"threshold_uncertainty_score":0.01152158,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2125401464","doi":"10.1287/mnsc.49.9.1268.16570","title":"A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems","year":2003,"lang":"en","type":"article","venue":"Management Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":205,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Mathematics; Integer programming; Mathematical optimization; Separable space; Linear programming; Piecewise linear function; Minification; Duality (order theory); Linear programming relaxation; Piecewise; Branch and price; Lagrangian relaxation; Relaxation (psychology); Regular polygon; Envelope (radar); Convex optimization; Strong duality; Function (biology); Applied mathematics; Discrete mathematics; Optimization problem; Computer science; Mathematical analysis","authors":[{"name":"Keely L. Croxton","is_ca":false},{"name":"Bernard Gendron","is_ca":true},{"name":"Thomas L. Magnanti","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06693519417062954,"gpt":0.3225695888185658,"spread":0.2556343946479362,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003337131,0.001260495,0.001166108,0.0007686925,0.0005044932,0.002733294,0.002204285,0.001379352,0.004366707],"category_scores_gemma":[0.008618033,0.0006623444,0.001239066,0.001769934,0.001204235,0.003586732,0.001559266,0.002216628,0.0003893313],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002274547,"about_ca_system_score_gemma":0.001230692,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001765541,"about_ca_topic_score_gemma":0.001987302,"domain_scores_codex":[0.9984558,0.0008953645,0.00005356926,0.0001306597,0.0003493138,0.0001152595],"domain_scores_gemma":[0.9963866,0.002636895,0.0002924942,0.000272154,0.0002382487,0.0001735485],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001402982,0.000098623,0.0003487893,0.0001986758,0.00004779587,0.00004805969,0.000123069,0.6482651,0.0003658544,0.3223611,0.00158611,0.02641651],"study_design_scores_gemma":[0.00001389348,0.00006551687,0.0001364942,0.00004394271,0.00001663629,0.00002638707,0.00004760012,0.9374832,0.000211336,0.05989283,0.002050653,0.00001144524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03364591,0.002523861,0.9410205,0.001305011,0.0001311093,0.00008696759,0.0001485721,0.0001427754,0.02099526],"genre_scores_gemma":[0.6726305,0.004156251,0.3125075,0.0003972379,0.0001732421,0.0003910771,0.0003323691,0.0001897955,0.009221995],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004366707,"threshold_uncertainty_score":0.01764864,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2024091095","doi":"10.1016/s0022-0000(02)00025-9","title":"Uniform constant-depth threshold circuits for division and iterated multiplication","year":2002,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":187,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"McGill University; Clay Mathematics Institute; National Science Foundation","keywords":"Modulo; Mathematics; Division (mathematics); Iterated function; Constant (computer programming); Natural number; Discrete mathematics; Electronic circuit; Integer (computer science); Multiplication (music); Boolean circuit; Arithmetic; Combinatorics; Computer science; Boolean function; Mathematical analysis","authors":[{"name":"William Hesse","is_ca":false},{"name":"Eric Allender","is_ca":false},{"name":"David A. Mix Barrington","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05525673498615786,"gpt":0.2671099806480158,"spread":0.211853245661858,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009472183,0.0008657315,0.001238367,0.001360588,0.001524686,0.005343311,0.002373909,0.001762915,0.01011613],"category_scores_gemma":[0.008491115,0.0008334634,0.001065527,0.002063445,0.002290953,0.01037598,0.003342251,0.003177498,0.001095173],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00436308,"about_ca_system_score_gemma":0.00170842,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001579629,"about_ca_topic_score_gemma":0.002526743,"domain_scores_codex":[0.9987596,0.0001374218,0.00009769061,0.0003610479,0.0003035171,0.0003406448],"domain_scores_gemma":[0.9953488,0.003046353,0.0003572372,0.0006602394,0.0002757544,0.0003116749],"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.0005136692,0.00008064901,0.0007026155,0.0002221195,0.00003339799,0.0001000761,0.0004097453,0.007722741,0.005679635,0.9395363,0.004229676,0.04076932],"study_design_scores_gemma":[0.00008881238,0.00003905191,0.0002966981,0.00004446558,0.00006157799,0.0001552043,0.00006728248,0.02793018,0.006436665,0.9612952,0.00354709,0.00003778822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4257094,0.003069245,0.4758362,0.003376418,0.0002972244,0.0004031533,0.001484742,0.003371781,0.08645191],"genre_scores_gemma":[0.9318653,0.0008505343,0.05067149,0.0005889676,0.0001426019,0.000230694,0.0004943006,0.0002896514,0.01486644],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01011613,"threshold_uncertainty_score":0.03384185,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1977673587","doi":"10.1007/s00220-014-2260-1","title":"A Combinatorial Approach to Nonlocality and Contextuality","year":2015,"lang":"en","type":"article","venue":"Communications in Mathematical Physics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":185,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Perimeter Institute","funders":"Agence Nationale de la Recherche","keywords":"Kochen–Specker theorem; Quantum nonlocality; Quantum; Formalism (music); Graph; Probabilistic logic; Diagrammatic reasoning; Qubit; Hierarchy","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.1682497022073137,"gpt":0.3497480707735672,"spread":0.1814983685662535,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002217776,0.0008407239,0.001391013,0.003869291,0.003207797,0.005768702,0.002927989,0.00205453,0.01161291],"category_scores_gemma":[0.00966404,0.001039929,0.001771836,0.00341699,0.01037608,0.01875299,0.005692108,0.005560557,0.0007733849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00223437,"about_ca_system_score_gemma":0.0009497178,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001195476,"about_ca_topic_score_gemma":0.001353044,"domain_scores_codex":[0.9976898,0.0009760018,0.0001257892,0.0005731887,0.0004281185,0.0002069867],"domain_scores_gemma":[0.9877555,0.007353883,0.0008649285,0.002123347,0.001054926,0.0008474821],"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.000002297932,0.000003544219,0.00003210042,0.00001342958,0.000002040025,0.00001355676,0.00004843558,0.0003210546,0.00005589867,0.9986356,0.0002371437,0.0006347852],"study_design_scores_gemma":[0.00000349598,0.000003580503,0.00004097703,0.000006631193,0.000006168232,0.00003917738,0.00003832111,0.002857201,0.00007097348,0.9949728,0.001954988,0.000005685558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04412895,0.002189681,0.8545365,0.008687113,0.0003677255,0.00007292916,0.0003321249,0.0003554281,0.08932953],"genre_scores_gemma":[0.8071407,0.001803732,0.1646543,0.001513473,0.002112209,0.0002907232,0.0003469261,0.0004211429,0.02171678],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01161291,"threshold_uncertainty_score":0.03884912,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2110504071","doi":"10.1613/jair.1815","title":"Dynamic Local Search for the Maximum Clique Problem","year":2006,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":158,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Clique problem; Vertex (graph theory); Benchmark (surveying); Clique; Mathematics; Generalization; Mathematical optimization; Computer science; Algorithm; Combinatorics; Graph; Chordal graph","authors":[{"name":"Wayne Pullan","is_ca":false},{"name":"Holger H. Hoos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1249041833922344,"gpt":0.4055584359057617,"spread":0.2806542525135273,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001725784,0.0008071417,0.001552049,0.001179547,0.000945161,0.0009807298,0.002134195,0.001405734,0.0053288],"category_scores_gemma":[0.005650738,0.0004787785,0.0007046427,0.001517952,0.001116656,0.001916395,0.002189314,0.001649444,0.0009444337],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001339119,"about_ca_system_score_gemma":0.001562399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002707126,"about_ca_topic_score_gemma":0.004472312,"domain_scores_codex":[0.9987953,0.0005842615,0.00003039565,0.0002215252,0.0002551379,0.0001134349],"domain_scores_gemma":[0.9982374,0.001218848,0.0001230885,0.0001347589,0.0001594359,0.0001265433],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001472696,0.0001421207,0.000454266,0.0002536058,0.0000692423,0.0001111747,0.00008971641,0.8623996,0.001414632,0.06645794,0.008497393,0.05996299],"study_design_scores_gemma":[0.0000389607,0.00003372491,0.00004698136,0.000009594865,0.000007160091,0.00002959401,0.00001547536,0.9752516,0.0003503914,0.02238614,0.001823165,0.00000713015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01947948,0.0007971837,0.9714541,0.0004552201,0.00005580708,0.0001351323,0.0001414528,0.0007788165,0.006702901],"genre_scores_gemma":[0.4292706,0.0005799503,0.5614495,0.000482869,0.0001412933,0.0006730146,0.0008916016,0.0004761872,0.006035013],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0053288,"threshold_uncertainty_score":0.01782662,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2030970869","doi":"10.1145/1597036.1597045","title":"A better approximation ratio for the vertex cover problem","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":156,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Combinatorics; Vertex cover; Cover (algebra); Relaxation (psychology); Vertex (graph theory); Maximum cut; Approximation algorithm; Set cover problem; Set (abstract data type); Discrete mathematics; Computer science; Graph","authors":[{"name":"George Karakostas","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0276875545897699,"gpt":0.2638624229823917,"spread":0.2361748683926218,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005101317,0.003560206,0.002747485,0.002032764,0.001039317,0.004581069,0.003983286,0.004144082,0.02482462],"category_scores_gemma":[0.0254202,0.0008472944,0.003130029,0.00296978,0.001544376,0.010881,0.003580556,0.008313023,0.005788654],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003254429,"about_ca_system_score_gemma":0.002572152,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002562769,"about_ca_topic_score_gemma":0.002963669,"domain_scores_codex":[0.9930823,0.002094771,0.0002093114,0.001621482,0.001774978,0.001217166],"domain_scores_gemma":[0.9860219,0.008052012,0.0005977625,0.003705475,0.0009581965,0.000664708],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003141178,0.002080884,0.003196175,0.001331339,0.0004495121,0.0004887141,0.000588604,0.2611635,0.02516682,0.2588535,0.07528844,0.3682514],"study_design_scores_gemma":[0.0003504677,0.0003977418,0.0007308785,0.0001230443,0.0001551502,0.0007621582,0.0001591472,0.7947406,0.006352617,0.1777636,0.01840167,0.0000629965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0799201,0.006633948,0.8468265,0.01265601,0.001886283,0.0003286779,0.001310526,0.003653926,0.04678413],"genre_scores_gemma":[0.459565,0.003203072,0.5050095,0.004404626,0.002163604,0.0005921061,0.003535984,0.002442033,0.01908408],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02482462,"threshold_uncertainty_score":0.08304662,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116123253","doi":"10.1109/ccc.2007.26","title":"Quantum t-designs: t-wise Independence in the Quantum World","year":2007,"lang":"en","type":"article","venue":"Proceedings - IEEE Conference on Computational Complexity/Proceedings","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":132,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Quantum; Independence (probability theory); Computer science; Quantum mechanics; Physics; Mathematics; Statistics","authors":[{"name":"Andris Ambainis","is_ca":true},{"name":"Joseph Emerson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1215451911829818,"gpt":0.3188840678925373,"spread":0.1973388767095555,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006597215,0.0007986831,0.001365234,0.0006934656,0.001826343,0.003015342,0.002197261,0.002399765,0.005516155],"category_scores_gemma":[0.02607026,0.001133147,0.002063186,0.001294414,0.005369481,0.00721384,0.00561704,0.004509857,0.0008771837],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001920277,"about_ca_system_score_gemma":0.002285859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005091514,"about_ca_topic_score_gemma":0.0005680031,"domain_scores_codex":[0.9916909,0.003762029,0.0006234241,0.001476805,0.001547334,0.0008996046],"domain_scores_gemma":[0.968206,0.01650924,0.002130402,0.01029282,0.00172132,0.001140081],"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.0007681886,0.0001053598,0.001334049,0.0001161392,0.00007232568,0.0001058168,0.0002894788,0.03819543,0.006262046,0.9255592,0.001976086,0.02521588],"study_design_scores_gemma":[0.0001544906,0.0002490397,0.0002555546,0.00002485108,0.00005323485,0.0001390495,0.00005003613,0.1501085,0.008469277,0.8380708,0.002372741,0.00005240857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09951787,0.0001512323,0.8913091,0.0009354392,0.00005787111,0.0002671672,0.0003495474,0.0005341538,0.006877643],"genre_scores_gemma":[0.7541533,0.0001813874,0.2388026,0.000529482,0.0001107919,0.0009302797,0.0004082049,0.0002018207,0.00468223],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006597215,"threshold_uncertainty_score":0.03488988,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2115404728","doi":"10.1137/s0097539704443057","title":"A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover","year":2005,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":128,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Environment and Climate Change Canada","keywords":"Hypergraph; Combinatorics; Vertex cover; Mathematics; Cover (algebra); Vertex (graph theory); Hardness of approximation; Constant (computer programming); Combinatorial proof; Discrete mathematics; Code (set theory); Approximation algorithm; Graph; Computer science; Set (abstract data type)","authors":[{"name":"Irit Dinur","is_ca":false},{"name":"Venkatesan Guruswami","is_ca":false},{"name":"Subhash Khot","is_ca":false},{"name":"Oded Regev","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01418656009218223,"gpt":0.2435712217290283,"spread":0.2293846616368461,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001820087,0.0005239265,0.0009393329,0.001206568,0.001425262,0.003143008,0.002303002,0.001524575,0.006289759],"category_scores_gemma":[0.01662952,0.0009467838,0.00148973,0.001657746,0.00254118,0.009352597,0.005460059,0.003825418,0.0006529469],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002711235,"about_ca_system_score_gemma":0.002153759,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003363526,"about_ca_topic_score_gemma":0.003055898,"domain_scores_codex":[0.9961893,0.0006205583,0.0001986168,0.0009937007,0.001399134,0.0005987295],"domain_scores_gemma":[0.9862385,0.007534175,0.001345482,0.003265189,0.0009943921,0.0006222909],"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.00120546,0.000289639,0.008078534,0.0008257068,0.0002172603,0.0008644548,0.0007667934,0.1840987,0.03292281,0.6143765,0.01203282,0.1443212],"study_design_scores_gemma":[0.0001426292,0.000216201,0.002381001,0.0001209071,0.0001228765,0.0009913022,0.0001328629,0.5431622,0.0201774,0.4232664,0.00916701,0.0001193782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.207773,0.0009128733,0.7666709,0.004090214,0.0001076346,0.0001954789,0.001514985,0.001656332,0.01707857],"genre_scores_gemma":[0.8306049,0.0005940212,0.1628971,0.0006095628,0.0001773886,0.0001775573,0.0008883076,0.0001863296,0.003864762],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006289759,"threshold_uncertainty_score":0.02104133,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2086467753","doi":"10.1109/focs.2011.86","title":"Information Equals Amortized Communication","year":2011,"lang":"en","type":"preprint","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":122,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Communication complexity; Computer science; Theoretical computer science; Generalization; Pointer (user interface); Function (biology); Discrete mathematics; Mathematics","authors":[{"name":"Mark Braverman","is_ca":true},{"name":"Anup Rao","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05390152484316293,"gpt":0.2720959378801884,"spread":0.2181944130370254,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003155836,0.001205559,0.001193168,0.0009830868,0.001612819,0.003411039,0.003393002,0.002249131,0.008889238],"category_scores_gemma":[0.01867658,0.0006828249,0.002221728,0.001131667,0.00468668,0.01011348,0.006103613,0.004515497,0.001252912],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002648849,"about_ca_system_score_gemma":0.002365042,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009874033,"about_ca_topic_score_gemma":0.0008158673,"domain_scores_codex":[0.9934446,0.001873817,0.0004257942,0.001502041,0.001850692,0.0009031583],"domain_scores_gemma":[0.9744586,0.01462702,0.001337505,0.007637507,0.001078376,0.0008610205],"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.0006121984,0.0002073208,0.001363097,0.0002266302,0.0001184623,0.0002182753,0.0003373236,0.2235479,0.01124676,0.7373031,0.001722123,0.02309684],"study_design_scores_gemma":[0.00007033718,0.0001175885,0.0001504295,0.00002140318,0.0000520844,0.0001134107,0.00003473333,0.5270812,0.01315599,0.4568602,0.002310757,0.00003187979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1376571,0.0001562676,0.8435864,0.001653645,0.00008143509,0.0002996707,0.0003217422,0.001048581,0.01519514],"genre_scores_gemma":[0.8217683,0.0001830575,0.1692899,0.0004325129,0.0001000314,0.000669778,0.0004850553,0.000344053,0.006727275],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008889238,"threshold_uncertainty_score":0.02973741,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1519655831","doi":"10.1007/11523468_84","title":"A Better Approximation Ratio for the Vertex Cover Problem","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":114,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Cover (algebra); Combinatorics; Vertex cover; Mathematics; Relaxation (psychology); Vertex (graph theory); Binary logarithm; Approximation algorithm; Discrete mathematics; Graph","authors":[{"name":"George Karakostas","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02102852362307598,"gpt":0.2414040172628108,"spread":0.2203754936397349,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006981922,0.004456515,0.005215267,0.003779408,0.002350057,0.009643315,0.008944208,0.007045251,0.03434697],"category_scores_gemma":[0.03646773,0.001561345,0.004249405,0.007595561,0.002717489,0.02059157,0.005182549,0.0101676,0.006915081],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007400372,"about_ca_system_score_gemma":0.003723596,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003925802,"about_ca_topic_score_gemma":0.004193768,"domain_scores_codex":[0.9874227,0.003884336,0.0004565709,0.002363258,0.003751588,0.002121535],"domain_scores_gemma":[0.9686255,0.01905498,0.0009575153,0.008265772,0.001670359,0.001425931],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.007398399,0.00245219,0.003136677,0.001577022,0.000602442,0.0004372121,0.0005363638,0.1677748,0.02211033,0.1960667,0.1426876,0.4552203],"study_design_scores_gemma":[0.0009878601,0.0006145087,0.001634069,0.0002176659,0.0005179066,0.001164837,0.0002364144,0.6637163,0.008259487,0.2957323,0.02677687,0.0001417607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1975519,0.03002475,0.5938643,0.02880321,0.007434312,0.0006165865,0.003909091,0.009596889,0.1281991],"genre_scores_gemma":[0.5271217,0.006783166,0.4115467,0.006125395,0.006272369,0.0006471101,0.00510656,0.004460366,0.03193676],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03434697,"threshold_uncertainty_score":0.1149021,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1563601717","doi":"10.1016/s0927-0507(05)12007-6","title":"Submodular Function Minimization","year":2005,"lang":"en","type":"book-chapter","venue":"Handbooks in operations research and management science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":112,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Fleischer; Submodular set function; Minification; Function (biology); Computer science; Mathematics; Mathematical optimization; Algorithm; Philosophy; Linguistics; German","authors":[{"name":"S. Thomas McCormick","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07223204777223924,"gpt":0.322284523411189,"spread":0.2500524756389497,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005043948,0.00146623,0.001335913,0.0009308339,0.0005423803,0.001359805,0.001381088,0.000872464,0.02564936],"category_scores_gemma":[0.001494949,0.0005286142,0.0006619233,0.002534187,0.0008306638,0.002456581,0.001116275,0.002971154,0.009222982],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009709649,"about_ca_system_score_gemma":0.0009516467,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007497786,"about_ca_topic_score_gemma":0.001808548,"domain_scores_codex":[0.9996697,0.00006013145,0.00001335092,0.00008342337,0.0001458832,0.00002761459],"domain_scores_gemma":[0.9996988,0.0001341811,0.00001500222,0.00007379179,0.00005850759,0.00001972201],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003155302,0.0001077172,0.0001152248,0.0003656518,0.00002918199,0.00003456737,0.00006492362,0.01321217,0.001781789,0.2739197,0.1470956,0.5632418],"study_design_scores_gemma":[0.00002854877,0.00006753051,0.0005265681,0.0002397839,0.00003902795,0.0003202251,0.00005888717,0.06594557,0.003704424,0.7263052,0.2027315,0.00003274978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00637136,0.0106461,0.6776502,0.003291183,0.0008853922,0.0001049847,0.001064084,0.001271979,0.2987148],"genre_scores_gemma":[0.105262,0.01767818,0.5177364,0.00199389,0.001323915,0.0005101713,0.003931345,0.001743625,0.3498205],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02564936,"threshold_uncertainty_score":0.08580571,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2134875769","doi":"10.1137/s009753979833920x","title":"Approximating Minimum-Size <i>k</i>-Connected Spanning Subgraphs via Matching","year":2000,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":107,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Mathematics; Discrete mathematics; Graph factorization; Spanning tree; Matching (statistics); Connectivity; Strongly connected component; Undirected graph; Factor-critical graph; Minimum spanning tree; Line graph; Degree (music); Minimum degree spanning tree; Graph; Graph power","authors":[{"name":"Joseph Cheriyan","is_ca":true},{"name":"Ramakrishna Thurimella","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01281695513791297,"gpt":0.241961675845559,"spread":0.229144720707646,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005632612,0.0008089303,0.0008137709,0.001143854,0.0004850902,0.0006702959,0.001735219,0.001115839,0.003166605],"category_scores_gemma":[0.003367677,0.0005987929,0.0009347826,0.002065916,0.0006381542,0.001989104,0.0009102178,0.000609205,0.000697212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001214118,"about_ca_system_score_gemma":0.00124168,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006139442,"about_ca_topic_score_gemma":0.007372767,"domain_scores_codex":[0.9994699,0.0001234171,0.00002485965,0.0001473055,0.0001074061,0.0001270486],"domain_scores_gemma":[0.9987923,0.0006750468,0.0001779894,0.000172791,0.0001025153,0.00007929614],"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.0003179778,0.000166613,0.002218571,0.0002391765,0.00006960978,0.0002556791,0.000125265,0.8513169,0.008531609,0.01900963,0.007163382,0.1105857],"study_design_scores_gemma":[0.00003461869,0.00004008599,0.0003590115,0.00001242532,0.00001265271,0.00009053579,0.00005482639,0.9785783,0.002133833,0.01760536,0.00107175,0.000006639117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1532371,0.0003918282,0.8361926,0.0004075152,0.00004074414,0.0002525224,0.0005661656,0.002027443,0.006884024],"genre_scores_gemma":[0.4596653,0.000184277,0.5355815,0.0001218639,0.00002421033,0.0001768097,0.00128204,0.0002804186,0.002683553],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006139442,"threshold_uncertainty_score":0.01220739,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2023627355","doi":"10.1145/1993636.1993741","title":"Learning submodular functions","year":2011,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":101,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Submodular set function; Matroid; Multiplicative function; Upper and lower bounds; Monotone polygon; Learnability; Mathematics; Function (biology); Distribution (mathematics); Product (mathematics); Discrete mathematics; Sample (material); Combinatorics; Computer science; Artificial intelligence","authors":[{"name":"Maria-Florina Balcan","is_ca":false},{"name":"Nicholas J. A. Harvey","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0434839937141398,"gpt":0.2117194603011296,"spread":0.1682354665869898,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003417726,0.001362725,0.00209341,0.0009347195,0.0006697164,0.00194003,0.002110346,0.001728159,0.003551426],"category_scores_gemma":[0.01854392,0.0007159161,0.001310107,0.001605491,0.001650383,0.006106817,0.00205254,0.003890622,0.0009797212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001469589,"about_ca_system_score_gemma":0.001050517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001032251,"about_ca_topic_score_gemma":0.001212055,"domain_scores_codex":[0.9977768,0.0009477092,0.00009861314,0.0006491433,0.0003398909,0.0001877742],"domain_scores_gemma":[0.9892344,0.008202257,0.0005124765,0.001347237,0.0004476243,0.0002559651],"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.0003837389,0.0003847932,0.00438864,0.0005108457,0.0001924393,0.0001303523,0.000305922,0.5115324,0.002454588,0.2202544,0.01234084,0.247121],"study_design_scores_gemma":[0.00002482531,0.00006173144,0.0002660024,0.00002403244,0.00001139042,0.00005286923,0.00003862602,0.759867,0.000734397,0.237072,0.001836448,0.00001070007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0532553,0.001064643,0.9380847,0.00172613,0.00007263328,0.00009786309,0.0004512519,0.0006684725,0.004578932],"genre_scores_gemma":[0.6288263,0.001593422,0.3592222,0.0009756989,0.0004301142,0.0004597589,0.001913534,0.0002867242,0.0062922],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003551426,"threshold_uncertainty_score":0.01807493,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2010996873","doi":"10.5555/1109557.1109577","title":"Combination can be hard: approximability of the unique coverage problem","year":2006,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":94,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Hardness of approximation; Combinatorics; Approximation algorithm; Mathematics; Bipartite graph; Matching (statistics); Binary logarithm; Set (abstract data type); Discrete mathematics; Logarithm; Maximization; Time complexity; Computer science; Mathematical optimization","authors":[{"name":"Erik D. Demaine","is_ca":false},{"name":"Mohammad Taghi Hajiaghayi","is_ca":false},{"name":"Uriel Feige","is_ca":false},{"name":"Mohammad R. Salavatipour","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01183958534583239,"gpt":0.2252779971216926,"spread":0.2134384117758601,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002675143,0.001718356,0.002121473,0.001208412,0.001530304,0.005106105,0.003701368,0.002340999,0.01211212],"category_scores_gemma":[0.02008492,0.001163726,0.00284735,0.00267209,0.00163945,0.00919365,0.003611875,0.004646122,0.001329567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002606704,"about_ca_system_score_gemma":0.001716147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002211783,"about_ca_topic_score_gemma":0.002643168,"domain_scores_codex":[0.9953262,0.001100218,0.0002314597,0.001463197,0.001020456,0.0008585611],"domain_scores_gemma":[0.989467,0.007098258,0.0007913885,0.001719963,0.0004235731,0.000499922],"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.001670336,0.0008987318,0.009351426,0.001047379,0.0005691767,0.0008478492,0.000883688,0.555603,0.007842246,0.221577,0.0241442,0.175565],"study_design_scores_gemma":[0.0001268827,0.00008855906,0.0007786719,0.00007232985,0.0001589204,0.0007152603,0.0001694379,0.699049,0.004505774,0.2881131,0.00619374,0.00002849471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2606708,0.00148163,0.6773912,0.005320068,0.000199284,0.0003613495,0.002073104,0.003320703,0.04918182],"genre_scores_gemma":[0.7823982,0.0006964897,0.2025414,0.0007163506,0.000291872,0.0004592724,0.002139853,0.0006487839,0.0101079],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01211212,"threshold_uncertainty_score":0.04051906,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2020899710","doi":"10.1145/1328911.1328924","title":"Faster approximation schemes for fractional multicommodity flow problems","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Multi-commodity flow problem; Flow (mathematics); Fleischer; Representation (politics); Combinatorics; Upper and lower bounds; Flow network; Time complexity; Discrete mathematics; Tree (set theory); Maximum flow problem; Theory of computation; Approximation algorithm; Algorithm","authors":[{"name":"George Karakostas","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06449367461059989,"gpt":0.2738331663970109,"spread":0.209339491786411,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002536275,0.00139387,0.001271517,0.001048823,0.001070658,0.002049831,0.002891871,0.001769711,0.005716364],"category_scores_gemma":[0.01089837,0.0005808616,0.001632078,0.001458638,0.001189278,0.005388995,0.002669308,0.003050424,0.001228765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002601425,"about_ca_system_score_gemma":0.001406641,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00475008,"about_ca_topic_score_gemma":0.004492473,"domain_scores_codex":[0.997915,0.0004500316,0.0001205052,0.0003206884,0.000827963,0.0003658358],"domain_scores_gemma":[0.995764,0.002067747,0.0002601767,0.001303818,0.0004523342,0.0001517918],"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.0007155525,0.0002766789,0.00123646,0.0003973109,0.00008926958,0.0001213874,0.000633479,0.5459632,0.009195814,0.16565,0.007036095,0.2686847],"study_design_scores_gemma":[0.00006167623,0.00004319827,0.000105065,0.00002596717,0.00001507954,0.00004140703,0.00003247724,0.9361392,0.001547322,0.05850523,0.003468619,0.00001481831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01823869,0.000581936,0.9753003,0.0003343918,0.00009730527,0.00009308774,0.00009838394,0.00104623,0.00420974],"genre_scores_gemma":[0.278949,0.0004057135,0.7152773,0.0002248925,0.0001136423,0.0002753055,0.0003748027,0.0003509892,0.004028322],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005716364,"threshold_uncertainty_score":0.01912314,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2156206152","doi":"10.1109/icde.2013.6544815","title":"Scalable maximum clique computation using MapReduce","year":2013,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Amazon Web Services","keywords":"Scalability; Computer science; Clique; Computation; Parallel computing; Graph partition; Key (lock); Fault tolerance; Graph; Theoretical computer science; Algorithm; Distributed computing; Mathematics; Combinatorics","authors":[{"name":"Jingen Xiang","is_ca":true},{"name":"Cong Guo","is_ca":true},{"name":"Ashraf Aboulnaga","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03448348328105771,"gpt":0.268198908797724,"spread":0.2337154255166662,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006142702,0.000861946,0.001131525,0.0009256181,0.001647242,0.00108453,0.002403362,0.000886749,0.003861727],"category_scores_gemma":[0.001969738,0.0004814289,0.001347077,0.001667134,0.0007136647,0.00222275,0.001933676,0.001189909,0.0008185282],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001017857,"about_ca_system_score_gemma":0.001951191,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00710156,"about_ca_topic_score_gemma":0.01295911,"domain_scores_codex":[0.9991593,0.0001783424,0.00002666411,0.000165094,0.0003273712,0.0001432177],"domain_scores_gemma":[0.9992276,0.0002594737,0.00004613259,0.0002352487,0.0001410122,0.00009054479],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003367396,0.0003337134,0.00113639,0.0004441088,0.0002924699,0.0005017422,0.000288019,0.6443832,0.02419729,0.1043412,0.03613984,0.1876053],"study_design_scores_gemma":[0.00005538823,0.00003285355,0.0001944876,0.000008940622,0.0000220847,0.00008349992,0.00005308494,0.9321552,0.005558677,0.05486783,0.006948984,0.00001899739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02035044,0.0002846461,0.969627,0.0004652278,0.000131361,0.0001305867,0.0003076951,0.002522847,0.006180151],"genre_scores_gemma":[0.386762,0.0003234116,0.6054281,0.0001984073,0.0001568353,0.0002779918,0.001134883,0.0006074872,0.005110784],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00710156,"threshold_uncertainty_score":0.01412046,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2082030917","doi":"10.1287/ijoc.13.3.210.12632","title":"Fast Heuristics for the Maximum Feasible Subsystem Problem","year":2001,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Mathematical optimization; Cardinality (data modeling); Computer science; Set (abstract data type); Linear programming; Mathematics; Algorithm; Data mining","authors":[{"name":"John W. Chinneck","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03735851513923256,"gpt":0.2758705309087951,"spread":0.2385120157695625,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00166958,0.001644151,0.001449735,0.0017165,0.0009916943,0.001180365,0.001882039,0.001420892,0.005996355],"category_scores_gemma":[0.005549254,0.0009783533,0.001298587,0.002302965,0.0008001095,0.002493165,0.001319377,0.002037542,0.001062618],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001589719,"about_ca_system_score_gemma":0.002904704,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006011101,"about_ca_topic_score_gemma":0.01111024,"domain_scores_codex":[0.9987274,0.0004947867,0.00005786383,0.0001708806,0.0002637775,0.0002852431],"domain_scores_gemma":[0.996042,0.002869514,0.0002134494,0.0004397069,0.0003170109,0.0001182978],"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.0005683911,0.0002495739,0.0008078709,0.000486496,0.000123029,0.0002395249,0.0002604694,0.6884844,0.00657354,0.04931434,0.02302571,0.2298667],"study_design_scores_gemma":[0.0002498942,0.0001414293,0.0003938078,0.00004982915,0.00005736498,0.0001105326,0.0001134176,0.940041,0.003722984,0.04644036,0.008643202,0.00003623537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0289823,0.0008809008,0.9603658,0.0002994922,0.00008082663,0.0003043969,0.0003544389,0.002390489,0.006341273],"genre_scores_gemma":[0.1251967,0.0004951917,0.8705639,0.0001644121,0.00006630255,0.0004212462,0.0009786718,0.0003358826,0.001777782],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006011101,"threshold_uncertainty_score":0.02005976,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1531964914","doi":"10.5555/2095116.2095241","title":"Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling","year":2012,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Set cover problem; Mathematics; Approximation algorithm; Covering problems; Cover (algebra); Combinatorics; Set (abstract data type); Sampling (signal processing); Matching (statistics); Binary logarithm; Discrete mathematics; Computer science","authors":[{"name":"Timothy M. Chan","is_ca":true},{"name":"Elyot Grant","is_ca":true},{"name":"Jochen Könemann","is_ca":true},{"name":"Malcolm Sharpe","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03678905663808665,"gpt":0.2687750987619836,"spread":0.2319860421238969,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001667878,0.001103782,0.001383716,0.001042157,0.0006304801,0.001607369,0.003203109,0.001049487,0.002945618],"category_scores_gemma":[0.007745108,0.0006549179,0.001207328,0.001939699,0.0008914308,0.003614387,0.002145573,0.001651123,0.0005173269],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002029726,"about_ca_system_score_gemma":0.001343777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003823619,"about_ca_topic_score_gemma":0.004811602,"domain_scores_codex":[0.998251,0.0004869893,0.00007512375,0.0004291567,0.0004661456,0.0002916197],"domain_scores_gemma":[0.9962326,0.002075264,0.0002818732,0.0008587659,0.0002803702,0.0002711713],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005575726,0.0003621374,0.003442788,0.0002581261,0.000110419,0.0001735714,0.0002329219,0.7909775,0.01133617,0.0801278,0.005420395,0.1070006],"study_design_scores_gemma":[0.0000247728,0.00005828412,0.0002212217,0.000005978941,0.00001311047,0.00004954686,0.00001887778,0.9781424,0.001124273,0.01972142,0.0006134852,0.000006582727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.110666,0.000501176,0.8827129,0.0005168252,0.00005884218,0.0001391096,0.0003374728,0.00120002,0.0038677],"genre_scores_gemma":[0.6848792,0.0003308492,0.3100848,0.0002370487,0.00009473981,0.0002659744,0.001028992,0.0002364222,0.002842013],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003823619,"threshold_uncertainty_score":0.01472682,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2005509629","doi":"10.1007/s10107-002-0370-6","title":"Approximating disjoint-path problems using packing integer programs","year":2004,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Disjoint sets; Mathematics; Bin packing problem; Combinatorics; Integer (computer science); Path (computing); Approximation algorithm; Packing problems; Vertex (graph theory); Integer programming; Discrete mathematics; Mathematical optimization; Algorithm; Computer science; Bin; Graph","authors":[{"name":"Stavros G. Kolliopoulos","is_ca":true},{"name":"Clifford Stein","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05865507247347649,"gpt":0.2737072331314133,"spread":0.2150521606579368,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002199297,0.001800108,0.002185839,0.001825357,0.0009319551,0.003349136,0.00247736,0.002049816,0.007081305],"category_scores_gemma":[0.0151786,0.001304174,0.001488001,0.003632956,0.001168211,0.008684224,0.00238716,0.003566096,0.0008050535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002228769,"about_ca_system_score_gemma":0.00161413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002982309,"about_ca_topic_score_gemma":0.004472892,"domain_scores_codex":[0.9980078,0.0006947898,0.00009157098,0.0003315426,0.0005284661,0.0003457834],"domain_scores_gemma":[0.9912845,0.006932795,0.0005267375,0.000711725,0.0003072445,0.0002370599],"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.0004536496,0.000469961,0.001639068,0.0002974857,0.0000803123,0.00008265262,0.0001709166,0.7905889,0.001352103,0.0895649,0.006372939,0.1089271],"study_design_scores_gemma":[0.00003089202,0.00004266788,0.0001138993,0.00001616009,0.00001735538,0.00002674081,0.0000433862,0.9333862,0.0006011259,0.06467263,0.001043329,0.000005640134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1294774,0.001473473,0.8473102,0.00142149,0.0001808645,0.0001747325,0.0004493527,0.001261897,0.01825047],"genre_scores_gemma":[0.4364617,0.001074938,0.5536785,0.0002805067,0.0001861544,0.0003227593,0.001094161,0.0004908002,0.006410656],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007081305,"threshold_uncertainty_score":0.02368933,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1982713256","doi":"10.1016/j.disopt.2010.08.001","title":"The minimum spanning tree problem with conflict constraints and its variations","year":2010,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick; Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Time complexity; k-minimum spanning tree; Clique; Steiner tree problem; Bounded function; Spanning tree; Graph; Minimum spanning tree; Heuristic; Discrete mathematics; Mathematical optimization; Tree structure; K-ary tree; Binary tree","authors":[{"name":"Ruonan Zhang","is_ca":true},{"name":"Santosh N. Kabadi","is_ca":true},{"name":"Abraham P. Punnen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01236291145485941,"gpt":0.2336600920583558,"spread":0.2212971806034964,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002123986,0.001001541,0.00189986,0.001165006,0.0008828785,0.002910821,0.002651307,0.002293224,0.003491195],"category_scores_gemma":[0.01013703,0.0007115816,0.001024027,0.004716706,0.001709621,0.00757996,0.002222574,0.003747968,0.0004457308],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001323428,"about_ca_system_score_gemma":0.001183654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001800437,"about_ca_topic_score_gemma":0.001535348,"domain_scores_codex":[0.9984176,0.0006336678,0.00007909257,0.0002881782,0.0004588198,0.0001225675],"domain_scores_gemma":[0.9940252,0.004437894,0.0005831966,0.0003901937,0.0003100751,0.0002534331],"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.0002042955,0.0001835526,0.0004862693,0.0003603371,0.00008751558,0.0001681802,0.0001433363,0.3928778,0.001232982,0.5328387,0.01045799,0.06095896],"study_design_scores_gemma":[0.00003559254,0.0000276556,0.0002319263,0.00002476735,0.00002203694,0.0001548608,0.00004071803,0.5138286,0.0002524612,0.480693,0.004668837,0.00001945087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05027585,0.00675537,0.9160095,0.003274437,0.0003085441,0.00006524428,0.0005294501,0.0001531913,0.02262838],"genre_scores_gemma":[0.5958053,0.008354646,0.3753563,0.0008041437,0.001670447,0.0003124748,0.001043141,0.0003514914,0.01630199],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003491195,"threshold_uncertainty_score":0.01167923,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2125240990","doi":"10.1023/b:joco.0000038911.67280.3f","title":"On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the θ-Function","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Technische Universiteit Delft; Universiteit Utrecht; Deutsche Forschungsgemeinschaft","keywords":"Mathematics; Combinatorics; Semidefinite programming; Approximation algorithm; Bounded function; Graph; Relaxation (psychology); Discrete mathematics; Maximum cut; Algorithm; Mathematical optimization","authors":[{"name":"Etienne de Klerk","is_ca":true},{"name":"Dmitrii V. Ṗasechnik","is_ca":false},{"name":"Joost P. Warners","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01223000613380427,"gpt":0.2180044899597861,"spread":0.2057744838259818,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004712902,0.002084481,0.003425859,0.001994377,0.001620122,0.003695635,0.00573985,0.003328848,0.008145647],"category_scores_gemma":[0.02858309,0.00124251,0.001771945,0.004694732,0.002865822,0.01050966,0.004007641,0.004301536,0.001466171],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003874093,"about_ca_system_score_gemma":0.00308674,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005003412,"about_ca_topic_score_gemma":0.006365009,"domain_scores_codex":[0.9964935,0.001745567,0.0001622861,0.000506858,0.0007369123,0.0003548669],"domain_scores_gemma":[0.9790069,0.01536012,0.0008958541,0.002962847,0.00116262,0.0006116511],"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.001499125,0.0003828559,0.002183439,0.0003795777,0.0001631293,0.00007483061,0.0002837303,0.6374008,0.002667702,0.1610929,0.009311582,0.1845603],"study_design_scores_gemma":[0.00005481324,0.00005638802,0.0003006271,0.00002795608,0.00003594034,0.00005012979,0.00004936893,0.8777672,0.000613706,0.1199626,0.001064422,0.00001667606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0391659,0.00155981,0.9497644,0.00113183,0.000173893,0.0001333939,0.0002001086,0.0009994453,0.006871257],"genre_scores_gemma":[0.3488642,0.001467961,0.6394535,0.0007520328,0.000320805,0.0004226658,0.000898855,0.0007315564,0.007088301],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008145647,"threshold_uncertainty_score":0.02810866,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2167508847","doi":"10.1287/moor.26.4.796.10012","title":"When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?","year":2001,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Constraint (computer-aided design); Mathematics; Lift (data mining); Integer programming; Mathematical optimization; Integer (computer science); Mathematical economics; Computer science; Geometry; Data mining","authors":[{"name":"Michel X. Goemans","is_ca":false},{"name":"Levent Tunçel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08849708786235158,"gpt":0.3650675527512243,"spread":0.2765704648888727,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01460974,0.001112355,0.001434903,0.001055103,0.002569098,0.002723888,0.001699385,0.003031218,0.009205751],"category_scores_gemma":[0.07263664,0.0008483378,0.001575124,0.001635597,0.004818596,0.0113482,0.005222751,0.004145732,0.00195343],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007323083,"about_ca_system_score_gemma":0.002432232,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005466854,"about_ca_topic_score_gemma":0.0007166041,"domain_scores_codex":[0.9942059,0.002911903,0.0003585808,0.0005725874,0.001078394,0.000872644],"domain_scores_gemma":[0.9644104,0.02704245,0.00222546,0.004023547,0.001501946,0.0007962708],"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.0006743378,0.0003782097,0.002533399,0.0003027138,0.00005877442,0.0003224863,0.0005492585,0.03075939,0.006784481,0.8184229,0.003782357,0.1354317],"study_design_scores_gemma":[0.0001166538,0.000462662,0.0006428586,0.0001360499,0.00004533247,0.0003702076,0.0004067721,0.1493487,0.01121651,0.8331894,0.003995471,0.00006948576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1373233,0.0003221372,0.8382339,0.003011188,0.0002636077,0.0003090895,0.00009490618,0.0005004563,0.01994131],"genre_scores_gemma":[0.5565442,0.0005098336,0.4359393,0.0007236804,0.0002183774,0.0002980356,0.0001757737,0.0004535747,0.005137247],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01460974,"threshold_uncertainty_score":0.07726461,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2087012565","doi":"10.2178/jsl/1203350791","title":"Consequences of the provability of <i>NP</i> ⊆ <i>P</i>/<i>poly</i>","year":2007,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Hierarchy; Polynomial hierarchy; Mathematics; Combinatorics; Time complexity; P versus NP problem; Polynomial; Discrete mathematics; Computational complexity theory; Algorithm","authors":[{"name":"Stephen Cook","is_ca":true},{"name":"Jan Krajı́ček","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02375080234186978,"gpt":0.2625584848825566,"spread":0.2388076825406868,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004829844,0.000456063,0.0006028885,0.001136114,0.002968576,0.003650293,0.001835061,0.001486064,0.008770843],"category_scores_gemma":[0.02866378,0.0007383617,0.001333376,0.0007513343,0.007456217,0.007864632,0.004189718,0.005457566,0.0006830849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002018902,"about_ca_system_score_gemma":0.001757128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002446041,"about_ca_topic_score_gemma":0.002326662,"domain_scores_codex":[0.9936683,0.001603252,0.000379899,0.0009338428,0.001969939,0.001444878],"domain_scores_gemma":[0.9372201,0.04840246,0.002582133,0.004000338,0.005286145,0.002508889],"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.0006476163,0.0003779309,0.006042557,0.000462007,0.0001435848,0.002763435,0.001593319,0.007859513,0.01366541,0.9346552,0.00970693,0.02208259],"study_design_scores_gemma":[0.0002007982,0.0001570138,0.004334128,0.0000935491,0.0001067574,0.001029707,0.001050924,0.02379804,0.0250147,0.9348527,0.009283664,0.00007799119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5140052,0.0006254839,0.2933957,0.01248918,0.0007068604,0.0005824026,0.001379151,0.003563811,0.1732523],"genre_scores_gemma":[0.9750912,0.0002001734,0.02069918,0.0009166394,0.0002196777,0.0001238695,0.0003906115,0.000211921,0.002146774],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008770843,"threshold_uncertainty_score":0.0293414,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2004012902","doi":"10.1145/780542.780629","title":"A new multilayered PCP and the hardness of hypergraph vertex cover","year":2003,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Environment and Climate Change Canada","keywords":"Hypergraph; Cover (algebra); Vertex (graph theory); Vertex cover; Edge cover; Computer science; Combinatorics; Mathematics; Algorithm; Theoretical computer science; Engineering; Approximation algorithm; Graph; Mechanical engineering","authors":[{"name":"Irit Dinur","is_ca":false},{"name":"Venkatesan Guruswami","is_ca":false},{"name":"Subhash Khot","is_ca":false},{"name":"Oded Regev","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01256467607444679,"gpt":0.2133160636748331,"spread":0.2007513876003863,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001169373,0.0003927145,0.0008256646,0.0008609704,0.001201779,0.002505704,0.001694428,0.001412573,0.004378406],"category_scores_gemma":[0.01001541,0.0006440799,0.000926354,0.00166494,0.001978677,0.007507447,0.004929562,0.00266228,0.0005015809],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002008073,"about_ca_system_score_gemma":0.00145833,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002952025,"about_ca_topic_score_gemma":0.002307147,"domain_scores_codex":[0.9973648,0.0004299952,0.0001608903,0.0006755056,0.0008821842,0.0004866837],"domain_scores_gemma":[0.9916942,0.003884872,0.000918131,0.002358334,0.0006784293,0.000466102],"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.001439986,0.000256692,0.01012765,0.0005999134,0.0001561481,0.000859576,0.0007686961,0.220233,0.04253287,0.5456842,0.01103855,0.1663028],"study_design_scores_gemma":[0.0001267723,0.0002993674,0.003231024,0.00008928961,0.00009062352,0.001335917,0.0001976039,0.6320621,0.02549211,0.3273273,0.00963444,0.0001135218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3316674,0.0007690124,0.6481904,0.00235732,0.00006995133,0.0001446018,0.001416913,0.00130631,0.014078],"genre_scores_gemma":[0.8959808,0.0003860997,0.09949016,0.0003105652,0.00007672138,0.0001239422,0.0007416,0.0001032226,0.002786988],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004378406,"threshold_uncertainty_score":0.01464725,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W153015188","doi":"10.4086/toc.2006.v002a004","title":"","year":2006,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical proof; Rank (graph theory); Combinatorics; Mathematics; Pigeonhole principle; Discrete mathematics; Upper and lower bounds","authors":[{"name":"Joshua Buresh-Oppenheim","is_ca":false},{"name":"Nicola Galesi","is_ca":false},{"name":"Shlomo Hoory","is_ca":false},{"name":"Avner Magen","is_ca":false},{"name":"Toniann Pitassi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01345998444829758,"gpt":0.2270239102562561,"spread":0.2135639258079585,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005596844,0.001836037,0.001432892,0.003537187,0.00223362,0.005970677,0.005680564,0.001759304,0.02218941],"category_scores_gemma":[0.03118616,0.001713729,0.003218145,0.003109014,0.003664308,0.014451,0.00796172,0.01071878,0.006573033],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002919429,"about_ca_system_score_gemma":0.003229585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00205155,"about_ca_topic_score_gemma":0.003370554,"domain_scores_codex":[0.9892608,0.002264631,0.0006502735,0.002243808,0.004795102,0.0007854523],"domain_scores_gemma":[0.9682459,0.01506994,0.001772448,0.01094378,0.003124559,0.0008434561],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000219306,0.0002508543,0.0009133919,0.0007596196,0.0002120881,0.0001925633,0.0004658435,0.02268814,0.01185467,0.7164364,0.02048516,0.2255219],"study_design_scores_gemma":[0.00009254463,0.0001620496,0.0005323514,0.0001165368,0.0002427618,0.0005592254,0.0001503852,0.1521418,0.02812943,0.7431599,0.07459775,0.0001153527],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.003111896,0.000247058,0.9795999,0.001068456,0.0001655252,0.0001886745,0.0003021993,0.001819151,0.0134971],"genre_scores_gemma":[0.1101963,0.0006039436,0.8739066,0.001368336,0.0005500661,0.0005712123,0.001206242,0.001357274,0.01023991],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9778106,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994612875","doi":"10.1006/jagm.2002.1221","title":"Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem","year":2002,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Háskóli Íslands; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Rectangle; Approximation algorithm; Combinatorics; Mathematics; Constant (computer programming); Space (punctuation); Algorithm; Discrete mathematics; Computer science; Geometry","authors":[{"name":"Daya Ram Gaur","is_ca":true},{"name":"Toshihide Ibaraki","is_ca":false},{"name":"Ramesh Krishnamurti","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04323806333478964,"gpt":0.2569635155234735,"spread":0.2137254521886838,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002785352,0.002557668,0.002921213,0.002222289,0.001870355,0.003977288,0.00633344,0.003855984,0.01648058],"category_scores_gemma":[0.01485638,0.001415099,0.001890117,0.005403939,0.001765816,0.011369,0.003921849,0.004338162,0.003394782],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003864369,"about_ca_system_score_gemma":0.0033539,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007206263,"about_ca_topic_score_gemma":0.008866204,"domain_scores_codex":[0.9963935,0.001191511,0.0001738939,0.0007051892,0.0007831039,0.0007528064],"domain_scores_gemma":[0.9917163,0.005261922,0.0006657102,0.001394264,0.0005284073,0.0004333636],"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.003027544,0.001168385,0.001813425,0.000903621,0.0002653659,0.000203352,0.0007283081,0.3943657,0.006286841,0.1709299,0.04311488,0.3771927],"study_design_scores_gemma":[0.0005502034,0.000202659,0.000460608,0.00004877859,0.0001260414,0.0002160331,0.0002145883,0.8635612,0.002033246,0.1257933,0.006748779,0.00004448089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09762152,0.005226175,0.8608574,0.003757455,0.0004054573,0.0004609931,0.0008239754,0.003195279,0.02765183],"genre_scores_gemma":[0.3110537,0.002073214,0.6693249,0.0007474505,0.0003539568,0.0005181904,0.002108674,0.000928034,0.01289191],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01648058,"threshold_uncertainty_score":0.0551331,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964276725","doi":"10.1007/s00453-011-9526-1","title":"A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties","year":2011,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Submodular set function; Approximation algorithm; Theory of computation; Facility location problem; Mathematics; Linear programming relaxation; Relaxation (psychology); Dual (grammatical number); Exponential function; Integer (computer science); Algorithm; Mathematical optimization; Function (biology); Combinatorics; Linear programming; Computer science","authors":[{"name":"Donglei Du","is_ca":true},{"name":"Ruixing Lu","is_ca":false},{"name":"Dachuan Xu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03518398958303515,"gpt":0.2237815915891898,"spread":0.1885976020061547,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002798096,0.001656508,0.00269721,0.00124213,0.0009873605,0.002807825,0.003524708,0.002917884,0.008012298],"category_scores_gemma":[0.007507813,0.001140207,0.001183047,0.002657377,0.001129129,0.003304576,0.002973414,0.004779473,0.001639008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002373026,"about_ca_system_score_gemma":0.003985759,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003695986,"about_ca_topic_score_gemma":0.004459228,"domain_scores_codex":[0.9984675,0.0005770791,0.00005873136,0.0003095874,0.0003497344,0.0002374615],"domain_scores_gemma":[0.9973424,0.001602563,0.000163046,0.0003429337,0.000292636,0.0002565054],"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.0007220819,0.0009058387,0.001050602,0.0003675833,0.0001226507,0.0001234084,0.0001422786,0.650927,0.002092942,0.1024028,0.0264235,0.2147193],"study_design_scores_gemma":[0.0001090454,0.00004611176,0.00008149178,0.00001582618,0.00001610319,0.00004840787,0.00002087317,0.9644903,0.0003242787,0.03342186,0.001415847,0.000009939145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01096566,0.0004371279,0.9819738,0.0007906586,0.0001527577,0.0001200943,0.000222657,0.0005333176,0.00480398],"genre_scores_gemma":[0.1466265,0.0003738645,0.8456627,0.0003397084,0.0002035779,0.0003878764,0.0006300946,0.0002798577,0.005495918],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008012298,"threshold_uncertainty_score":0.02680379,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2149565746","doi":"10.1145/1824777.1824786","title":"On distributing symmetric streaming computations","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Computation; Sublinear function; Communication complexity; Theoretical computer science; Computational complexity theory; Class (philosophy); Streaming algorithm; Algorithm; Distributed computing; Mathematics; Upper and lower bounds; Discrete mathematics","authors":[{"name":"Jon Feldman","is_ca":false},{"name":"S. Muthukrishnan","is_ca":false},{"name":"Anastasios Sidiropoulos","is_ca":false},{"name":"Clifford Stein","is_ca":false},{"name":"Zoya Svitkina","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02021759233371228,"gpt":0.2677943535910513,"spread":0.247576761257339,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003179575,0.0008078296,0.001185589,0.0007659183,0.00151734,0.002535283,0.002110593,0.001202249,0.006023813],"category_scores_gemma":[0.01844064,0.0005402242,0.001035931,0.001402197,0.003065086,0.007721324,0.003639875,0.002227164,0.001173383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002425964,"about_ca_system_score_gemma":0.002536896,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001936073,"about_ca_topic_score_gemma":0.001438818,"domain_scores_codex":[0.9964309,0.00106105,0.0002274271,0.000741948,0.001047718,0.000490984],"domain_scores_gemma":[0.9893876,0.005016707,0.000654683,0.003390065,0.001173026,0.0003778624],"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.0004708289,0.0001072242,0.001432108,0.0001530018,0.00003802632,0.0001241931,0.0002852721,0.1719889,0.004966989,0.7784947,0.003977944,0.0379609],"study_design_scores_gemma":[0.00007156713,0.00007873781,0.0001508387,0.00002299159,0.00001759422,0.00007664783,0.0000560821,0.5520679,0.003064918,0.4398777,0.004495849,0.0000190321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05217927,0.0002343318,0.9333778,0.001110467,0.000137277,0.000186724,0.0001893033,0.0009795272,0.01160531],"genre_scores_gemma":[0.7482094,0.0005464114,0.2385445,0.0006230081,0.0002935737,0.0004793844,0.0004873747,0.0003825309,0.01043405],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006023813,"threshold_uncertainty_score":0.02015167,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2009786555","doi":"10.1109/focs.2012.55","title":"A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint","year":2012,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Matroid; Submodular set function; Greedy algorithm; Monotone polygon; Mathematics; Rounding; Function (biology); Combinatorics; Constraint (computer-aided design); Mathematical optimization; Approximation algorithm; Algorithm; Discrete mathematics; Combinatorial optimization; Computer science","authors":[{"name":"Justin Ward","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01981169866179729,"gpt":0.2545320422452528,"spread":0.2347203435834555,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001683999,0.001896045,0.001553793,0.001351314,0.0006390126,0.001878964,0.002580305,0.001953683,0.009193577],"category_scores_gemma":[0.00727708,0.0008560674,0.001408921,0.001995938,0.001164189,0.003051371,0.003195636,0.002619516,0.002781924],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00175934,"about_ca_system_score_gemma":0.002282572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001729909,"about_ca_topic_score_gemma":0.002549445,"domain_scores_codex":[0.9985029,0.0004014284,0.00007440252,0.0003408955,0.0004636727,0.0002168334],"domain_scores_gemma":[0.9981284,0.001114279,0.000139828,0.0003610565,0.0001512957,0.0001051052],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003655298,0.0004803282,0.0007612275,0.0005074888,0.0001274576,0.0001661728,0.0002214046,0.3433202,0.008917786,0.1433452,0.02172154,0.4800657],"study_design_scores_gemma":[0.0001275498,0.000118444,0.0001720632,0.00002853449,0.00002525527,0.000151502,0.00004066696,0.9175724,0.001758626,0.07635234,0.003631551,0.00002098327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004663142,0.0001809491,0.989702,0.0002560509,0.00004474928,0.0001112329,0.00008342609,0.0008068176,0.004151729],"genre_scores_gemma":[0.0920386,0.0002331896,0.9035602,0.00028939,0.0001061489,0.0003845981,0.0003340473,0.0003393115,0.002714613],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009193577,"threshold_uncertainty_score":0.03075558,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2060363698","doi":"10.1145/1290672.1290685","title":"Approximation algorithms and hardness results for cycle packing problems","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of Alberta","funders":"","keywords":"Approximation algorithm; Combinatorics; Disjoint sets; Mathematics; Upper and lower bounds; Packing problems; Undirected graph; Binary logarithm; Log-log plot; Discrete mathematics; Graph; Algorithm","authors":[{"name":"Michael Krivelevich","is_ca":false},{"name":"Zeev Nutov","is_ca":false},{"name":"Mohammad R. Salavatipour","is_ca":true},{"name":"Jacques Verstraëte","is_ca":true},{"name":"Raphael Yuster","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04104861257864342,"gpt":0.285998406091064,"spread":0.2449497935124205,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003530907,0.003368443,0.002694593,0.003218844,0.002442701,0.007959092,0.006354414,0.004331031,0.01034623],"category_scores_gemma":[0.02689593,0.00194058,0.003979444,0.007157277,0.003515933,0.01251064,0.004355549,0.008243607,0.001867594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006079181,"about_ca_system_score_gemma":0.002479064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003971525,"about_ca_topic_score_gemma":0.002612035,"domain_scores_codex":[0.9939227,0.001414027,0.0003647955,0.001490507,0.001704206,0.001103797],"domain_scores_gemma":[0.9792781,0.01560287,0.001259256,0.00238859,0.0008428048,0.0006283082],"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.00114272,0.0008846932,0.003336681,0.001462474,0.000347228,0.0002965914,0.0009659021,0.5053006,0.004554944,0.3311287,0.02696725,0.1236123],"study_design_scores_gemma":[0.0001472922,0.00007223445,0.0005489192,0.0001214538,0.00008386674,0.0002391649,0.0001638791,0.6395373,0.00171941,0.3505262,0.006805443,0.00003482712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08015478,0.006611415,0.8653235,0.006285199,0.0002983223,0.0003761626,0.001905477,0.002001995,0.03704321],"genre_scores_gemma":[0.5172083,0.007711952,0.4488488,0.002105589,0.00125591,0.001259088,0.005926514,0.001349952,0.01433388],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01034623,"threshold_uncertainty_score":0.04410774,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2003104918","doi":"10.1007/s00037-001-8195-x","title":"Communication complexity towards lower bounds on circuit depth","year":2001,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Boolean function; Circuit complexity; Communication complexity; Upper and lower bounds; Omega; Mathematics; Binary logarithm; Bounded function; Function (biology); Discrete mathematics; Boolean circuit; Conjecture; Combinatorics; Characterization (materials science); Electronic circuit; Physics; Mathematical analysis","authors":[{"name":"Jeff Edmonds","is_ca":true},{"name":"Russell Impagliazzo","is_ca":false},{"name":"Steven Rudich","is_ca":false},{"name":"Jiřı́ Sgall","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1246287817561772,"gpt":0.3159649090989075,"spread":0.1913361273427303,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008463288,0.005100482,0.004312089,0.006398665,0.003784882,0.01144963,0.01060217,0.006134367,0.02146068],"category_scores_gemma":[0.07139127,0.00309061,0.004055646,0.008619263,0.007417938,0.03470306,0.01263131,0.02305036,0.004190336],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.01150192,"about_ca_system_score_gemma":0.004520395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004932929,"about_ca_topic_score_gemma":0.006004489,"domain_scores_codex":[0.9867776,0.003082916,0.0003789829,0.002254298,0.004817618,0.002688527],"domain_scores_gemma":[0.8607691,0.1192807,0.002502595,0.009900911,0.004646876,0.0028999],"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.0008967411,0.0004372341,0.001423188,0.0008922399,0.0001181757,0.0001473004,0.0008099985,0.08635771,0.004366122,0.805893,0.03386221,0.06479615],"study_design_scores_gemma":[0.0000688101,0.00005442481,0.0004862315,0.0001694926,0.00009391575,0.00008480496,0.0001041414,0.1513087,0.002208234,0.8360214,0.009360155,0.00003964859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07169758,0.01474687,0.7164593,0.03154431,0.001687115,0.0004046058,0.002319894,0.002563023,0.1585773],"genre_scores_gemma":[0.621447,0.01932631,0.2605947,0.01202016,0.008723834,0.002366564,0.003808189,0.005461532,0.0662518],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02146068,"threshold_uncertainty_score":0.0834527,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2912359042","doi":"10.1145/1806689.1806768","title":"QIP = PSPACE","year":2010,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Perimeter Institute","funders":"Centre for Quantum Technologies; National Research Foundation Singapore; National Science Foundation","keywords":"PSPACE; Mathematics; Multiplicative function; Class (philosophy); Mathematical proof; Computational complexity theory; Discrete mathematics; Computer science; Combinatorics; Algorithm","authors":[{"name":"Rahul Jain","is_ca":false},{"name":"Zhengfeng Ji","is_ca":true},{"name":"Sarvagya Upadhyay","is_ca":true},{"name":"John Watrous","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00786021869120312,"gpt":0.2268176467357108,"spread":0.2189574280445077,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00238716,0.0008035761,0.001053824,0.0008962226,0.002119857,0.004215986,0.001719454,0.00107112,0.01614482],"category_scores_gemma":[0.01113739,0.0006709928,0.001882199,0.001076994,0.003062133,0.0079228,0.005792009,0.007656826,0.002500335],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001728702,"about_ca_system_score_gemma":0.002630829,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001842736,"about_ca_topic_score_gemma":0.001436215,"domain_scores_codex":[0.9949113,0.000632019,0.0002747818,0.001601008,0.001784876,0.0007961251],"domain_scores_gemma":[0.9859253,0.008457709,0.0008949148,0.002253019,0.001722514,0.0007465551],"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.0001647597,0.0001335703,0.0008753348,0.0005181815,0.00006689376,0.0001169888,0.000328027,0.009292481,0.00281246,0.9422457,0.01337337,0.03007216],"study_design_scores_gemma":[0.0000436666,0.000044624,0.0003308194,0.00002738114,0.00002985521,0.0001709629,0.00006930417,0.03046215,0.004513538,0.9489777,0.01531306,0.00001698579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05206738,0.0005660423,0.7996401,0.008121349,0.0003385257,0.0004202067,0.002943566,0.002747343,0.1331555],"genre_scores_gemma":[0.7481399,0.0009298907,0.2058467,0.00501411,0.0007394346,0.0009797201,0.005922535,0.001299623,0.03112811],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01614482,"threshold_uncertainty_score":0.0540098,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2117946984","doi":"10.5555/1109557.1109614","title":"All-pairs shortest paths for unweighted undirected graphs in o(mn) time","year":2006,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Undirected graph; Mathematics; Graph; Discrete mathematics","authors":[{"name":"Timothy M. Chan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01560847232180834,"gpt":0.2342218529718607,"spread":0.2186133806500523,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001202245,0.001859065,0.001960152,0.001405158,0.00141819,0.002798114,0.003069529,0.001720179,0.01070087],"category_scores_gemma":[0.006695549,0.0008063376,0.00132104,0.002618945,0.001020083,0.01198563,0.003227974,0.00168361,0.001931953],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001791402,"about_ca_system_score_gemma":0.001821012,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002632958,"about_ca_topic_score_gemma":0.00366877,"domain_scores_codex":[0.9977049,0.0006224159,0.0001982701,0.000717767,0.0004480242,0.0003085955],"domain_scores_gemma":[0.9949217,0.003055748,0.0004077463,0.0009594872,0.0003757557,0.0002795336],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001449799,0.0006386881,0.002160688,0.003194699,0.0003220214,0.0004337737,0.0009714694,0.2292127,0.0201717,0.0925651,0.04374271,0.6051366],"study_design_scores_gemma":[0.0005701259,0.0003288185,0.001020778,0.0001494361,0.0001690363,0.0007477329,0.0008252913,0.5502557,0.01582901,0.4042202,0.02578851,0.0000952746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.14706,0.001760361,0.8268509,0.002646235,0.0003397853,0.0009120909,0.002359164,0.004165231,0.01390626],"genre_scores_gemma":[0.2517799,0.001104277,0.7343082,0.000284824,0.0001893559,0.0004439826,0.00367399,0.0007863069,0.007429181],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01070087,"threshold_uncertainty_score":0.03579801,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2145866065","doi":"10.1007/s00453-012-9740-5","title":"Improved Approximation Algorithms for the Min-max Tree Cover and Bounded Tree Cover Problems","year":2013,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Combinatorics; Cover (algebra); Bounded function; Tree (set theory); Approximation algorithm; Theory of computation; Upper and lower bounds; Discrete mathematics; Graph; Algorithm","authors":[{"name":"Mohammad Reza Khani","is_ca":false},{"name":"Mohammad R. Salavatipour","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02354457203300562,"gpt":0.239021698037697,"spread":0.2154771260046914,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004585013,0.002361436,0.003174567,0.002699788,0.001450919,0.004744292,0.006672211,0.002882036,0.01017104],"category_scores_gemma":[0.02402459,0.001274258,0.002624993,0.005479043,0.001795481,0.01172498,0.004441814,0.00648113,0.001720759],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005555797,"about_ca_system_score_gemma":0.003373533,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005012253,"about_ca_topic_score_gemma":0.008408488,"domain_scores_codex":[0.9956683,0.001361877,0.0002021009,0.0007279631,0.001346636,0.0006930279],"domain_scores_gemma":[0.9849182,0.01053705,0.0007925817,0.002273247,0.000882919,0.0005961409],"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.002171026,0.0009802533,0.003203803,0.0009125551,0.0002526304,0.0001411246,0.0005599051,0.4057687,0.003697057,0.1963114,0.0360065,0.3499952],"study_design_scores_gemma":[0.0001431957,0.00007676089,0.0004688656,0.00004430264,0.00009739319,0.0001050536,0.00006870631,0.8628972,0.001035167,0.1315625,0.003479321,0.0000216565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05919836,0.004702439,0.9138435,0.00292172,0.0004310739,0.0002427183,0.0009970166,0.001721357,0.01594185],"genre_scores_gemma":[0.3678501,0.002386152,0.6123803,0.0008549765,0.001009415,0.0006043062,0.002850003,0.0009654165,0.01109945],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01017104,"threshold_uncertainty_score":0.04031026,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2075025003","doi":"10.1007/bf02984830","title":"What this country needs is an 18c piece","year":2003,"lang":"en","type":"article","venue":"The Mathematical Intelligencer","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Business","authors":[{"name":"Jeffrey Shallit","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06498037748851589,"gpt":0.3063643580093941,"spread":0.2413839805208782,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002418972,0.000676752,0.0009652826,0.001351397,0.006429723,0.009167283,0.00111343,0.007026435,0.1357906],"category_scores_gemma":[0.008313761,0.0003952126,0.0008622014,0.00156669,0.00251194,0.006871717,0.004103587,0.007536937,0.05398933],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002924099,"about_ca_system_score_gemma":0.01063973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01952049,"about_ca_topic_score_gemma":0.03364649,"domain_scores_codex":[0.9987144,0.0002101134,0.00005778329,0.0001173749,0.0004399194,0.0004603958],"domain_scores_gemma":[0.9933249,0.0008269985,0.0002262519,0.0007087901,0.002951192,0.001961838],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003964569,0.00002454874,0.0002981852,0.000112544,0.000006915666,0.00008947425,0.0002293872,0.00006653088,0.0002010705,0.02460468,0.9463732,0.02795378],"study_design_scores_gemma":[0.000006897934,0.000007801921,0.0003905379,0.0001438806,0.000005644348,0.00003314363,0.0006597452,0.00001913752,0.00005159989,0.005187161,0.9934832,0.00001101415],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"commentary","genre_gemma":"commentary","genre_scores_codex":[0.002257917,0.005067219,0.001168522,0.6289338,0.05715391,0.00005429141,0.001811415,0.0003453288,0.3032075],"genre_scores_gemma":[0.03742646,0.008284762,0.006010038,0.2850854,0.01552386,0.0002242956,0.004028239,0.0009228478,0.6424941],"genre_candidate":"commentary","genre_consensus":"commentary","teacher_disagreement_score":0.1357906,"threshold_uncertainty_score":0.4542646,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994932713","doi":"10.1007/s10479-008-0481-4","title":"A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem","year":2008,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Direktion für Entwicklung und Zusammenarbeit","keywords":"Mathematics; Semidefinite programming; Rounding; Partition (number theory); Combinatorics; Hyperplane; Disjoint sets; Algorithm; Graph partition; Maximum cut; Partition problem; Branch and cut; Integer programming; Graph; Computer science; Mathematical optimization","authors":[{"name":"Bissan Ghaddar","is_ca":true},{"name":"Miguel F. Anjos","is_ca":true},{"name":"Frauke Liers","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2635310348025377,"gpt":0.4164277997338451,"spread":0.1528967649313074,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001451454,0.001440223,0.002670845,0.001183141,0.00124598,0.002108499,0.002393821,0.002014278,0.007648276],"category_scores_gemma":[0.004717263,0.001147858,0.001251047,0.001880147,0.001094191,0.00302576,0.002408297,0.003921451,0.001353094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00115933,"about_ca_system_score_gemma":0.002449812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002203802,"about_ca_topic_score_gemma":0.003490811,"domain_scores_codex":[0.9991224,0.0003297583,0.00004108178,0.0001868481,0.0002161812,0.0001036974],"domain_scores_gemma":[0.9977058,0.00153306,0.0001357663,0.0001974412,0.000247069,0.0001809017],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006344416,0.0007815122,0.0005863391,0.0003468363,0.0001192927,0.0001394071,0.0002237786,0.5308565,0.005237564,0.1206509,0.02049531,0.3199282],"study_design_scores_gemma":[0.0000985533,0.00008005093,0.00007769006,0.00001848372,0.00001754313,0.00004659455,0.00002520025,0.947179,0.0006394323,0.05070549,0.001097598,0.00001443355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01368831,0.0001529671,0.9804901,0.0003902175,0.00007794435,0.0001273887,0.0001247063,0.0004258831,0.004522387],"genre_scores_gemma":[0.1141178,0.0002076734,0.8807108,0.0002082003,0.00008845768,0.0003881557,0.0005649176,0.0003077759,0.003406073],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007648276,"threshold_uncertainty_score":0.02558607,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2083246371","doi":"10.1007/s10107-013-0703-7","title":"New approaches to multi-objective optimization","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Matroid; Mathematics; Mathematical optimization; Matching (statistics); Spanning tree; Bipartite graph; Approximation algorithm; Rounding; Combinatorics; Computer science; Graph","authors":[{"name":"Fabrizio Grandoni","is_ca":false},{"name":"R. Ravi","is_ca":false},{"name":"Mohit Singh","is_ca":true},{"name":"Rico Zenklusen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1149013214391176,"gpt":0.2635967916886539,"spread":0.1486954702495363,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002290973,0.001741847,0.001565109,0.001981143,0.0006986424,0.003114387,0.002896252,0.001482538,0.005479633],"category_scores_gemma":[0.007463758,0.0009144738,0.001706965,0.002410975,0.001992721,0.005542716,0.002822292,0.00556162,0.0008338836],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001828611,"about_ca_system_score_gemma":0.001064921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001104784,"about_ca_topic_score_gemma":0.001779336,"domain_scores_codex":[0.9983503,0.0006506655,0.00007369098,0.0002123656,0.0006438789,0.00006917077],"domain_scores_gemma":[0.9963708,0.00253031,0.0002651435,0.0002933413,0.0004055552,0.0001349298],"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.00002442565,0.00007737062,0.0002425929,0.0003061098,0.00009430575,0.00004167448,0.0001031616,0.1662533,0.0006542691,0.7741138,0.00483876,0.05325031],"study_design_scores_gemma":[0.00001372807,0.00001398364,0.00008585924,0.00003649383,0.00002135156,0.00002973547,0.00002399048,0.4321668,0.0001987522,0.5588407,0.008554425,0.0000142622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001630868,0.00193111,0.9891129,0.0008395584,0.0002351777,0.00002093547,0.0000381262,0.00005034545,0.006141104],"genre_scores_gemma":[0.1178921,0.007280678,0.8563565,0.0009727235,0.00215114,0.0003605907,0.0002107897,0.0002745907,0.01450083],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005479633,"threshold_uncertainty_score":0.01833123,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976459503","doi":"10.1007/s00493-006-0016-z","title":"Network Design Via Iterative Rounding Of Setpair Relaxations","year":2006,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Rounding; Mathematics; Combinatorics; Linear programming relaxation; Vertex (graph theory); Omega; Approximation algorithm; Discrete mathematics; Relaxation (psychology); Linear programming; Integer (computer science); Network planning and design; Vertex connectivity; Undirected graph; Graph; Mathematical optimization; Computer science","authors":[{"name":"Joseph Cheriyan","is_ca":true},{"name":"Santosh Vempala","is_ca":false},{"name":"Adrian Vetta","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02367530720691067,"gpt":0.2316478668460641,"spread":0.2079725596391535,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002232999,0.001661625,0.001486414,0.0012381,0.0007842761,0.002106786,0.002451098,0.001558279,0.01151084],"category_scores_gemma":[0.008071011,0.0009554601,0.001338929,0.001396092,0.0009705945,0.002672438,0.002552279,0.003108945,0.001541175],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001293196,"about_ca_system_score_gemma":0.001047192,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001236913,"about_ca_topic_score_gemma":0.00187334,"domain_scores_codex":[0.9984617,0.0007135163,0.00006099731,0.000230239,0.000331615,0.0002020222],"domain_scores_gemma":[0.9967011,0.002214716,0.0002006475,0.0004459297,0.0003154224,0.0001221246],"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.0002047172,0.0001434427,0.0002757476,0.000274266,0.00006096581,0.00008704007,0.0002116029,0.7628262,0.003304318,0.1129804,0.006897138,0.1127341],"study_design_scores_gemma":[0.00003950041,0.00009771458,0.00005356937,0.00004321824,0.00002184018,0.00004744807,0.00007724708,0.9229692,0.001675604,0.07238744,0.002571577,0.00001552334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01417356,0.0001959481,0.9720081,0.0002310815,0.00009619781,0.0001070008,0.00009831337,0.00030684,0.01278292],"genre_scores_gemma":[0.3112531,0.0003955441,0.6797051,0.0002342927,0.0001114753,0.0004683877,0.0003458321,0.000335013,0.007151236],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01151084,"threshold_uncertainty_score":0.03850764,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2134600856","doi":"10.1016/j.jcss.2011.12.002","title":"The complexity of weighted and unweighted #CSP","year":2011,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Class (philosophy); Computational complexity theory; Computation; Mathematical optimization; Discrete mathematics; Combinatorics; Computer science; Algorithm; Artificial intelligence","authors":[{"name":"Andreĭ A. Bulatov","is_ca":true},{"name":"Martin Dyer","is_ca":false},{"name":"Leslie Ann Goldberg","is_ca":false},{"name":"Markus Jalsenius","is_ca":false},{"name":"Mark Jerrum","is_ca":false},{"name":"David Richerby","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06998880825289108,"gpt":0.2476934294203101,"spread":0.1777046211674191,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004194365,0.0009247379,0.001745226,0.001540334,0.00161791,0.007056822,0.004108109,0.002321766,0.008514096],"category_scores_gemma":[0.03298208,0.001123639,0.001883535,0.003636643,0.002977096,0.01807969,0.003403884,0.003817391,0.0005945278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004709738,"about_ca_system_score_gemma":0.004556592,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006769453,"about_ca_topic_score_gemma":0.00622119,"domain_scores_codex":[0.9937644,0.001965389,0.0004320259,0.0007979046,0.002147296,0.0008929394],"domain_scores_gemma":[0.9482411,0.04169932,0.002848678,0.00349024,0.002218897,0.001501815],"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.0009709281,0.0002499864,0.00251953,0.0004232236,0.0001542904,0.0002422628,0.0004581603,0.228352,0.00279436,0.712672,0.008944297,0.04221902],"study_design_scores_gemma":[0.00007170622,0.00003835592,0.0004956126,0.00001921094,0.00004247213,0.0001341183,0.00008913334,0.3260218,0.0008016843,0.6709672,0.001288514,0.00003013118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5649976,0.00153885,0.38788,0.008839805,0.0002699947,0.0002592401,0.00319002,0.001054153,0.03197036],"genre_scores_gemma":[0.9111536,0.0007511947,0.07783191,0.0004285122,0.000336253,0.0002081919,0.001508485,0.0003633435,0.007418356],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008514096,"threshold_uncertainty_score":0.0341717,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2263246245","doi":"","title":"Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky","year":2021,"lang":"en","type":"article","venue":"DSpace@MIT (Massachusetts Institute of Technology)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Satisfiability; Randomized algorithm; Deterministic algorithm; Combinatorics; Mathematics; Matching (statistics); Discrete mathematics; Running time; Variable (mathematics); Key (lock); Binary logarithm; Algorithm; Computer science; Statistics","authors":[{"name":"Timothy M. Chan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01209712053241457,"gpt":0.2434263904676279,"spread":0.2313292699352133,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004269542,0.00117472,0.001188439,0.0009276421,0.001580878,0.001677569,0.002360441,0.001153472,0.008010346],"category_scores_gemma":[0.01622874,0.0007171131,0.001592532,0.001616535,0.002659066,0.005883696,0.004833837,0.003222109,0.001934614],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002925879,"about_ca_system_score_gemma":0.003890925,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003134918,"about_ca_topic_score_gemma":0.005670145,"domain_scores_codex":[0.9950821,0.002212429,0.0002548802,0.0008892164,0.001029748,0.0005315724],"domain_scores_gemma":[0.9903226,0.005386624,0.0005719073,0.002948373,0.0004800215,0.0002905577],"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.001883834,0.0002884142,0.00574295,0.0005145154,0.000224297,0.0002600404,0.0005309865,0.21427,0.01592569,0.5723943,0.02798183,0.1599833],"study_design_scores_gemma":[0.000183097,0.0001969971,0.0003969466,0.00003629651,0.00004993441,0.0001004229,0.00007447431,0.4596175,0.005705221,0.526745,0.006851817,0.00004239236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1775437,0.0007103722,0.7924145,0.003885807,0.0003318027,0.0004453921,0.00114492,0.00494171,0.01858186],"genre_scores_gemma":[0.6554101,0.0003358947,0.3325037,0.001090837,0.000178122,0.0006514442,0.001345467,0.001034853,0.007449612],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008010346,"threshold_uncertainty_score":0.02679729,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4242064191","doi":"10.1002/rsa.20279","title":"Asymptotic random graph intuition for the biased connectivity game","year":2009,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Intuition; Random graph; Mathematics; Graph; Discrete mathematics; Mathematical economics; Psychology","authors":[{"name":"Heidi Gebauer","is_ca":true},{"name":"Tibor Szabó","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01809614125711018,"gpt":0.2568782022790673,"spread":0.2387820610219571,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001796196,0.0004323703,0.0006790319,0.0008613651,0.00064036,0.001652223,0.001476265,0.001205974,0.005238725],"category_scores_gemma":[0.01354748,0.000314295,0.0004804049,0.0004738071,0.002192979,0.003393502,0.001491964,0.001729838,0.0004059227],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001883661,"about_ca_system_score_gemma":0.0006458742,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00126537,"about_ca_topic_score_gemma":0.001243132,"domain_scores_codex":[0.9986787,0.0005526597,0.00004024458,0.0001758124,0.0003673696,0.0001851595],"domain_scores_gemma":[0.9924726,0.004775397,0.0009009737,0.0007218928,0.0005224506,0.000606664],"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.00009117585,0.00004626877,0.001396705,0.00005714281,0.00002503432,0.0001549497,0.0001854467,0.04066566,0.002774848,0.9488506,0.001744904,0.004007226],"study_design_scores_gemma":[0.00006064256,0.00003856673,0.0007123516,0.00001751961,0.00001648352,0.0002051244,0.00007974273,0.2546462,0.0007182388,0.7417871,0.001696719,0.00002131361],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5423672,0.0005871945,0.4067726,0.003472855,0.00007560092,0.0001449444,0.0003180934,0.0003561873,0.04590539],"genre_scores_gemma":[0.9807581,0.0001976113,0.01498923,0.000377553,0.00004683289,0.0001088069,0.00009087654,0.00005903273,0.003372008],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005238725,"threshold_uncertainty_score":0.01752526,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2136811867","doi":"10.1016/s0166-218x(01)00266-9","title":"Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Semidefinite programming; Polytope; Relaxation (psychology); Maximum cut; Intersection (aeronautics); Lagrangian relaxation; Flexibility (engineering); Combinatorics; Metric (unit); Constraint (computer-aided design); Set (abstract data type); Relaxation technique; Feasible region; Regular polygon; Enhanced Data Rates for GSM Evolution; Mathematical optimization; Computer science; Geometry","authors":[{"name":"Miguel F. Anjos","is_ca":true},{"name":"Henry Wolkowicz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03249075521729931,"gpt":0.2356156697719298,"spread":0.2031249145546305,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002545654,0.00161871,0.001302812,0.001056393,0.0009165621,0.002535352,0.002327612,0.001539689,0.01104267],"category_scores_gemma":[0.006216742,0.0007393439,0.001864218,0.001167169,0.001545497,0.00409636,0.004901334,0.008867021,0.001575391],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00104491,"about_ca_system_score_gemma":0.00137924,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006722791,"about_ca_topic_score_gemma":0.0008053803,"domain_scores_codex":[0.9985663,0.0004755082,0.00005883887,0.0002276508,0.0004345863,0.0002371139],"domain_scores_gemma":[0.997705,0.001020899,0.0001850432,0.0004834147,0.0003086055,0.0002969775],"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.0003662872,0.0003419477,0.0002292053,0.0004426907,0.00006148338,0.0002145439,0.0003371474,0.05934327,0.00683442,0.8352473,0.01965695,0.07692476],"study_design_scores_gemma":[0.000121541,0.0001981002,0.0002677859,0.00009899285,0.00004451433,0.0002212923,0.0001226997,0.2668481,0.002585382,0.7158164,0.01363176,0.00004325016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04358098,0.0005477968,0.9032078,0.003060457,0.0007146361,0.000175517,0.0005405142,0.000426568,0.04774566],"genre_scores_gemma":[0.4818093,0.001252971,0.4691376,0.001567992,0.001477098,0.0006648318,0.00118865,0.0005107826,0.04239073],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01104267,"threshold_uncertainty_score":0.03694135,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4232943531","doi":"10.1145/1109557.1109644","title":"Oblivious string embeddings and edit distance approximations","year":2006,"lang":"en","type":"article","venue":"Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Edit distance; Embedding; Combinatorics; String (physics); Distortion (music); Approximation algorithm; Discrete mathematics; Mathematics; Algorithm; Computer science; Artificial intelligence","authors":[{"name":"Tuğkan Batu","is_ca":true},{"name":"Funda Ergün","is_ca":true},{"name":"Cenk Sahinalp","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006974374443870286,"gpt":0.2227324276354105,"spread":0.2157580531915402,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001271982,0.001361506,0.001515083,0.001347062,0.0007320627,0.002604861,0.004009307,0.002234647,0.004242427],"category_scores_gemma":[0.01679778,0.0009143192,0.000987153,0.002704248,0.001553785,0.01038757,0.003720789,0.003306946,0.002048926],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00238648,"about_ca_system_score_gemma":0.001185446,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001673685,"about_ca_topic_score_gemma":0.001748053,"domain_scores_codex":[0.9963533,0.0008605585,0.0002752525,0.0008759529,0.001293388,0.0003416342],"domain_scores_gemma":[0.9915592,0.003401706,0.000760979,0.003641743,0.0004562396,0.000180033],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007541944,0.0002930541,0.001361395,0.0003721482,0.0001075858,0.0002464811,0.0004017309,0.5978806,0.009300991,0.1905442,0.006172647,0.1925649],"study_design_scores_gemma":[0.00005359076,0.00009631454,0.0001817931,0.00002397024,0.00002486623,0.0002108495,0.00004930002,0.8024178,0.006650481,0.1854507,0.004812004,0.00002836564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01968241,0.0004757719,0.974861,0.0003054425,0.00005737911,0.00005450277,0.0002393872,0.001836989,0.002487109],"genre_scores_gemma":[0.3564612,0.0006400464,0.633437,0.0002885243,0.0001387787,0.0003334756,0.001251939,0.0005590546,0.00688996],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004242427,"threshold_uncertainty_score":0.01731521,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2135050820","doi":"10.1109/infcomw.2011.5928889","title":"Egalitarian stable matching for VM migration in cloud computing","year":2011,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Server; Cloud computing; Computer science; Matching (statistics); Virtual machine; Distributed computing; Rank (graph theory); Outcome (game theory); Work (physics); Mathematical optimization; Theoretical computer science; Computer network; Operating system; Mathematical economics; Mathematics","authors":[{"name":"Hong Xu","is_ca":true},{"name":"Baochun Li","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05727396206257437,"gpt":0.2652118144166776,"spread":0.2079378523541032,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005206823,0.0006453124,0.001062102,0.001001823,0.001426343,0.00162783,0.001877492,0.00143908,0.001982622],"category_scores_gemma":[0.01210821,0.000353239,0.0007554269,0.001162648,0.002156554,0.003224658,0.001945409,0.001406654,0.0003578124],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001818992,"about_ca_system_score_gemma":0.002122859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001617614,"about_ca_topic_score_gemma":0.001695832,"domain_scores_codex":[0.9973774,0.00139291,0.0001095643,0.0004483581,0.0003720099,0.0002996834],"domain_scores_gemma":[0.9959401,0.002412053,0.0004721151,0.0006211892,0.0003140211,0.0002405007],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002662885,0.000120873,0.001135887,0.0001063455,0.00007045642,0.0001056696,0.0002246705,0.5649554,0.002629456,0.376287,0.001411939,0.05268609],"study_design_scores_gemma":[0.00002180493,0.00007896662,0.0001447383,0.000007286427,0.00001316287,0.00003878795,0.00004221208,0.7430471,0.0009882601,0.2548847,0.0007202745,0.00001277023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05472364,0.0001958773,0.9423975,0.0004234421,0.00002868279,0.00008485423,0.00003257919,0.0001366724,0.001976755],"genre_scores_gemma":[0.7999731,0.0002990961,0.1963829,0.0001603172,0.00007374996,0.0001620499,0.00006591791,0.00006853019,0.002814521],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005206823,"threshold_uncertainty_score":0.02753663,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2109533535","doi":"10.1109/sfcs.2001.959928","title":"Tight approximation results for general covering integer programs","year":2001,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Combinatorics; Linear programming relaxation; Rounding; Multiplicative function; Approximation algorithm; Mathematics; Upper and lower bounds; Integer (computer science); Randomized rounding; Discrete mathematics; Cover (algebra); Binary logarithm; Multiplicity (mathematics); Linear programming; Algorithm; Computer science","authors":[{"name":"Stavros G. Kolliopoulos","is_ca":true},{"name":"Neal E. Young","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04364182730979306,"gpt":0.270655222080916,"spread":0.227013394771123,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005705136,0.002583004,0.002839415,0.001929926,0.001569713,0.00454464,0.004136028,0.00278816,0.01038804],"category_scores_gemma":[0.02597318,0.001375436,0.002731397,0.004175477,0.002768021,0.008113243,0.0037306,0.006241365,0.001764952],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004491955,"about_ca_system_score_gemma":0.001996252,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002983816,"about_ca_topic_score_gemma":0.00268301,"domain_scores_codex":[0.9940408,0.001598944,0.0002296819,0.001176463,0.001731509,0.001222631],"domain_scores_gemma":[0.9905707,0.006816849,0.0006062941,0.001101081,0.0005231619,0.0003820011],"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.0006559449,0.0005197921,0.001975392,0.0007683715,0.0002124726,0.0002636898,0.0005816607,0.5747842,0.003208142,0.2910761,0.01636633,0.1095879],"study_design_scores_gemma":[0.00006983378,0.0001017126,0.000284186,0.00007129241,0.0000598049,0.0001736727,0.0001071868,0.8463101,0.0009626913,0.1448761,0.006967042,0.00001623608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03557087,0.004319563,0.9252396,0.002603069,0.0002604208,0.0002084632,0.0003252563,0.001585772,0.0298869],"genre_scores_gemma":[0.4354867,0.004959482,0.5444295,0.00177941,0.0007288335,0.0005903222,0.001596349,0.0009979765,0.009431366],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01038804,"threshold_uncertainty_score":0.03475147,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2185716868","doi":"10.4086/toc.2012.v008a012","title":"","year":2012,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Combinatorics; Predicate (mathematical logic); Constraint satisfaction problem; Pairwise independence; Discrete mathematics; Hierarchy; Pairwise comparison; Semidefinite programming; Random variable; Omega; Mathematical optimization; Multivariate random variable; Sum of normally distributed random variables; Probabilistic logic; Computer science","authors":[{"name":"Siavosh Benabbas","is_ca":false},{"name":"Konstantinos Georgiou","is_ca":false},{"name":"Avner Magen","is_ca":false},{"name":"Madhur Tulsiani","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03077153895836308,"gpt":0.2621209887200663,"spread":0.2313494497617032,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001196095,0.0009930037,0.001232896,0.0004979769,0.001031296,0.001787702,0.001972131,0.00173414,0.01256013],"category_scores_gemma":[0.007977965,0.000386306,0.001226923,0.001367335,0.001261341,0.003755424,0.001823925,0.002059396,0.00107287],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001646173,"about_ca_system_score_gemma":0.001313385,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004974602,"about_ca_topic_score_gemma":0.005014201,"domain_scores_codex":[0.9984899,0.0004122643,0.00005390877,0.0005013078,0.0002667852,0.0002758325],"domain_scores_gemma":[0.9964857,0.002406619,0.000247447,0.0003427881,0.0002745877,0.0002427702],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000409631,0.0001956336,0.001932725,0.0004384945,0.0001356435,0.0003656932,0.0001602616,0.6021985,0.001657654,0.3143403,0.01746082,0.06070461],"study_design_scores_gemma":[0.00004216989,0.00009514158,0.0002940453,0.0000294363,0.00003042718,0.0001759718,0.00009945605,0.6967682,0.0009548281,0.2914641,0.01003172,0.00001449922],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.07224768,0.001630128,0.895448,0.004657326,0.0003701384,0.0001250983,0.001186675,0.0006467418,0.0236882],"genre_scores_gemma":[0.6794428,0.001385835,0.299348,0.001374485,0.0004069988,0.0001973373,0.001891492,0.0003055184,0.01564757],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9874399,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1971426115","doi":"10.1145/1146381.1146410","title":"Oracle size","year":2006,"lang":"en","type":"preprint","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Institut national de recherche en informatique et en automatique (INRIA); Université du Québec en Outaouais","keywords":"Oracle; Computer science; Dissemination; Node (physics); Broadcast communication network; Task (project management); Communication complexity; Computer network; Measure (data warehouse); Network topology; Telecommunications network; Time complexity; Distributed computing; Theoretical computer science; Data mining; Algorithm; Telecommunications","authors":[{"name":"Pierre Fraigniaud","is_ca":false},{"name":"David Ilcinkas","is_ca":false},{"name":"Andrzej Pelc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02255457743138917,"gpt":0.2547799527737883,"spread":0.2322253753423992,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007871462,0.001913492,0.003359058,0.001886179,0.001609403,0.007967703,0.007367161,0.003664055,0.03874749],"category_scores_gemma":[0.08074261,0.001107682,0.00222574,0.002400858,0.003326529,0.02196546,0.004597356,0.005462038,0.004560627],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003783811,"about_ca_system_score_gemma":0.003175998,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001782898,"about_ca_topic_score_gemma":0.001290902,"domain_scores_codex":[0.9872255,0.003767173,0.0009543622,0.00307506,0.003194699,0.001783206],"domain_scores_gemma":[0.8762348,0.09899709,0.005028823,0.01178748,0.004319931,0.003631809],"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.002044733,0.000539068,0.008414202,0.002255135,0.0003309173,0.0005047258,0.0007972175,0.1753545,0.007112909,0.568434,0.04753161,0.186681],"study_design_scores_gemma":[0.0002208825,0.000406986,0.001519824,0.0001959407,0.0001820893,0.0008503713,0.0002369823,0.3275105,0.005258427,0.643178,0.02035382,0.00008601314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08402198,0.004169997,0.8277264,0.01089516,0.0007584441,0.0005608303,0.004727258,0.004815471,0.06232456],"genre_scores_gemma":[0.7052349,0.002796605,0.2532383,0.002297691,0.001568974,0.0009645738,0.006503865,0.003083586,0.02431155],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03874749,"threshold_uncertainty_score":0.1296233,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}