{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":520,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":520,"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":"2f9ea72872c9","filters":{"venue":"Discrete Applied Mathematics"}},"results":[{"id":"W2037298352","doi":"10.1016/s0166-218x(00)00198-0","title":"Resolvability in graphs and the metric dimension of a graph","year":2000,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":982,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Mathematics; Metric dimension; Vertex (graph theory); Graph; Connectivity; Dimension (graph theory); Discrete mathematics; Line graph; Pathwidth","authors":[{"name":"Gary Chartrand","is_ca":false},{"name":"Linda Eroh","is_ca":false},{"name":"Mark A. Johnson","is_ca":false},{"name":"Ortrud R. Oellermann","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009040591071365865,"gpt":0.2191411440438341,"spread":0.2101005529724683,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002830388,0.0008666104,0.001747946,0.004018077,0.002947607,0.006709273,0.003109323,0.003076405,0.004754462],"category_scores_gemma":[0.01751747,0.001152208,0.001504921,0.005058343,0.008471002,0.01226866,0.004058891,0.005606734,0.0004216318],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002474595,"about_ca_system_score_gemma":0.0008351114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001441003,"about_ca_topic_score_gemma":0.001123432,"domain_scores_codex":[0.9971782,0.001233413,0.0001547898,0.0006230387,0.0005054814,0.0003050995],"domain_scores_gemma":[0.9621928,0.02890881,0.003248266,0.002522764,0.001113713,0.002013606],"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.00006625895,0.00002081215,0.0008340963,0.0000680913,0.0000207218,0.00003347411,0.0003170527,0.004757124,0.0004521341,0.9882618,0.0008364154,0.004331983],"study_design_scores_gemma":[0.00001170171,0.00001011043,0.0002859919,0.0000136867,0.000008798399,0.00005959683,0.00008989614,0.008150163,0.0002201203,0.990026,0.001110698,0.00001316089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6946725,0.004345561,0.2539615,0.01021025,0.0002638974,0.00007184892,0.001448273,0.0002836306,0.03474263],"genre_scores_gemma":[0.957445,0.002022298,0.0341343,0.0004133218,0.0005155718,0.0001179612,0.0007583766,0.0001057774,0.004487441],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006709273,"threshold_uncertainty_score":0.01795453,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2137849348","doi":"10.1016/s0166-218x(01)00338-9","title":"A survey of very large-scale neighborhood search techniques","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":639,"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":"Heuristic; Mathematics; Mathematical optimization; Local search (optimization); Variable neighborhood search; Search algorithm; Computation; Algorithm; Incremental heuristic search; Scale (ratio); Computer science; Beam search; Metaheuristic","authors":[{"name":"Ravindra K. Ahuja","is_ca":false},{"name":"Özlem Ergün","is_ca":false},{"name":"James B. Orlin","is_ca":false},{"name":"Abraham P. Punnen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04136196228381948,"gpt":0.2908560751222848,"spread":0.2494941128384653,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001328225,0.0008437841,0.002302706,0.00136538,0.0006839976,0.001596672,0.002067382,0.001179235,0.003302742],"category_scores_gemma":[0.00346646,0.0004796176,0.0009951688,0.004584826,0.0005364628,0.002311946,0.001358384,0.001130303,0.001388694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004738735,"about_ca_system_score_gemma":0.0006907508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001399079,"about_ca_topic_score_gemma":0.001745038,"domain_scores_codex":[0.9989433,0.000318186,0.00008322144,0.0001403413,0.0004786184,0.00003640838],"domain_scores_gemma":[0.9989828,0.0005419221,0.0000615024,0.0001600892,0.0002244348,0.00002915501],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00009216317,0.0001415605,0.0006670111,0.001424403,0.000169688,0.00005558025,0.00008349164,0.1043857,0.001962469,0.07450391,0.009366123,0.8071479],"study_design_scores_gemma":[0.00007156312,0.0002091713,0.0007582846,0.0003295308,0.0001324928,0.0003734373,0.00008615424,0.8044679,0.002098088,0.1063068,0.08511978,0.00004682048],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.003397173,0.04669939,0.9398813,0.0003934644,0.0002779967,0.00007981484,0.0000755027,0.0003281831,0.008867119],"genre_scores_gemma":[0.1116146,0.06275196,0.8151459,0.0004634432,0.0008712019,0.0003948021,0.0006096577,0.0003304344,0.007817999],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.003302742,"threshold_uncertainty_score":0.01104879,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975784696","doi":"10.1016/j.dam.2007.02.003","title":"A survey of scheduling with controllable processing times","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":419,"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":"Scheduling (production processes); Computer science; Dynamic priority scheduling; Mathematical optimization; Rate-monotonic scheduling; Fair-share scheduling; Data processing; Distributed computing; Mathematics; Database; Schedule","authors":[{"name":"Dvir Shabtay","is_ca":true},{"name":"George Steiner","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01243576526964326,"gpt":0.2328712612258647,"spread":0.2204354959562214,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001727563,0.001305212,0.001652898,0.001380436,0.0006661253,0.002501089,0.001671922,0.001153484,0.002968011],"category_scores_gemma":[0.003993401,0.0008538345,0.000908797,0.005677806,0.0009765057,0.002796771,0.0009562639,0.001571009,0.00103791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001372519,"about_ca_system_score_gemma":0.001869189,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001109001,"about_ca_topic_score_gemma":0.0009187059,"domain_scores_codex":[0.9985697,0.0004245222,0.0001200954,0.0003048238,0.0004695627,0.0001112333],"domain_scores_gemma":[0.9984843,0.0009428918,0.0001281886,0.0001857417,0.0001955623,0.00006326133],"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.0001976815,0.0001945218,0.0007903453,0.00312188,0.00009923693,0.0001065006,0.0001167659,0.09310229,0.002659641,0.4765293,0.01550751,0.4075743],"study_design_scores_gemma":[0.00008433285,0.0002713107,0.0007366401,0.0004796806,0.0000896655,0.0003710334,0.00009636121,0.2950497,0.002525712,0.5191907,0.1810335,0.00007130713],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.008858852,0.1635691,0.795162,0.001697051,0.001115967,0.00009567081,0.0002488779,0.0004219741,0.02883047],"genre_scores_gemma":[0.2167774,0.3727943,0.3887742,0.001314096,0.005651343,0.0004311666,0.0009222525,0.000394052,0.01294121],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.002968011,"threshold_uncertainty_score":0.009958327,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2127635925","doi":"10.1016/s0166-218x(00)00310-3","title":"Bundle-based relaxation methods for multicommodity capacitated fixed charge network design","year":2001,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":245,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Computer Research Institute of Montréal; Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Subgradient method; Mathematics; Relaxation (psychology); Lagrangian relaxation; Combinatorics; Fixed charge; Mathematical optimization; Physics","authors":[{"name":"Teodor Gabriel Crainic","is_ca":true},{"name":"Antonio Frangioni","is_ca":false},{"name":"Bernard Gendron","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07715582862337386,"gpt":0.3074874641287935,"spread":0.2303316355054196,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003758928,0.001715397,0.00233182,0.001168378,0.0006986118,0.001292379,0.002326682,0.002269847,0.007092915],"category_scores_gemma":[0.007071957,0.001586099,0.001321132,0.002146171,0.001110239,0.002383635,0.001836052,0.002306404,0.0006592112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001428339,"about_ca_system_score_gemma":0.001653032,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005855327,"about_ca_topic_score_gemma":0.004246667,"domain_scores_codex":[0.9988697,0.0007016116,0.00003052461,0.00009822672,0.0001959246,0.0001041022],"domain_scores_gemma":[0.9964823,0.002648534,0.0001957342,0.0001158543,0.0003980056,0.0001595832],"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.00005670904,0.00005739124,0.0001192175,0.00009867395,0.00003150478,0.00001674461,0.00004152774,0.9629907,0.0002074902,0.01625207,0.001904705,0.01822327],"study_design_scores_gemma":[0.00001131664,0.00002027256,0.00001995943,0.000006407976,0.000005040574,0.000003132185,0.000005580497,0.9925575,0.00004458324,0.00685519,0.0004677859,0.000003243353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002821635,0.0002472316,0.9949151,0.0001454481,0.00004668701,0.00003528119,0.00004026891,0.00006251966,0.001685829],"genre_scores_gemma":[0.3218632,0.001151545,0.6664351,0.0002537808,0.0002652988,0.0007240384,0.0003793578,0.0004287128,0.008499011],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007092915,"threshold_uncertainty_score":0.02372819,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2109716789","doi":"10.1016/s0166-218x(00)00221-3","title":"On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic","year":2001,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":208,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Bounded function; Treewidth; Combinatorics; Monadic predicate calculus; Enumeration; Discrete mathematics; Clique-width; Time complexity; Graph; Second-order logic; Computational complexity theory; Upper and lower bounds; Clique; Pathwidth; Algorithm; Line graph; Computer science; Theoretical computer science","authors":[{"name":"Bruno Courcelle","is_ca":false},{"name":"Johann A. Makowsky","is_ca":false},{"name":"Udi Rotics","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06192859394975599,"gpt":0.2857134996855245,"spread":0.2237849057357685,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005181745,0.001744427,0.004024874,0.003207927,0.003301405,0.0121569,0.006136582,0.004392683,0.01225103],"category_scores_gemma":[0.03726053,0.001766376,0.003678062,0.005962366,0.007936001,0.03417212,0.004836021,0.01296517,0.0007069231],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.008603261,"about_ca_system_score_gemma":0.003143973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005638357,"about_ca_topic_score_gemma":0.00567391,"domain_scores_codex":[0.9937614,0.0021694,0.0002958984,0.001117286,0.001481826,0.001174247],"domain_scores_gemma":[0.9155617,0.07548557,0.00274061,0.00325881,0.001335275,0.001618057],"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.0005015825,0.0002592842,0.001899886,0.0003751868,0.0001316218,0.0002100306,0.0009234013,0.04880703,0.0009885556,0.9281124,0.003830359,0.01396059],"study_design_scores_gemma":[0.00005300789,0.00002845559,0.0004766602,0.00002736506,0.00005226756,0.00005727695,0.0001721171,0.05129047,0.0003892951,0.9466656,0.0007561978,0.0000313564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5915334,0.004622567,0.3033459,0.01649197,0.0003426591,0.000292884,0.002070631,0.0009757336,0.0803242],"genre_scores_gemma":[0.954481,0.001681289,0.02902131,0.0006455954,0.0004625304,0.0002768451,0.001569791,0.0003520492,0.0115096],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01225103,"threshold_uncertainty_score":0.06242132,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2078743813","doi":"10.1016/j.dam.2011.12.018","title":"A survey of Nordhaus–Gaddum type relations","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":203,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Graph; Combinatorics; Windmill graph; Complement (music); Chromatic scale; Petersen graph; Discrete mathematics; Line graph; Voltage graph","authors":[{"name":"Mustapha Aouchiche","is_ca":true},{"name":"Pierre Hansen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03774536950012889,"gpt":0.2634281414588022,"spread":0.2256827719586733,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002179185,0.0006567567,0.001443995,0.00400598,0.002813889,0.004175686,0.001725859,0.001580527,0.008878842],"category_scores_gemma":[0.00426121,0.0007844667,0.0008419352,0.01031212,0.003127736,0.01025941,0.002457567,0.003278296,0.001904899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002257593,"about_ca_system_score_gemma":0.001364343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001172075,"about_ca_topic_score_gemma":0.001374594,"domain_scores_codex":[0.9988449,0.0003408091,0.00009822896,0.0002998213,0.0003127154,0.0001035566],"domain_scores_gemma":[0.998055,0.001165597,0.0001419783,0.0002889003,0.0002267449,0.0001218364],"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.00002356977,0.0000320127,0.0003911183,0.0003056633,0.000009012959,0.0000294258,0.000151334,0.0007640895,0.0001952737,0.9391362,0.00669354,0.05226867],"study_design_scores_gemma":[0.00001049246,0.00002156473,0.0004237262,0.0001818762,0.00001485443,0.0002380262,0.0001082483,0.002063916,0.0002460316,0.9191232,0.0775422,0.00002591596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.07106001,0.2860402,0.2890731,0.01609694,0.002994107,0.0001413288,0.001625832,0.0006157225,0.3323528],"genre_scores_gemma":[0.4652889,0.2426186,0.226509,0.006177722,0.007581132,0.0003065414,0.002730664,0.0007149897,0.04807244],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008878842,"threshold_uncertainty_score":0.02970272,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2086552038","doi":"10.1016/j.dam.2006.06.009","title":"The strong metric dimension of graphs and digraphs","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":174,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Mathematics; Metric dimension; Vertex (graph theory); Distance; Discrete mathematics; Neighbourhood (mathematics); Graph; Bound graph; Shortest path problem; Graph power; Line graph; Pathwidth","authors":[{"name":"Ortrud R. Oellermann","is_ca":true},{"name":"Joel Peters-Fransen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008347250750734546,"gpt":0.2142126271217022,"spread":0.2058653763709677,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002688369,0.001043551,0.001781874,0.003822867,0.002729332,0.006597327,0.002269059,0.001868829,0.00383732],"category_scores_gemma":[0.01250422,0.001123137,0.001010265,0.004286325,0.007526846,0.01547529,0.004803407,0.004554444,0.0002883083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002529157,"about_ca_system_score_gemma":0.0008491396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001105829,"about_ca_topic_score_gemma":0.000948118,"domain_scores_codex":[0.9977661,0.0009426908,0.0001201659,0.0004630861,0.0004741727,0.0002337584],"domain_scores_gemma":[0.9835538,0.0102299,0.001737914,0.001530671,0.0009656781,0.001982189],"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.00003323353,0.00001160346,0.0005587839,0.00004345442,0.00001385152,0.00001730361,0.0001317817,0.001516655,0.0001853589,0.9932892,0.001143931,0.003054937],"study_design_scores_gemma":[0.000007843109,0.000008650916,0.0003185622,0.00001092676,0.000008701788,0.00004133893,0.0000601194,0.006273679,0.00009623375,0.991767,0.001396667,0.00001029144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5898884,0.008626578,0.3274596,0.018396,0.0007406167,0.00007554643,0.002008218,0.0002513888,0.0525537],"genre_scores_gemma":[0.9619127,0.002737206,0.0281888,0.0007716777,0.001020544,0.0001189801,0.0004984978,0.00007533502,0.004676186],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006597327,"threshold_uncertainty_score":0.01835042,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2070790034","doi":"10.1016/s0166-218x(02)00198-1","title":"Edge dominating set and colorings on graphs with fixed clique-width","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":149,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Combinatorics; Mathematics; Treewidth; Chordal graph; Discrete mathematics; Clique-sum; 1-planar graph; Brooks' theorem; Graph coloring; Indifference graph; Edge coloring; Independent set; Maximal independent set; Vertex (graph theory); Pathwidth; Dominating set; Bounded function; Graph; Line graph; Graph power","authors":[{"name":"Daniel Kobler","is_ca":true},{"name":"Udi Rotics","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02828176812337445,"gpt":0.2673533262481674,"spread":0.239071558124793,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004595887,0.002039554,0.002866206,0.003311982,0.003587276,0.006434476,0.005371348,0.003037978,0.005198728],"category_scores_gemma":[0.02573365,0.002979124,0.002193664,0.005223938,0.005356824,0.01139072,0.003465266,0.004943234,0.0004206534],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004996044,"about_ca_system_score_gemma":0.002106166,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003228555,"about_ca_topic_score_gemma":0.004201893,"domain_scores_codex":[0.9976004,0.0007232152,0.0001033209,0.0007742243,0.0003830459,0.0004157881],"domain_scores_gemma":[0.9696275,0.02271122,0.002377128,0.002070511,0.001099226,0.002114451],"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.0006780269,0.0001914712,0.002558285,0.0003227893,0.0001340345,0.0001365885,0.0008112934,0.05812633,0.002415761,0.9156207,0.005633475,0.01337139],"study_design_scores_gemma":[0.0001327111,0.0000407635,0.000853604,0.00005103223,0.00007363366,0.0001818824,0.000214083,0.1036721,0.0006973271,0.8925911,0.001459966,0.00003174828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6366432,0.003753552,0.3173687,0.006663655,0.0003865756,0.0001971802,0.00240756,0.0005964102,0.03198319],"genre_scores_gemma":[0.9093967,0.00201014,0.07463661,0.0006951303,0.0006724992,0.0002967533,0.001338461,0.0003524274,0.01060126],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006434476,"threshold_uncertainty_score":0.03624904,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2109692166","doi":"10.1016/s0166-218x(03)00382-2","title":"On spaced seeds for similarity search","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":142,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Similarity (geometry); Mathematics; Sensitivity (control systems); Combinatorics; Nearest neighbor search; Algorithm; Computer science; Data mining; Artificial intelligence","authors":[{"name":"Uri Keich","is_ca":false},{"name":"Ming Li","is_ca":false},{"name":"Bin Ma","is_ca":true},{"name":"John Tromp","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02766122019691645,"gpt":0.2810312807924654,"spread":0.253370060595549,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003113815,0.0008985958,0.002287477,0.003116174,0.001253168,0.001889827,0.002648154,0.003115512,0.006147393],"category_scores_gemma":[0.02936116,0.0008859016,0.0007806519,0.004602799,0.002658436,0.00588033,0.004109342,0.002017531,0.001977602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009531021,"about_ca_system_score_gemma":0.001121723,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001353115,"about_ca_topic_score_gemma":0.001377075,"domain_scores_codex":[0.9971868,0.001055863,0.0001704656,0.0004622711,0.0009745427,0.0001500619],"domain_scores_gemma":[0.9876727,0.007969343,0.0005388933,0.002373751,0.001040323,0.0004048739],"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.001135343,0.0001904674,0.001016659,0.0002722408,0.00007719654,0.0002501874,0.0003653315,0.1922906,0.01081723,0.4386129,0.00857016,0.3464017],"study_design_scores_gemma":[0.00009602825,0.0001248928,0.0001810952,0.00004221769,0.00002048121,0.0001968559,0.00005176468,0.6872347,0.002816795,0.3054889,0.003720426,0.00002577474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01135403,0.0006953711,0.9850773,0.0002163584,0.0001019619,0.00005569567,0.00005312582,0.0003526721,0.002093425],"genre_scores_gemma":[0.2690101,0.0008481434,0.7224017,0.0002841293,0.0003144557,0.0002043938,0.0004604425,0.000342141,0.006134434],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006147393,"threshold_uncertainty_score":0.02056503,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2065163895","doi":"10.1016/s0166-218x(03)00462-1","title":"Interval data minmax regret network optimization problems","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":134,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Mathematics; Regret; Interval (graph theory); Minimax; Logarithm; Shortest path problem; Combinatorics; Minimum spanning tree; Path (computing); Function (biology); Bounded function; Mathematical optimization; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Graph; Statistics; Computer science","authors":[{"name":"Igor Averbakh","is_ca":true},{"name":"В. Н. Лебедев","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1263009194520116,"gpt":0.3558418059577799,"spread":0.2295408865057684,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003199892,0.001315537,0.001618295,0.0007511961,0.0004223013,0.001757477,0.002224383,0.002182015,0.006151633],"category_scores_gemma":[0.009611626,0.0005102878,0.0006809975,0.001541546,0.0007502346,0.00290165,0.001590687,0.002212945,0.0005881905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00142989,"about_ca_system_score_gemma":0.000540811,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00130113,"about_ca_topic_score_gemma":0.00124581,"domain_scores_codex":[0.9990159,0.00044185,0.00004493865,0.0002127067,0.0001977725,0.00008674518],"domain_scores_gemma":[0.995652,0.003295481,0.0003614021,0.0002281531,0.0003324481,0.0001304594],"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.0002287918,0.00008088442,0.0004785176,0.0001359913,0.00006485142,0.00007208933,0.00004516121,0.8792777,0.0005632203,0.0633383,0.0047084,0.05100611],"study_design_scores_gemma":[0.00001427852,0.00003963031,0.0001117253,0.00001406759,0.00001566407,0.00002643737,0.00001163154,0.9586813,0.0003826505,0.03985645,0.0008399838,0.000006189134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0276606,0.000954563,0.9608176,0.0008752898,0.0001234651,0.00006335528,0.00053182,0.000243912,0.008729428],"genre_scores_gemma":[0.7038784,0.001821066,0.2718742,0.0004702918,0.0004289997,0.0004401434,0.001213419,0.0003561648,0.01951727],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006151633,"threshold_uncertainty_score":0.02057928,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2121321202","doi":"10.1016/j.dam.2011.04.021","title":"On cryptographic protocols employing asymmetric pairings — The role of<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>Ψ</mml:mi></mml:math>revisited","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":134,"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":"Cryptography; Type (biology); Isomorphism (crystallography); Computer science; Cryptographic protocol; Cryptographic primitive; Theoretical computer science; Mathematics; Discrete mathematics; Computer security","authors":[{"name":"Sanjit Chatterjee","is_ca":true},{"name":"Alfred Menezes","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0213364122456201,"gpt":0.2471069906702213,"spread":0.2257705784246012,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008951223,0.001972818,0.001728034,0.002565645,0.004272332,0.007866425,0.003713906,0.005285153,0.01100059],"category_scores_gemma":[0.02052806,0.001314255,0.001680529,0.003067202,0.01438573,0.03724733,0.0111095,0.0113935,0.006385627],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002970705,"about_ca_system_score_gemma":0.002243581,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009437401,"about_ca_topic_score_gemma":0.0006553355,"domain_scores_codex":[0.9885069,0.005091314,0.0006705326,0.001580973,0.003106527,0.001043825],"domain_scores_gemma":[0.9820684,0.007041188,0.001030926,0.007308322,0.00200624,0.0005449663],"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.00003065527,0.00001062559,0.00003472694,0.00004297325,0.000006630641,0.00004499819,0.000085543,0.000627133,0.0003061923,0.9902631,0.002716169,0.005831329],"study_design_scores_gemma":[0.00001190448,0.0000239285,0.00004380648,0.00006653927,0.000009671225,0.0001323819,0.00004659308,0.003734434,0.0006803644,0.9776381,0.01758737,0.00002487686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02340347,0.01283628,0.685986,0.02303,0.00544707,0.0002687796,0.0003505132,0.0005356654,0.2481422],"genre_scores_gemma":[0.6511883,0.02984784,0.1790477,0.01045812,0.01228527,0.0009038491,0.0008860564,0.001343362,0.1140394],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01100059,"threshold_uncertainty_score":0.04733914,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2021735068","doi":"10.1016/j.dam.2008.03.022","title":"Variable space search for graph coloring","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":124,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematics; Complete coloring; Fractional coloring; Vertex (graph theory); Graph coloring; Combinatorics; Best-first search; Edge coloring; List coloring; Space (punctuation); Local search (optimization); Variable neighborhood search; Graph; Set (abstract data type); Search algorithm; Greedy coloring; Beam search; Discrete mathematics; Algorithm; Computer science; Metaheuristic; Graph power; Line graph","authors":[{"name":"Alain Hertz","is_ca":true},{"name":"Matthieu Plumettaz","is_ca":false},{"name":"Nicolas Zufferey","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.173262291549744,"gpt":0.3769068393962284,"spread":0.2036445478464845,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001546674,0.0008330862,0.001763591,0.001620412,0.0008423759,0.00154443,0.001415754,0.00140631,0.006487034],"category_scores_gemma":[0.0073114,0.0006283452,0.001028649,0.002799544,0.001459246,0.002162815,0.00128042,0.002000429,0.0005076134],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001736787,"about_ca_system_score_gemma":0.002491137,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01137438,"about_ca_topic_score_gemma":0.009646769,"domain_scores_codex":[0.9990162,0.0005122176,0.00002720362,0.0001353616,0.0001500136,0.0001589844],"domain_scores_gemma":[0.9957325,0.003601473,0.0001721059,0.0001927638,0.0001696038,0.0001315046],"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.0003466944,0.0001994971,0.0007319249,0.0002631071,0.00008125181,0.0000399445,0.0001518894,0.772967,0.0007042496,0.1078022,0.009151567,0.1075606],"study_design_scores_gemma":[0.00005638928,0.0000385949,0.0001087753,0.00001691964,0.00001219525,0.000009465947,0.0000305062,0.8918463,0.0002078114,0.1066255,0.001041031,0.000006558202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09249604,0.001826825,0.8861065,0.001858202,0.0002113238,0.0001930089,0.0006289262,0.0009726152,0.01570661],"genre_scores_gemma":[0.6065672,0.0009999223,0.376693,0.0004152655,0.0002148729,0.0004107584,0.001031537,0.0003235736,0.01334385],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01137438,"threshold_uncertainty_score":0.02261633,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2124994312","doi":"10.1016/j.dam.2007.05.059","title":"Degree constrained subgraphs","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":121,"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":"Mathematics; Conjecture; Combinatorics; Weighting; Degree (music); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Artificial intelligence","authors":[{"name":"Louigi Addario‐Berry","is_ca":true},{"name":"Ketan Dalal","is_ca":true},{"name":"Bruce A. Reed","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0241343793073814,"gpt":0.2471114268951056,"spread":0.2229770475877242,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004369354,0.0005817406,0.0007652069,0.001074487,0.001344181,0.002018748,0.001330754,0.00113862,0.01847664],"category_scores_gemma":[0.003734205,0.0005433648,0.0006426735,0.001647081,0.0009429052,0.00332765,0.001668229,0.002091995,0.001780509],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009268753,"about_ca_system_score_gemma":0.0006484851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001092838,"about_ca_topic_score_gemma":0.001879528,"domain_scores_codex":[0.9993516,0.000179528,0.00002433153,0.0002350417,0.0001261713,0.00008339643],"domain_scores_gemma":[0.9973662,0.001202543,0.0002477544,0.0006338559,0.0003078415,0.0002418256],"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.00008947089,0.00006560842,0.001048758,0.0001585032,0.00002843839,0.0001003614,0.0001564177,0.008095589,0.003361744,0.9355302,0.01505714,0.03630775],"study_design_scores_gemma":[0.00001911331,0.00001217635,0.000737582,0.0000281642,0.00002143118,0.0001805557,0.0001060063,0.02625412,0.001959547,0.9514608,0.01921119,0.000009433736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2334094,0.001396822,0.5817018,0.00496909,0.0003190584,0.0003253451,0.005565271,0.0007620775,0.1715512],"genre_scores_gemma":[0.7633787,0.001288815,0.1527759,0.001356638,0.0003545121,0.0004145214,0.007794423,0.0005223412,0.07211406],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01847664,"threshold_uncertainty_score":0.06181049,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2153654605","doi":"10.1016/j.dam.2005.05.020","title":"First vs. best improvement: An empirical study","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":115,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Heuristics; Constructive; Travelling salesman problem; Mathematics; Enhanced Data Rates for GSM Evolution; Heuristic; Mathematical optimization; Greedy algorithm; Algorithm; Combinatorics; Computer science; Artificial intelligence; Process (computing)","authors":[{"name":"Pierre Hansen","is_ca":true},{"name":"Nenad Mladenović","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03618088057861051,"gpt":0.3343979954373477,"spread":0.2982171148587372,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01761632,0.0008676432,0.001969558,0.004463752,0.001327844,0.002048174,0.00224899,0.001920997,0.005765733],"category_scores_gemma":[0.1054603,0.0004904683,0.001801585,0.003129821,0.001010893,0.004367893,0.001226549,0.003541416,0.001507354],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001680406,"about_ca_system_score_gemma":0.001479418,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002216036,"about_ca_topic_score_gemma":0.003118022,"domain_scores_codex":[0.9898432,0.003713263,0.0007181701,0.001424391,0.003389417,0.0009115223],"domain_scores_gemma":[0.6548538,0.294845,0.01121482,0.023351,0.01104132,0.004694001],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.01399885,0.006157978,0.2621965,0.002184174,0.001681499,0.0004693818,0.001514112,0.1098241,0.00425588,0.01037535,0.02041923,0.5669231],"study_design_scores_gemma":[0.001569916,0.0236206,0.3929496,0.0006710176,0.00351511,0.005431843,0.003045578,0.4978823,0.02111485,0.02811505,0.02173116,0.0003530141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9581467,0.008086776,0.01447681,0.0008260066,0.0001592618,0.0002177962,0.00213207,0.001086635,0.01486806],"genre_scores_gemma":[0.9815547,0.0007355266,0.01347094,0.00009824863,0.00007219275,0.00006051844,0.001152574,0.0003241666,0.002531114],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01761632,"threshold_uncertainty_score":0.0931651,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2150123606","doi":"10.1016/j.dam.2008.04.022","title":"0–1 reformulations of the multicommodity capacitated network design problem","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":112,"is_retracted":false,"has_abstract":false,"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; Université du Québec à Montréal","funders":"","keywords":"Mathematics; Cutting-plane method; Integer (computer science); Residual; Variable (mathematics); Integer programming; Mathematical optimization; Network planning and design; Piecewise linear function; Branch and cut; Piecewise; Algorithm; Computer science","authors":[{"name":"Antonio Frangioni","is_ca":false},{"name":"Bernard Gendron","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03861793585691882,"gpt":0.2425722508806519,"spread":0.2039543150237331,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001638872,0.0009252602,0.0005352625,0.0006978771,0.0004219569,0.001233288,0.001247094,0.001304804,0.009070038],"category_scores_gemma":[0.00471952,0.0003258661,0.0005914019,0.0006894981,0.0007646155,0.001905296,0.001175713,0.00144414,0.000740277],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001095516,"about_ca_system_score_gemma":0.0008365911,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002092048,"about_ca_topic_score_gemma":0.002706175,"domain_scores_codex":[0.9992447,0.000372721,0.00002464429,0.0001178925,0.0001561436,0.00008388449],"domain_scores_gemma":[0.9989537,0.0005935123,0.0001322306,0.00007025326,0.0002004049,0.00004991708],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005220016,0.00007277166,0.0002404869,0.0001455305,0.00001700351,0.00007122991,0.00006970712,0.3267262,0.0006472499,0.6276638,0.008195543,0.03609819],"study_design_scores_gemma":[0.0000140963,0.00005280627,0.0001543473,0.00002754586,0.000009362313,0.00005274562,0.00002787191,0.7290061,0.0003730845,0.2610869,0.009182948,0.00001218217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02324506,0.0008799695,0.8933784,0.001453379,0.0003046408,0.00009570273,0.0003348484,0.00007509939,0.08023297],"genre_scores_gemma":[0.6230959,0.00167886,0.3165219,0.0008604049,0.0007112154,0.0003546477,0.0006981347,0.0002065588,0.05587235],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009070038,"threshold_uncertainty_score":0.03034228,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2157761435","doi":"10.1016/j.dam.2005.02.033","title":"Advances on sorting by reversals","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":109,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Sorting; Sequence (biology); Mathematics; Time complexity; Computational complexity theory; Genome; Combinatorics; Computational problem; Algorithm; Discrete mathematics; Theoretical computer science; Computer science; Gene; Biology; Genetics","authors":[{"name":"Éric Tannier","is_ca":false},{"name":"Anne Bergeron","is_ca":true},{"name":"Marie-France Sagot","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005108295393556165,"gpt":0.2281670594860915,"spread":0.2230587640925354,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001896072,0.001246167,0.001621331,0.002494714,0.001149801,0.003138829,0.002464772,0.001586381,0.009910595],"category_scores_gemma":[0.005179696,0.0006019535,0.001196804,0.004555824,0.00319585,0.007733061,0.002694277,0.004402081,0.003542421],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002082972,"about_ca_system_score_gemma":0.001898003,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001253214,"about_ca_topic_score_gemma":0.001187377,"domain_scores_codex":[0.9984525,0.000404545,0.00009906917,0.0003087455,0.000565473,0.0001696183],"domain_scores_gemma":[0.997014,0.001418222,0.0001397209,0.0008886915,0.0004261582,0.0001130901],"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.00006862268,0.00005245101,0.0001561792,0.0002162665,0.00001457715,0.00001940734,0.0000546283,0.008222477,0.001532592,0.8285976,0.008648503,0.1524168],"study_design_scores_gemma":[0.0000369527,0.00004909585,0.0001411575,0.0000729988,0.00002154063,0.0001031241,0.00004071629,0.03784698,0.003662316,0.8398595,0.1181334,0.00003220835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02883249,0.03414569,0.7996925,0.008158802,0.004213504,0.0001246728,0.0004379836,0.002333777,0.1220607],"genre_scores_gemma":[0.3919034,0.0486162,0.4649043,0.005232795,0.005828845,0.0002919561,0.001420368,0.001232629,0.08056947],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009910595,"threshold_uncertainty_score":0.03315419,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092998591","doi":"10.1016/j.dam.2006.07.017","title":"An adaptive memory algorithm for the k-coloring problem","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":105,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval; Polytechnique Montréal","funders":"","keywords":"Graph coloring; Mathematics; Algorithm; Adaptive memory; Edge coloring; Vertex (graph theory); Greedy coloring; Set (abstract data type); Graph; Computer science; Combinatorics; Line graph; Graph power","authors":[{"name":"Philippe Galinier","is_ca":true},{"name":"Alain Hertz","is_ca":true},{"name":"Nicolas Zufferey","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1098868155869601,"gpt":0.385019381873026,"spread":0.275132566286066,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005213065,0.0005834684,0.0008220902,0.0006613677,0.0006259189,0.0008860995,0.002463735,0.00100064,0.004951779],"category_scores_gemma":[0.00256195,0.0003720937,0.0005517724,0.001241606,0.0005129681,0.001547623,0.001430134,0.00117281,0.0006015529],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009134959,"about_ca_system_score_gemma":0.001550591,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005527361,"about_ca_topic_score_gemma":0.00690986,"domain_scores_codex":[0.9996735,0.00006722712,0.00001732879,0.00008715854,0.000067384,0.00008747498],"domain_scores_gemma":[0.9991713,0.0004277503,0.00007567977,0.0001447139,0.0001174517,0.00006324716],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00107109,0.0003685692,0.001143927,0.0002731674,0.00009554142,0.00007830594,0.0001741296,0.3500439,0.01063248,0.04422065,0.01048145,0.5814168],"study_design_scores_gemma":[0.0001614678,0.00009743018,0.0001880552,0.00001373933,0.00002858384,0.0000424977,0.00002785813,0.9702917,0.002241042,0.02517704,0.001716802,0.00001382135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06196149,0.0004891545,0.9290357,0.0003892152,0.0001465402,0.0001204736,0.0001457294,0.001451501,0.006260187],"genre_scores_gemma":[0.4481229,0.0003151287,0.5443547,0.0002443479,0.00008571573,0.0002909248,0.000344502,0.0002008229,0.006040819],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005527361,"threshold_uncertainty_score":0.01656532,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1990242495","doi":"10.1016/j.dam.2003.07.001","title":"A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":102,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Interval graph; Mathematics; Graph; Algorithm; Interval (graph theory); Simple (philosophy); Unit interval; SIMPLE algorithm; Combinatorics; Simple graph; Unit (ring theory); Line graph; Pathwidth","authors":[{"name":"Derek G. Corneil","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04505282759936129,"gpt":0.3107119446623994,"spread":0.2656591170630381,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003015749,0.0009794305,0.001074767,0.00170815,0.0006962522,0.001489582,0.001802908,0.0009842686,0.01763727],"category_scores_gemma":[0.001666793,0.0004412841,0.0007722965,0.001714002,0.000459577,0.002182706,0.001745549,0.001044735,0.004835544],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005930255,"about_ca_system_score_gemma":0.0009605881,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003545494,"about_ca_topic_score_gemma":0.005022977,"domain_scores_codex":[0.9995565,0.00004997322,0.00003753566,0.000132413,0.0001386023,0.00008496191],"domain_scores_gemma":[0.9993768,0.0001854218,0.00003922669,0.0002242637,0.0001118668,0.00006243891],"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.0003435613,0.0001347471,0.0007291074,0.0001406839,0.00002621376,0.00007490614,0.0001023779,0.01040356,0.02384428,0.007320208,0.008638451,0.9482418],"study_design_scores_gemma":[0.0004133493,0.0004047113,0.002673235,0.0000940976,0.0001022978,0.0006716209,0.0005285235,0.7926595,0.06197916,0.09043214,0.04990394,0.0001374449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03777791,0.0003312301,0.9423311,0.0001751373,0.00007734213,0.0001731667,0.0006244164,0.01158648,0.006923102],"genre_scores_gemma":[0.1378931,0.0001728178,0.8529311,0.0001098266,0.00004723647,0.0002065712,0.002131248,0.000633878,0.005874169],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01763727,"threshold_uncertainty_score":0.05900258,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2080824882","doi":"10.1016/j.dam.2005.09.009","title":"On constant composition codes","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":102,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Army Research Office; Deutscher Akademischer Austauschdienst","keywords":"Mathematics; Constant (computer programming); Code word; Composition (language); Permutation (music); Alphabet; Combinatorics; Discrete mathematics; Block code; Linear code; Binary number; Arithmetic; Algorithm; Computer science; Decoding methods","authors":[{"name":"Wensong Chu","is_ca":false},{"name":"Charles J. Colbourn","is_ca":false},{"name":"Peter J. Dukes","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00705399009592934,"gpt":0.202820232867502,"spread":0.1957662427715727,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001221074,0.001522713,0.001337009,0.002340504,0.002904735,0.002847153,0.001547258,0.001823341,0.01384915],"category_scores_gemma":[0.009045403,0.0007292117,0.0009821203,0.002965925,0.004433561,0.006367271,0.005023587,0.005132613,0.002565607],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002340958,"about_ca_system_score_gemma":0.001345544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002516794,"about_ca_topic_score_gemma":0.001729413,"domain_scores_codex":[0.9985092,0.0003827344,0.00004603497,0.000311865,0.0004714062,0.0002787048],"domain_scores_gemma":[0.9954804,0.002783756,0.0002481334,0.0005969408,0.0005565565,0.0003342064],"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.00005314194,0.000009908607,0.00007961801,0.00002500086,0.000004209443,0.00002716768,0.0001207081,0.001551133,0.0003792613,0.9887941,0.002092696,0.0068631],"study_design_scores_gemma":[0.00001024591,0.000008248567,0.0000559941,0.00001790345,0.000006402376,0.00004507963,0.0000426153,0.005926408,0.0006330367,0.9894173,0.003826926,0.000009936698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2217124,0.002847644,0.4120596,0.006556645,0.001499255,0.00016538,0.0007064631,0.001002666,0.35345],"genre_scores_gemma":[0.785089,0.002738986,0.07211719,0.002232344,0.001460498,0.0002808402,0.0009468176,0.0008921213,0.1342423],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01384915,"threshold_uncertainty_score":0.04632998,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2162995463","doi":"10.1016/j.dam.2008.06.021","title":"On the choice of explicit stabilizing terms in column generation","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":99,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Group for Research in Decision Analysis; Kronos (Canada)","funders":"","keywords":"Column generation; Mathematical optimization; Mathematics; Term (time); Quadratic equation; Flexibility (engineering); Limit (mathematics); Scheduling (production processes); Column (typography); Crew scheduling; Augmented Lagrangian method; Computer science","authors":[{"name":"Hatem M.T. Ben Amor","is_ca":true},{"name":"Jacques Desrosiers","is_ca":true},{"name":"Antonio Frangioni","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1374153424586914,"gpt":0.3559697696159796,"spread":0.2185544271572882,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001857177,0.0007744156,0.0005489154,0.0004563246,0.0006591487,0.001230892,0.0007508709,0.001253757,0.003375752],"category_scores_gemma":[0.01151648,0.0003993157,0.0002667008,0.0006048679,0.001425126,0.001941612,0.00145315,0.001811348,0.0005765255],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004065212,"about_ca_system_score_gemma":0.0005268676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004051056,"about_ca_topic_score_gemma":0.001107796,"domain_scores_codex":[0.9991841,0.0004525833,0.00003791874,0.00008184864,0.0001742418,0.00006931522],"domain_scores_gemma":[0.9955243,0.00341734,0.0001961757,0.0004479139,0.0003061279,0.0001081071],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003817464,0.0001054573,0.0003552079,0.0002248438,0.00002895711,0.0001004251,0.0001275594,0.1806892,0.01272887,0.7199139,0.0038113,0.08153253],"study_design_scores_gemma":[0.00005064886,0.00008781929,0.000107698,0.00007329226,0.00002011004,0.00005800439,0.00002878433,0.6922331,0.006446955,0.2985352,0.002330892,0.0000273621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0252533,0.0007227792,0.958538,0.0006017155,0.0001717365,0.00004989036,0.00005769616,0.0002078761,0.01439696],"genre_scores_gemma":[0.7752602,0.0009747666,0.21529,0.0005224249,0.0001800396,0.0001409949,0.00009430385,0.0002359759,0.007301303],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003375752,"threshold_uncertainty_score":0.01129299,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2091612923","doi":"10.1016/s0166-218x(00)00281-x","title":"Diameter determination on restricted graph families","year":2001,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Chordal graph; Interval graph; Mathematics; Combinatorics; Split graph; Pathwidth; Indifference graph; Cograph; Induced subgraph; Block graph; Distance-hereditary graph; Discrete mathematics; Vertex (graph theory); Maximal independent set; Graph; Line graph; 1-planar graph; Graph power","authors":[{"name":"Derek G. Corneil","is_ca":true},{"name":"Feodor F. Dragan","is_ca":false},{"name":"Michel Habib","is_ca":false},{"name":"Christophe Paul","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02416877056378365,"gpt":0.2894888853845869,"spread":0.2653201148208033,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001332832,0.0005224743,0.001630907,0.001902727,0.001926986,0.002183264,0.002291011,0.001493511,0.004195523],"category_scores_gemma":[0.01200815,0.00134366,0.0009457952,0.002090236,0.001924739,0.005020726,0.003128554,0.002164589,0.0007941626],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001152596,"about_ca_system_score_gemma":0.0003903708,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007474344,"about_ca_topic_score_gemma":0.0006743788,"domain_scores_codex":[0.9982028,0.0005571457,0.00008706428,0.0005543899,0.0003899726,0.0002086129],"domain_scores_gemma":[0.9844751,0.01128416,0.001147605,0.001548833,0.0005918979,0.000952412],"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.0004522002,0.0001080873,0.003789422,0.0003528194,0.00005178949,0.0004490093,0.001324115,0.03306215,0.01480521,0.888597,0.007175597,0.0498326],"study_design_scores_gemma":[0.00006164243,0.00006152832,0.001792433,0.00006178957,0.00004719151,0.0007373934,0.0003904211,0.1162568,0.006402258,0.8669243,0.007223954,0.00004042999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5377725,0.0008067514,0.4265946,0.0009558475,0.0000733398,0.0001075652,0.0004708843,0.0007474898,0.03247101],"genre_scores_gemma":[0.8926206,0.000803101,0.09507114,0.0001956981,0.0001773852,0.0001717805,0.0006810371,0.0005528796,0.009726387],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004195523,"threshold_uncertainty_score":0.0140354,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1998243034","doi":"10.1016/j.dam.2003.09.012","title":"Variable neighborhood search for the maximum clique","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":83,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Clique; Heuristic; Variable neighborhood search; Clique problem; Vertex (graph theory); Greedy algorithm; Mathematical optimization; Simplicity; Combinatorics; Variable (mathematics); Algorithm; Metaheuristic; Graph; Chordal graph","authors":[{"name":"Pierre Hansen","is_ca":true},{"name":"Nenad Mladenović","is_ca":true},{"name":"Dragan Urošević","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01968403011513852,"gpt":0.2687723857027823,"spread":0.2490883555876438,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001559339,0.0005592273,0.001618023,0.001144323,0.0008814512,0.001057105,0.001782161,0.001405543,0.005633037],"category_scores_gemma":[0.008554674,0.000681702,0.0007455539,0.001402066,0.001202032,0.002156974,0.001580899,0.001480942,0.0004612184],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001243341,"about_ca_system_score_gemma":0.0011448,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004571136,"about_ca_topic_score_gemma":0.005538494,"domain_scores_codex":[0.9993006,0.0004329047,0.00001190132,0.0001107178,0.0000863582,0.00005745388],"domain_scores_gemma":[0.9967614,0.002700953,0.0001213984,0.0001266665,0.0001787477,0.000110822],"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.000205201,0.00009950445,0.0005608365,0.0001828752,0.00007729354,0.00004954434,0.0001313934,0.7015879,0.0006407545,0.2385297,0.008691085,0.04924399],"study_design_scores_gemma":[0.00002849242,0.0000143143,0.00008134488,0.00001146875,0.000006614657,0.000008704983,0.00001396037,0.9223863,0.00007994944,0.0763284,0.001036152,0.000004324141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0319482,0.0008722923,0.9558251,0.0009358168,0.00009184735,0.00007830068,0.0001728004,0.0001543979,0.00992109],"genre_scores_gemma":[0.5493489,0.0009187349,0.4299784,0.0003074392,0.000229887,0.0004986591,0.0006615951,0.0002939996,0.01776246],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005633037,"threshold_uncertainty_score":0.01884437,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2005871446","doi":"10.1016/s0166-218x(03)00261-0","title":"Dynamic monopolies in tori","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Cellular Automata and Applications","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":"Carleton University; University of Ottawa","funders":"","keywords":"Mathematics; Torus; Monotone polygon; Context (archaeology); Simple (philosophy); Upper and lower bounds; Constructive; Node (physics); Dynamo; Topology (electrical circuits); Combinatorics; Discrete mathematics; Process (computing); Computer science; Geometry; Mathematical analysis","authors":[{"name":"Paola Flocchini","is_ca":true},{"name":"Elena Lodi","is_ca":false},{"name":"Fabrizio Luccio","is_ca":false},{"name":"Linda Pagli","is_ca":false},{"name":"Nicola Santoro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009067863765680985,"gpt":0.240658269237084,"spread":0.231590405471403,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003057337,0.0004479743,0.001023121,0.001516871,0.002483517,0.002807339,0.0009634004,0.001331979,0.01131322],"category_scores_gemma":[0.001640223,0.0004374009,0.000688065,0.0008126937,0.002513452,0.00209085,0.001659551,0.001448098,0.001119243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001475992,"about_ca_system_score_gemma":0.0006292615,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002140492,"about_ca_topic_score_gemma":0.002113607,"domain_scores_codex":[0.9997249,0.00005933745,0.0000115901,0.00004171106,0.00005775747,0.0001046473],"domain_scores_gemma":[0.9992355,0.0001941433,0.0001271877,0.000105046,0.00008366395,0.0002544318],"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.00006354401,0.00001720906,0.0001362901,0.00004164906,0.00000923701,0.0001071502,0.0002141896,0.007618732,0.0008695634,0.9858132,0.002194773,0.00291445],"study_design_scores_gemma":[0.00005380862,0.00003585028,0.0003523028,0.00002173915,0.000009971664,0.000117011,0.0002908911,0.03197544,0.0003101573,0.9620973,0.004714733,0.0000207271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7140805,0.001878121,0.0508516,0.002892273,0.0006674913,0.0001277296,0.0004525665,0.0005920564,0.2284577],"genre_scores_gemma":[0.9801893,0.0004774212,0.003847099,0.0001568964,0.0001486879,0.00007410154,0.0001579467,0.00009405903,0.01485452],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01131322,"threshold_uncertainty_score":0.03784651,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2101752896","doi":"10.1016/s0166-218x(02)00251-2","title":"Finding paths in graphs avoiding forbidden transitions","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","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 Toronto","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Discrete mathematics; Graph; Graph isomorphism; Line graph","authors":[{"name":"Stefan Szeider","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04135075435661177,"gpt":0.2841048643191326,"spread":0.2427541099625208,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005269294,0.0008085704,0.0008916855,0.001611469,0.001533161,0.001431171,0.001467239,0.001377283,0.004428999],"category_scores_gemma":[0.005622723,0.0009182465,0.0008987277,0.001795767,0.001190638,0.002815262,0.0016761,0.001718525,0.0004745106],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006762649,"about_ca_system_score_gemma":0.001148877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00231793,"about_ca_topic_score_gemma":0.003665901,"domain_scores_codex":[0.9995828,0.00009165271,0.00002998511,0.0001345096,0.00006727515,0.00009364079],"domain_scores_gemma":[0.9933916,0.005202912,0.0005700132,0.0002844498,0.0002571398,0.0002939997],"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.004631109,0.001244788,0.02245241,0.00305497,0.0004444518,0.002315689,0.002854053,0.2808634,0.04127188,0.2435905,0.0155726,0.3817042],"study_design_scores_gemma":[0.0003995111,0.0005175245,0.002916728,0.0002300786,0.0002175898,0.0007539411,0.001294585,0.2988932,0.01609539,0.6729611,0.005666046,0.00005436946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7668735,0.0004346855,0.2210319,0.0007564525,0.0000746579,0.0003364949,0.001579147,0.001053976,0.007859282],"genre_scores_gemma":[0.7554616,0.0004678488,0.2349921,0.0001978887,0.00003187846,0.0002041038,0.002485634,0.000273809,0.005885173],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004428999,"threshold_uncertainty_score":0.01481652,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1970251068","doi":"10.1016/s0166-218x(00)00262-6","title":"Investigations on autark assignments","year":2000,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Constraint Satisfaction and Optimization","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 Toronto","funders":"","keywords":"Mathematics; Combinatorics","authors":[{"name":"Oliver Kullmann","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01423618923611557,"gpt":0.232626912351096,"spread":0.2183907231149804,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001525876,0.0007736156,0.0008954957,0.002387541,0.004537169,0.004220761,0.002061945,0.001802706,0.03578403],"category_scores_gemma":[0.01181646,0.0005315981,0.000819271,0.004149586,0.00339402,0.00916462,0.003422908,0.004031965,0.003294979],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00136977,"about_ca_system_score_gemma":0.0007756146,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005701491,"about_ca_topic_score_gemma":0.0006444121,"domain_scores_codex":[0.9979512,0.0008920282,0.000115634,0.0003405082,0.0004424535,0.0002581735],"domain_scores_gemma":[0.9943258,0.003675039,0.0004315078,0.0007603127,0.0004518476,0.0003555593],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002160575,0.00002437419,0.0001116846,0.00003564509,0.000001988452,0.00004187033,0.0001603925,0.0004792862,0.0001314886,0.9903458,0.001346796,0.007299078],"study_design_scores_gemma":[0.000006528434,0.00001308714,0.0001044829,0.00001927088,0.000002883063,0.00008766804,0.0001959522,0.001955555,0.0003260283,0.9905758,0.006707148,0.000005567502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1871282,0.001283271,0.1527229,0.004557761,0.0008122608,0.000142665,0.0003083081,0.0004176268,0.6526271],"genre_scores_gemma":[0.8519806,0.001688171,0.05521512,0.001784869,0.0009293011,0.0002027495,0.0006317591,0.000372697,0.08719468],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03578403,"threshold_uncertainty_score":0.1197096,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2141942969","doi":"10.1016/s0166-218x(03)00371-8","title":"Partitioning chordal graphs into independent sets and cliques","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":74,"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":"Chordal graph; Combinatorics; Mathematics; Split graph; Discrete mathematics; Indifference graph; Maximal independent set; Interval graph; Cograph; Pathwidth; Disjoint sets; Clique-sum; 1-planar graph; Graph; Line graph","authors":[{"name":"Pavol Hell","is_ca":true},{"name":"Sulamita Klein","is_ca":false},{"name":"Loana Tito Nogueira","is_ca":false},{"name":"Fábio Protti","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01772607808304285,"gpt":0.2947188118428381,"spread":0.2769927337597953,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005678193,0.0006273644,0.00109728,0.001790478,0.001573482,0.002582116,0.002523168,0.0009910658,0.00559503],"category_scores_gemma":[0.004694104,0.0007833943,0.001021461,0.002666512,0.001491373,0.003740737,0.002146927,0.001518972,0.0009552553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001155365,"about_ca_system_score_gemma":0.001010391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00263674,"about_ca_topic_score_gemma":0.004678031,"domain_scores_codex":[0.9989626,0.0001841301,0.00005907232,0.0003532749,0.0002306326,0.0002101819],"domain_scores_gemma":[0.9961805,0.001741291,0.000331047,0.0008743581,0.0004809497,0.0003917796],"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.002229963,0.000626951,0.01114082,0.001459117,0.0003151823,0.0005165575,0.002123298,0.1309062,0.05006143,0.5198156,0.0152459,0.2655591],"study_design_scores_gemma":[0.0003192482,0.0002750947,0.006412824,0.0001164377,0.0002493714,0.0005960679,0.00172909,0.225414,0.0144684,0.725387,0.02495616,0.00007630971],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3574147,0.001531482,0.6051566,0.0009244288,0.0001845576,0.0006887526,0.001758979,0.0005845278,0.03175598],"genre_scores_gemma":[0.6638467,0.0008662466,0.3212363,0.0002052145,0.0001854842,0.0002159792,0.002505228,0.0002821629,0.01065672],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00559503,"threshold_uncertainty_score":0.01871723,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963690545","doi":"10.1016/j.dam.2017.07.016","title":"Burning a graph is hard","year":2017,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":72,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Discrete mathematics; Graph; Block graph; Line graph; Pathwidth","authors":[{"name":"Stéphane Bessy","is_ca":false},{"name":"Anthony Bonato","is_ca":true},{"name":"Jeannette Janssen","is_ca":true},{"name":"Dieter Rautenbach","is_ca":false},{"name":"Elham Roshanbin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02201358486141114,"gpt":0.2857251221677339,"spread":0.2637115373063227,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001351667,0.001312915,0.00234796,0.001749186,0.003159752,0.006046903,0.00266062,0.004886511,0.01823442],"category_scores_gemma":[0.01498572,0.001462244,0.001983669,0.002200264,0.005862964,0.01402073,0.004483238,0.008857207,0.001912234],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001205694,"about_ca_system_score_gemma":0.0008439927,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00106902,"about_ca_topic_score_gemma":0.001134612,"domain_scores_codex":[0.9980375,0.0004407387,0.0001097033,0.0007487857,0.0003860787,0.0002772572],"domain_scores_gemma":[0.9852813,0.009843955,0.001131322,0.00172304,0.0007885068,0.001231972],"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.0002000255,0.0001213681,0.0006950339,0.0003734802,0.00009470818,0.0002686385,0.0003769505,0.01365918,0.001302227,0.9519011,0.0164599,0.01454729],"study_design_scores_gemma":[0.00001508371,0.000009601315,0.0001136488,0.00001750055,0.000009340589,0.00008154115,0.00009928324,0.01056977,0.0001731121,0.987309,0.001593499,0.000008476153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4315379,0.002934453,0.3457371,0.03332943,0.002386258,0.0003195336,0.002604126,0.001023031,0.1801282],"genre_scores_gemma":[0.8631698,0.001733282,0.04975593,0.004076486,0.001303716,0.0004054082,0.001780283,0.0008096979,0.07696544],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01823442,"threshold_uncertainty_score":0.06100023,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2091867238","doi":"10.1016/j.dam.2005.04.015","title":"Complexity of minimizing the total flow time with interval data and minmax regret criterion","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":71,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Regret; Mathematics; Minimax; Interval (graph theory); Mathematical optimization; Scheduling (production processes); Time complexity; Combinatorics; Interval data; Statistics","authors":[{"name":"В. Н. Лебедев","is_ca":false},{"name":"Igor Averbakh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08831245293251806,"gpt":0.3294545387333359,"spread":0.2411420858008178,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005834067,0.001613584,0.003446448,0.001196523,0.0007051986,0.004614631,0.002638326,0.002525989,0.005553337],"category_scores_gemma":[0.0239068,0.001188806,0.001497452,0.001946185,0.001252083,0.004492247,0.002277547,0.002743228,0.0005028654],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003502094,"about_ca_system_score_gemma":0.00302361,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006706388,"about_ca_topic_score_gemma":0.004066337,"domain_scores_codex":[0.9967416,0.001554668,0.0001528597,0.0004588891,0.0007160855,0.0003759312],"domain_scores_gemma":[0.978152,0.01911575,0.0008621102,0.0007068835,0.0007113994,0.0004518578],"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.0005525511,0.00008143976,0.0009892668,0.0002350706,0.0000765752,0.0001109282,0.000077877,0.9409972,0.0007191336,0.03032961,0.002680398,0.02315],"study_design_scores_gemma":[0.00002231117,0.00003977264,0.0002254638,0.00001001359,0.00001163509,0.00002759766,0.00001607288,0.9756848,0.0002104137,0.02356672,0.0001770319,0.000008185434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.115601,0.001084483,0.870093,0.002956623,0.0001230331,0.0001497756,0.001201628,0.0006100604,0.008180341],"genre_scores_gemma":[0.7718143,0.0009817478,0.2136084,0.0004774615,0.0003982949,0.0005153371,0.001696239,0.0006711015,0.009837046],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006706388,"threshold_uncertainty_score":0.03085387,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1990809933","doi":"10.1016/s0166-218x(01)00237-2","title":"On the computational complexity of strong edge coloring","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of Toronto","keywords":"Mathematics; Edge coloring; Combinatorics; Computational complexity theory; Graph coloring; Time complexity; Graph; Completeness (order theory); Matching (statistics); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Algorithm; Graph power; Artificial intelligence; Computer science; Line graph","authors":[{"name":"Mohammad Mahdian","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09358971132498799,"gpt":0.3031898687250434,"spread":0.2096001574000554,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004799743,0.001492125,0.002425954,0.001755489,0.002487735,0.006894726,0.005058436,0.002675439,0.01610107],"category_scores_gemma":[0.04312851,0.001240517,0.0022061,0.004254775,0.005432377,0.0194032,0.00554033,0.006588842,0.00141976],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004988171,"about_ca_system_score_gemma":0.004425243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0051674,"about_ca_topic_score_gemma":0.005920819,"domain_scores_codex":[0.9940045,0.002463973,0.0002407181,0.0008700631,0.00129964,0.001121118],"domain_scores_gemma":[0.9075149,0.08032705,0.002403481,0.00593934,0.002086402,0.001728798],"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.002543421,0.000509357,0.004370334,0.0006344584,0.0001848241,0.0002503495,0.0007517964,0.1903074,0.003603813,0.711483,0.02897319,0.05638813],"study_design_scores_gemma":[0.0001660314,0.00005433579,0.0007146496,0.00003568482,0.0000647072,0.00009102216,0.0001615199,0.2266714,0.0008609565,0.7691834,0.00196489,0.00003133506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5174775,0.003483119,0.3521293,0.03029518,0.0009650584,0.0003636385,0.00428053,0.001591308,0.08941438],"genre_scores_gemma":[0.9149032,0.00194359,0.06451152,0.001661184,0.001218353,0.0003586603,0.002143768,0.000643174,0.0126166],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01610107,"threshold_uncertainty_score":0.05386341,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2051308394","doi":"10.1016/j.dam.2008.08.033","title":"On column generation formulations for the RWA problem","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":67,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Concordia University; Group for Research in Decision Analysis","funders":"","keywords":"Column generation; Mathematics; Blocking (statistics); Column (typography); Routing and wavelength assignment; Mathematical optimization; Relaxation (psychology); Routing (electronic design automation); Algorithm; Computer science; Wavelength; Wavelength-division multiplexing; Computer network; Statistics","authors":[{"name":"Brigitte Jaumard","is_ca":true},{"name":"Christophe Meyer","is_ca":true},{"name":"Babacar Thiongane","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02652789412521884,"gpt":0.2368707709948384,"spread":0.2103428768696196,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001756688,0.001493367,0.001104968,0.0009339868,0.0005799563,0.001995497,0.001478403,0.001539127,0.01415117],"category_scores_gemma":[0.006295782,0.0006375888,0.001021145,0.002197515,0.001001748,0.002641648,0.001518586,0.003110101,0.00204578],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009069575,"about_ca_system_score_gemma":0.001147921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002113466,"about_ca_topic_score_gemma":0.002988541,"domain_scores_codex":[0.9992362,0.0004084154,0.00002604273,0.00009243096,0.000162786,0.00007401399],"domain_scores_gemma":[0.9970589,0.002186157,0.0001678108,0.0002072151,0.0002999416,0.00007996066],"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.0001232607,0.0001864184,0.0002643139,0.0004225859,0.00005835032,0.0001147984,0.0001179836,0.4225902,0.001630541,0.4519525,0.0269408,0.09559827],"study_design_scores_gemma":[0.00002595598,0.00003559902,0.00007400535,0.00005004741,0.00001289587,0.00004255318,0.00003201757,0.7693095,0.0003384637,0.2245071,0.005556479,0.00001534984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004764583,0.00118841,0.9786515,0.0008955123,0.0001889443,0.00007077507,0.0002745816,0.000133863,0.01383176],"genre_scores_gemma":[0.2408277,0.004804381,0.7106578,0.001523599,0.001093591,0.0006344073,0.00166779,0.0007030916,0.03808764],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01415117,"threshold_uncertainty_score":0.04734033,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2013474931","doi":"10.1016/j.dam.2008.01.011","title":"Efficient algorithms for Roman domination on some classes of graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Interval graph; Domination analysis; Graph; Time complexity; Minimum weight; Chordal graph; Discrete mathematics; 1-planar graph","authors":[{"name":"Mathieu Liedloff","is_ca":false},{"name":"Ton Kloks","is_ca":true},{"name":"Jiping Liu","is_ca":true},{"name":"Sheng‐Lung Peng","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03393014591615173,"gpt":0.3040478813041502,"spread":0.2701177353879985,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001885286,0.001341062,0.001799605,0.002005762,0.002903522,0.00444733,0.003864962,0.001987881,0.01792932],"category_scores_gemma":[0.009383907,0.001149642,0.002378761,0.002829656,0.002115153,0.008684833,0.004548259,0.003886957,0.002229047],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003274945,"about_ca_system_score_gemma":0.00231747,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002731384,"about_ca_topic_score_gemma":0.006987081,"domain_scores_codex":[0.9976278,0.0006503209,0.0001148315,0.0005662228,0.0004603425,0.0005804902],"domain_scores_gemma":[0.9922872,0.005002394,0.000460139,0.001380509,0.000401579,0.0004682574],"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.001271375,0.0008181283,0.00416068,0.0008471783,0.0002126072,0.0002627187,0.00172975,0.07020473,0.01015985,0.575121,0.0383324,0.2968796],"study_design_scores_gemma":[0.0003616171,0.00008444775,0.000793233,0.00006456059,0.0001079862,0.0002455615,0.0003914672,0.2587507,0.004384482,0.7234728,0.01129903,0.00004415276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3819215,0.001221163,0.5233786,0.004804255,0.0002231135,0.0008260937,0.001756647,0.003343209,0.08252535],"genre_scores_gemma":[0.6327989,0.000808168,0.3287475,0.0007683664,0.0002511514,0.0005417937,0.003217842,0.001207468,0.03165882],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01792932,"threshold_uncertainty_score":0.05997956,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2048457435","doi":"10.1016/j.dam.2007.06.002","title":"Fire containment in grids of dimension three and higher","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of Manitoba","keywords":"Conjecture; Mathematics; Combinatorics; Outbreak; Vertex (graph theory); Lattice (music); Square lattice; Integer (computer science); Discrete mathematics; Computer science; Graph","authors":[{"name":"Mike Develin","is_ca":false},{"name":"Stephen G. Hartke","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01749099509523101,"gpt":0.2806687305222785,"spread":0.2631777354270475,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003104347,0.0003077281,0.0007880665,0.0008639807,0.001260935,0.002739003,0.001037469,0.001070288,0.007239519],"category_scores_gemma":[0.002695105,0.0004635747,0.000503302,0.0007564022,0.001849555,0.001957596,0.001663175,0.001414977,0.0007083808],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009620512,"about_ca_system_score_gemma":0.0004808494,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003856203,"about_ca_topic_score_gemma":0.002406367,"domain_scores_codex":[0.9995808,0.00007473088,0.00001906987,0.00009803459,0.00008463169,0.0001427782],"domain_scores_gemma":[0.9971887,0.001192448,0.0004578872,0.0003753905,0.0003028838,0.0004826144],"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.0006608852,0.0001173139,0.00726998,0.0001403802,0.00004837379,0.0005773022,0.0008530917,0.07904752,0.009224981,0.8734988,0.007017575,0.02154374],"study_design_scores_gemma":[0.0001198769,0.00009286744,0.003732137,0.00004420575,0.00002850477,0.0007763114,0.001152835,0.2690029,0.007073903,0.7081518,0.009774576,0.00005006589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6866577,0.0008975646,0.2604625,0.001093055,0.000258564,0.00005083571,0.0004984154,0.0006569078,0.0494244],"genre_scores_gemma":[0.9661363,0.0002084129,0.02400126,0.0001599337,0.00005650911,0.00004076686,0.0002756482,0.0001339081,0.008987127],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007239519,"threshold_uncertainty_score":0.02421862,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2140883685","doi":"10.1016/s0166-218x(02)00217-2","title":"An external memory data structure for shortest path queries","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Shortest path problem; Distance; sort; Planar graph; Data structure; Path (computing); Graph; Spanning tree; Binary logarithm; Binary tree; Discrete mathematics; Computer science; Arithmetic","authors":[{"name":"D. A. W. Hutchinson","is_ca":false},{"name":"Anil Maheshwari","is_ca":true},{"name":"Norbert Zeh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03890792014784756,"gpt":0.2760937952615219,"spread":0.2371858751136744,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001415009,0.0009624523,0.001313057,0.002251749,0.001373318,0.002726507,0.002864398,0.001073979,0.01391497],"category_scores_gemma":[0.007925829,0.0006943031,0.0006334991,0.004923969,0.001105469,0.00582368,0.005466529,0.001795711,0.004135741],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0012982,"about_ca_system_score_gemma":0.001545372,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001392139,"about_ca_topic_score_gemma":0.001872651,"domain_scores_codex":[0.9986255,0.0002081233,0.0002285083,0.0002007499,0.0005507221,0.0001863999],"domain_scores_gemma":[0.9938722,0.001361897,0.0003725366,0.003265374,0.0008381282,0.0002899819],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003153495,0.00044809,0.003207593,0.0007513898,0.0001121002,0.0003692252,0.0006244819,0.01995168,0.02582273,0.1473557,0.1023759,0.6958277],"study_design_scores_gemma":[0.001228263,0.001209191,0.001914403,0.0004222945,0.000300088,0.001046002,0.0006987203,0.3248118,0.09001075,0.3553251,0.2227808,0.000252551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.064683,0.001991238,0.8827587,0.001836416,0.0007796794,0.0005947325,0.00623861,0.02535287,0.01576471],"genre_scores_gemma":[0.3875247,0.001139979,0.5640869,0.001169005,0.0004857772,0.001365311,0.01647097,0.003469734,0.02428764],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01391497,"threshold_uncertainty_score":0.04655021,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071324240","doi":"10.1016/s0166-218x(02)00249-4","title":"On sum coloring of graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Greedy coloring; Combinatorics; Complete coloring; Edge coloring; Brooks' theorem; Graph coloring; Fractional coloring; List coloring; Discrete mathematics; Chordal graph; Graph; 1-planar graph; Line graph","authors":[{"name":"Mohammad R. Salavatipour","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02337872989377058,"gpt":0.2838929812591506,"spread":0.26051425136538,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001273924,0.001458672,0.001645761,0.002605218,0.002582994,0.003878529,0.00221123,0.001422909,0.01059868],"category_scores_gemma":[0.006353713,0.001105833,0.001588543,0.003716488,0.003044245,0.006899217,0.004289623,0.005916619,0.001642798],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002015342,"about_ca_system_score_gemma":0.0008954608,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002333075,"about_ca_topic_score_gemma":0.00292258,"domain_scores_codex":[0.9987687,0.0004544882,0.00004617473,0.0002419417,0.0003036103,0.0001850376],"domain_scores_gemma":[0.9952163,0.002889928,0.0002610224,0.0005308265,0.0004792177,0.0006227743],"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.0001035485,0.00005062555,0.0003914602,0.0001153776,0.00002171559,0.00008008633,0.0003384382,0.00462328,0.0009382146,0.9668146,0.007783642,0.01873901],"study_design_scores_gemma":[0.000007377003,0.000009099484,0.0001248009,0.00001395319,0.00001112358,0.00004255228,0.00005655845,0.006986922,0.0001759535,0.9895111,0.003054468,0.000006162858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2804921,0.004304365,0.4619822,0.007322516,0.002998104,0.0001331363,0.0008683782,0.0009599372,0.2409392],"genre_scores_gemma":[0.7554056,0.004867444,0.1116369,0.002931269,0.003345021,0.0002673503,0.002118348,0.001423263,0.1180047],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01059868,"threshold_uncertainty_score":0.03545612,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2054681864","doi":"10.1016/s0166-218x(99)00161-4","title":"Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1","year":2000,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Injective function; Neighbourhood (mathematics); Graph; Discrete mathematics","authors":[{"name":"Jaroslav Opatrný","is_ca":true},{"name":"Dominique Sotteau","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008419413781472318,"gpt":0.2165844492443656,"spread":0.2081650354628932,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003233816,0.0006135391,0.00054818,0.0006505858,0.000667158,0.002071971,0.0009536798,0.0007408981,0.005502652],"category_scores_gemma":[0.002570895,0.0005884113,0.0005094623,0.0009065455,0.001237554,0.004168065,0.002058592,0.001899944,0.0005836461],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007106192,"about_ca_system_score_gemma":0.0002998452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007220891,"about_ca_topic_score_gemma":0.0008552696,"domain_scores_codex":[0.999644,0.00009552533,0.00002190193,0.00008534146,0.00008864415,0.00006446828],"domain_scores_gemma":[0.9986936,0.0004153886,0.0002799249,0.0001978445,0.0001627216,0.0002504743],"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.0001132227,0.00002923858,0.000412866,0.00007421226,0.00001262579,0.0001273819,0.0003568322,0.01669047,0.00165345,0.9671909,0.00181191,0.01152678],"study_design_scores_gemma":[0.00002879065,0.0000381268,0.0004844614,0.00002293949,0.00001001885,0.0001556515,0.0001508862,0.03909134,0.0006287362,0.9541683,0.005207018,0.00001375247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5024762,0.001029865,0.443152,0.0009734034,0.0002374501,0.00008809936,0.0007409226,0.0003784183,0.05092376],"genre_scores_gemma":[0.8962595,0.0009876672,0.07509021,0.0002636517,0.0001585757,0.0001379108,0.0007450968,0.0002292978,0.02612816],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005502652,"threshold_uncertainty_score":0.01840818,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2021508809","doi":"10.1016/j.dam.2009.06.032","title":"Multiple levels of preference in interactive strategic decisions","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":58,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Preference; Mathematics; Graph; Stability (learning theory); Decision maker; Ranking (information retrieval); Mathematical economics; Mathematical optimization; Combinatorics; Computer science; Operations research; Artificial intelligence; Statistics; Machine learning","authors":[{"name":"Haiyan Xu","is_ca":true},{"name":"Keith W. Hipel","is_ca":true},{"name":"D. Marc Kilgour","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2618965418645576,"gpt":0.4012302183666167,"spread":0.1393336765020591,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004817793,0.0005910649,0.001071097,0.001195968,0.0009464348,0.005401029,0.001069836,0.001756444,0.007817131],"category_scores_gemma":[0.01921134,0.0007378918,0.001058041,0.001732077,0.002615202,0.007154872,0.002147356,0.002602579,0.0005418618],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001461987,"about_ca_system_score_gemma":0.0007680711,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001394448,"about_ca_topic_score_gemma":0.002297142,"domain_scores_codex":[0.9936085,0.003916121,0.0003017301,0.0004320003,0.001032666,0.0007090588],"domain_scores_gemma":[0.9822952,0.01378071,0.000972857,0.001129197,0.0008689105,0.0009532017],"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.0003765883,0.000127706,0.003496011,0.0001453523,0.0001266471,0.0002514276,0.001143211,0.02844583,0.001711705,0.9408562,0.0006342867,0.02268502],"study_design_scores_gemma":[0.00005266174,0.00009637012,0.001770257,0.00002131268,0.00005277742,0.00008439328,0.0006104166,0.07151186,0.0004276231,0.9246057,0.0007219548,0.00004466923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5070256,0.0005061682,0.4399496,0.001893413,0.00006524352,0.0001123873,0.0001509913,0.00009601854,0.05020067],"genre_scores_gemma":[0.9735097,0.0001050222,0.02318787,0.00006594594,0.00002341272,0.00006474392,0.0000293514,0.00001383221,0.003000174],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007817131,"threshold_uncertainty_score":0.02615088,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2017914065","doi":"10.1016/j.dam.2005.04.001","title":"On the b-dominating coloring of graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Bipartite graph; Vertex (graph theory); Edge coloring; Chromatic scale; Graph; Existential quantification; Perfect graph; Discrete mathematics; Induced subgraph; Graph power; Line graph","authors":[{"name":"Chı́nh T. Hoàng","is_ca":true},{"name":"Mekkia Kouider","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01573717360601393,"gpt":0.2282554170461791,"spread":0.2125182434401652,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001632936,0.001304632,0.001525062,0.002120388,0.00238203,0.00383134,0.002021525,0.001927559,0.006630872],"category_scores_gemma":[0.008776868,0.001197084,0.000926647,0.003623343,0.003926106,0.006398654,0.002807088,0.004026385,0.0009756409],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002647164,"about_ca_system_score_gemma":0.00126064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004913881,"about_ca_topic_score_gemma":0.004062632,"domain_scores_codex":[0.9990013,0.0004504756,0.00003361773,0.0001876732,0.0001484149,0.0001785371],"domain_scores_gemma":[0.9904791,0.006629991,0.0006016109,0.0006466986,0.0005763739,0.00106637],"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.0002027321,0.00006932208,0.0009819677,0.0001773163,0.00002496035,0.00006396836,0.0003608715,0.01530606,0.001502447,0.947818,0.0148726,0.01861979],"study_design_scores_gemma":[0.00003352705,0.0000180295,0.0004228416,0.00003508144,0.00001227999,0.00006305501,0.0001188983,0.02702832,0.0002311501,0.9677969,0.004226977,0.00001281564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3753902,0.007972801,0.4714523,0.01557647,0.001310287,0.0001538097,0.001820056,0.0005686027,0.1257555],"genre_scores_gemma":[0.821946,0.007386068,0.1287871,0.003175566,0.001684928,0.0002525111,0.001901128,0.0005417778,0.03432506],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006630872,"threshold_uncertainty_score":0.02218246,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2096789153","doi":"10.1016/j.dam.2008.03.036","title":"The minimum degree distance of graphs of given order and size","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":57,"is_retracted":false,"has_abstract":false,"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":"Mathematics; Degree (music); Wiener index; Combinatorics; Graph; Connectivity; Order (exchange); Discrete mathematics","authors":[{"name":"Orest Bucicovschi","is_ca":false},{"name":"Sebastian M. Cioabă","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03530198614291502,"gpt":0.2710003486580169,"spread":0.2356983625151019,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009678348,0.0007894664,0.001540456,0.001929421,0.001488942,0.002795687,0.0024557,0.001955194,0.003421042],"category_scores_gemma":[0.0126459,0.0006769139,0.0006824242,0.001578423,0.002015511,0.004505428,0.001530213,0.001925176,0.0004836577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001703059,"about_ca_system_score_gemma":0.0007955525,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008056904,"about_ca_topic_score_gemma":0.001323029,"domain_scores_codex":[0.9991278,0.0002429037,0.00005085511,0.0002621903,0.0001891224,0.0001270634],"domain_scores_gemma":[0.9863871,0.008869245,0.001349165,0.001089856,0.0007232894,0.001581353],"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.002911401,0.000365297,0.02272157,0.001501516,0.0003157351,0.0005239775,0.00218747,0.1415316,0.03227182,0.7104512,0.01276716,0.07245128],"study_design_scores_gemma":[0.0002057903,0.0003155303,0.009243074,0.0001265603,0.000132564,0.0009778667,0.0008817666,0.1252528,0.01144943,0.8447803,0.006564786,0.00006941666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9322833,0.001007846,0.04989603,0.002469486,0.0001266864,0.00004560498,0.001398824,0.0002039421,0.01256826],"genre_scores_gemma":[0.9630637,0.0008159216,0.03067703,0.0002202251,0.0001914046,0.00009282984,0.001025847,0.0001686368,0.003744361],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003421042,"threshold_uncertainty_score":0.01235658,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2027444730","doi":"10.1016/j.dam.2009.06.001","title":"On the packing chromatic number of some lattices","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","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":"Saint Mary's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Chromatic scale; Vertex (graph theory); Wheel graph; Lattice (music); Integer (computer science); Graph; Planar graph; Set packing; Discrete mathematics; Set (abstract data type); Graph power; Computer science; Physics","authors":[{"name":"Arthur S. Finbow","is_ca":true},{"name":"Douglas F. Rall","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02418004149120526,"gpt":0.3078530698265606,"spread":0.2836730283353553,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001362462,0.0008088247,0.0009545253,0.004144846,0.003042295,0.004122436,0.00207367,0.001549361,0.01097855],"category_scores_gemma":[0.007474384,0.0008060099,0.0007031917,0.004317333,0.005526743,0.005146633,0.001905845,0.003534628,0.0006778564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003605091,"about_ca_system_score_gemma":0.001058192,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004454605,"about_ca_topic_score_gemma":0.004109477,"domain_scores_codex":[0.999112,0.0002491296,0.00003068781,0.0001811063,0.0002258544,0.0002012367],"domain_scores_gemma":[0.9936025,0.004045104,0.0007916488,0.0004280197,0.0003984162,0.0007343078],"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.0002963638,0.00007214914,0.001894987,0.0001090398,0.00002830412,0.0001080739,0.0004760833,0.01831831,0.00289682,0.959562,0.005878043,0.01035986],"study_design_scores_gemma":[0.00004719585,0.00004045439,0.001863458,0.00003924602,0.00002857827,0.000141748,0.0002836227,0.05487024,0.001375843,0.9381704,0.003096621,0.00004252237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8313873,0.001234277,0.0580399,0.004214991,0.000303363,0.00005722051,0.0008291902,0.0003124311,0.1036213],"genre_scores_gemma":[0.9688227,0.0009122826,0.01797799,0.0003888395,0.0004160716,0.0000978973,0.0006035125,0.0001882068,0.01059247],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01097855,"threshold_uncertainty_score":0.03672689,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2020284609","doi":"10.1016/j.dam.2012.06.013","title":"Computing transitive closure of bipolar weighted digraphs","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Cognitive Science and Mapping","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Digraph; Transitive closure; Transitive relation; Closure (psychology); Mathematics; Sign (mathematics); Fuzzy logic; Transitive reduction; Discrete mathematics; Combinatorics; Computer science; Artificial intelligence; Graph","authors":[{"name":"Patrick Niesink","is_ca":true},{"name":"Keven Poulin","is_ca":true},{"name":"Mateja Šajna","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01509843615865686,"gpt":0.2453872020497447,"spread":0.2302887658910878,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009694826,0.0008066565,0.001006217,0.002930222,0.0009424714,0.00393318,0.0009052296,0.0006610192,0.005265318],"category_scores_gemma":[0.007815711,0.0006831901,0.001038829,0.002282089,0.001039947,0.006296739,0.001487966,0.001162287,0.00058033],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001136681,"about_ca_system_score_gemma":0.0006569739,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002082812,"about_ca_topic_score_gemma":0.004143789,"domain_scores_codex":[0.9989935,0.000212362,0.0001093638,0.0003007308,0.0002422564,0.0001419512],"domain_scores_gemma":[0.9958637,0.002343002,0.0004352641,0.0004829357,0.000454704,0.0004205059],"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.0006577188,0.000333879,0.008441081,0.0007098007,0.0002123934,0.0007491029,0.001986291,0.04071885,0.01422143,0.8025271,0.007449975,0.1219925],"study_design_scores_gemma":[0.0000471985,0.00007905204,0.001147452,0.00008061597,0.00007466361,0.0001625862,0.0005051985,0.1000646,0.002732398,0.8918425,0.003235374,0.00002833816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5963944,0.0003937133,0.3844292,0.0005090862,0.0001342724,0.0001774925,0.002996595,0.0009650589,0.01400021],"genre_scores_gemma":[0.8959383,0.0002934734,0.09656668,0.0001106792,0.00007189645,0.00008091873,0.003554919,0.0001782687,0.003204799],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005265318,"threshold_uncertainty_score":0.01761425,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2017572120","doi":"10.1016/s0166-218x(02)00384-0","title":"Complexity of robust single facility location problems on networks with uncertain edge lengths","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":51,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Minimax; Mathematics; Enhanced Data Rates for GSM Evolution; Facility location problem; Mathematical optimization; Robust optimization; Regret; Realization (probability); 1-center problem; Computer science; Statistics","authors":[{"name":"Igor Averbakh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06967438577420261,"gpt":0.2304384209778218,"spread":0.1607640352036191,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003258193,0.001627871,0.003642675,0.00191202,0.001093028,0.005205917,0.00334312,0.003789432,0.007003242],"category_scores_gemma":[0.02485327,0.001620015,0.001805942,0.002350739,0.003008641,0.007381874,0.003109817,0.00352185,0.0003033107],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004496872,"about_ca_system_score_gemma":0.002230308,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008322671,"about_ca_topic_score_gemma":0.004751268,"domain_scores_codex":[0.9977937,0.0007895014,0.0001124873,0.0004801493,0.0005329312,0.0002912371],"domain_scores_gemma":[0.9648408,0.02960101,0.003129781,0.0006060956,0.0009295066,0.0008927906],"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.0001800424,0.00006198195,0.00102353,0.0001924471,0.00006833709,0.0001442376,0.0001137609,0.8800679,0.0003490099,0.1104981,0.002059969,0.005240608],"study_design_scores_gemma":[0.00003898347,0.00002762911,0.0002687339,0.00001767939,0.00001731635,0.00003886724,0.00006592325,0.8646941,0.0001136208,0.1343123,0.0003873406,0.00001744385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2801073,0.002807859,0.6850984,0.007556934,0.0002214882,0.0002497108,0.002313906,0.000288224,0.02135625],"genre_scores_gemma":[0.9401956,0.001841067,0.0465377,0.000363015,0.0004305086,0.0003366452,0.001397703,0.0001877566,0.008710118],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008322671,"threshold_uncertainty_score":0.03262722,"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":"W2115816066","doi":"10.1016/s0166-218x(00)00388-7","title":"Optimal irreversible dynamos in chordal rings","year":2001,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Cellular Automata and Applications","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":"Carleton University; University of Ottawa","funders":"","keywords":"Mathematics; Chordal graph; Constructive; Upper and lower bounds; Dynamo; Combinatorics; Simple (philosophy); Class (philosophy); Discrete mathematics; Pure mathematics; Graph; Mathematical analysis; Computer science; Physics; Magnetic field","authors":[{"name":"Paola Flocchini","is_ca":true},{"name":"F. J. M. Geurts","is_ca":false},{"name":"Nicola Santoro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01130383720653694,"gpt":0.2372261305907799,"spread":0.225922293384243,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008600254,0.0003800372,0.0009659523,0.0006825611,0.001198338,0.002284049,0.001095377,0.0008731417,0.006668669],"category_scores_gemma":[0.004347099,0.0004217447,0.0005739995,0.0005390042,0.001916579,0.003225216,0.001618224,0.001317863,0.0003111179],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002129236,"about_ca_system_score_gemma":0.001174021,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001131347,"about_ca_topic_score_gemma":0.001771451,"domain_scores_codex":[0.9996328,0.0000982741,0.0000313688,0.0000654914,0.00007027588,0.0001017218],"domain_scores_gemma":[0.9979753,0.00107093,0.0002071107,0.0002427154,0.0001866826,0.0003172983],"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.0000953573,0.0000314101,0.0001543967,0.00007460884,0.00001065372,0.00003517456,0.00005072397,0.03308567,0.001449461,0.9596847,0.0008620588,0.004465728],"study_design_scores_gemma":[0.00004111266,0.00003455465,0.0001672962,0.00001677051,0.00001097343,0.00003768157,0.00008424233,0.1240552,0.00111381,0.8729271,0.001496212,0.00001512608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7269457,0.002382275,0.1849272,0.002644304,0.0004576768,0.0001340895,0.000637651,0.0004081668,0.08146299],"genre_scores_gemma":[0.9845273,0.0006570363,0.007070205,0.0000854203,0.00006248505,0.0000452272,0.00008630013,0.00005688705,0.00740913],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006668669,"threshold_uncertainty_score":0.02230889,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2091219277","doi":"10.1016/j.dam.2014.05.040","title":"Partial-route inequalities for the multi-vehicle routing problem with stochastic demands","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":51,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Université du Québec à Montréal; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Bounding overwatch; Mathematical optimization; Stochastic programming; Integer (computer science); Routing (electronic design automation); Integer programming; Reduction (mathematics); Point (geometry); Mathematics; Computer science","authors":[{"name":"Ola Jabali","is_ca":true},{"name":"Walter Rei","is_ca":true},{"name":"Michel Gendreau","is_ca":true},{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0261593742790523,"gpt":0.2626392306662744,"spread":0.2364798563872221,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002084568,0.001398446,0.001114904,0.0009927787,0.0004473796,0.001831147,0.001717372,0.001619161,0.006385561],"category_scores_gemma":[0.007101262,0.0006886307,0.001474831,0.001590668,0.001049851,0.002607346,0.001456542,0.002655728,0.0005367003],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001998054,"about_ca_system_score_gemma":0.001580406,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007117074,"about_ca_topic_score_gemma":0.006059641,"domain_scores_codex":[0.9988829,0.0004492485,0.00005496997,0.0001718455,0.0003279567,0.000112994],"domain_scores_gemma":[0.9959756,0.003134259,0.0002578711,0.0001098714,0.000406286,0.000116146],"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.00007313719,0.00004910372,0.0004551869,0.0002676406,0.00007144665,0.0001756933,0.0000944808,0.6911745,0.001201103,0.2833026,0.004930277,0.01820483],"study_design_scores_gemma":[0.0000112127,0.00001645543,0.0001684726,0.00002555872,0.00001210394,0.00003339022,0.00002131011,0.9260578,0.000157597,0.07146164,0.002024486,0.000009933219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01577791,0.001512125,0.9630722,0.001525393,0.0001769726,0.00005498508,0.0008115891,0.00008636717,0.01698247],"genre_scores_gemma":[0.7192736,0.005176799,0.2368635,0.0007119545,0.0006064094,0.0004773464,0.001878014,0.0002912805,0.03472109],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007117074,"threshold_uncertainty_score":0.02136183,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2021533461","doi":"10.1016/j.dam.2009.06.023","title":"Bounds on the index of the signless Laplacian of a graph","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":50,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Adjacency matrix; Diagonal matrix; Distance matrix; Simple graph; Bound graph; Degree matrix; Graph; Diagonal; Connectivity; Upper and lower bounds; Laplacian matrix; Laplace operator; Discrete mathematics; Graph power; Line graph","authors":[{"name":"Carla Silva Oliveira","is_ca":false},{"name":"Nair Maria Maia de Abreu","is_ca":false},{"name":"Pierre Hansen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0261931885729084,"gpt":0.2752893651765035,"spread":0.2490961766035951,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003294005,0.00209355,0.001941052,0.005097446,0.001576047,0.004768852,0.004360334,0.002346562,0.007350745],"category_scores_gemma":[0.02443576,0.0007706055,0.001123731,0.002531736,0.004756191,0.009598725,0.004195202,0.007272094,0.00173011],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003181248,"about_ca_system_score_gemma":0.001161605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007376701,"about_ca_topic_score_gemma":0.001124895,"domain_scores_codex":[0.9982797,0.0003992395,0.00008304537,0.0003122601,0.0006745585,0.0002512824],"domain_scores_gemma":[0.9743395,0.01735566,0.001505768,0.001984848,0.002138548,0.002675618],"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.0004321162,0.0001475605,0.001648006,0.0003534048,0.00006583222,0.0003079977,0.0004542644,0.01760235,0.0106665,0.9383705,0.009318514,0.02063296],"study_design_scores_gemma":[0.00003173397,0.00008019667,0.001148943,0.0001222673,0.0000632619,0.0003053333,0.0001102824,0.1141378,0.002828033,0.8773068,0.003803612,0.00006162858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2915323,0.01018276,0.4803808,0.01154716,0.002072798,0.00009640238,0.001301683,0.001493395,0.2013927],"genre_scores_gemma":[0.9119196,0.005788569,0.05224199,0.001238857,0.002677548,0.0002613781,0.0009899816,0.001097082,0.02378502],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007350745,"threshold_uncertainty_score":0.02459067,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2770344522","doi":"10.1016/j.dam.2017.10.027","title":"Perfect Roman domination in trees","year":2017,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; University of Johannesburg; National Research Foundation","keywords":"Mathematics; Combinatorics; Domination analysis; Vertex (graph theory); Minimum weight; Graph; Upper and lower bounds; Dominating set; Function (biology)","authors":[{"name":"Michael A. Henning","is_ca":false},{"name":"William F. Klostermeyer","is_ca":false},{"name":"Gary MacGillivray","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02309181916392646,"gpt":0.3107893249487155,"spread":0.2876975057847891,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001094726,0.0002931964,0.0009006397,0.001574254,0.002938366,0.004544591,0.0008832806,0.001125365,0.008464111],"category_scores_gemma":[0.007653935,0.0005342514,0.0005024792,0.002041703,0.003478958,0.003795819,0.00209742,0.001783928,0.0009059082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00120831,"about_ca_system_score_gemma":0.000806934,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001496247,"about_ca_topic_score_gemma":0.001836827,"domain_scores_codex":[0.9985781,0.0004769158,0.00005075955,0.0001953736,0.0003300668,0.0003688727],"domain_scores_gemma":[0.9957202,0.002469581,0.0004853891,0.0003709027,0.0004061761,0.000547819],"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.00004299332,0.000009713992,0.0003491933,0.00002312961,0.000005577867,0.00006469387,0.0003132563,0.001021715,0.0003350965,0.9935582,0.001120583,0.003155882],"study_design_scores_gemma":[0.00002210046,0.000007276729,0.0002569567,0.00001109234,0.000008022635,0.000118431,0.0001403424,0.004738335,0.0002883039,0.9919366,0.002464965,0.000007614145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7050993,0.000877326,0.06674884,0.002277741,0.0001788474,0.00006652471,0.0003932881,0.0002758096,0.2240823],"genre_scores_gemma":[0.9774383,0.0002975566,0.005352424,0.0002115317,0.0001002918,0.00003288803,0.0001756528,0.00006579692,0.0163256],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008464111,"threshold_uncertainty_score":0.02831525,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976067517","doi":"10.1016/j.dam.2007.05.036","title":"Problems related to a de Bruijn–Erdös theorem","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"De Bruijn sequence; Mathematics; Generalization; Metric space; Combinatorics; De Bruijn graph; Discrete mathematics; Set (abstract data type); Plane (geometry); Geometry; Mathematical analysis; Computer science","authors":[{"name":"Vašek Chvátal","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01079405596510778,"gpt":0.255840339155419,"spread":0.2450462831903113,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002005026,0.000759338,0.001049975,0.002622376,0.002679038,0.002334043,0.001624822,0.002783281,0.01118727],"category_scores_gemma":[0.01118221,0.0005899865,0.00107456,0.001982119,0.003993983,0.007767854,0.003349435,0.004278706,0.001362412],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001402508,"about_ca_system_score_gemma":0.0007594581,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001173277,"about_ca_topic_score_gemma":0.0006377696,"domain_scores_codex":[0.9988223,0.0003442939,0.00007082344,0.000298699,0.0003420794,0.0001217722],"domain_scores_gemma":[0.9956601,0.002978137,0.0003070325,0.0004304207,0.0003889918,0.000235276],"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.00002708639,0.00001556858,0.00009365731,0.00004914525,0.000008172055,0.00005489549,0.00008314267,0.002307676,0.0003751422,0.9876602,0.003028963,0.006296387],"study_design_scores_gemma":[0.000009248371,0.00000649924,0.00006625869,0.00001086559,0.000004901049,0.00007119198,0.00003319818,0.007491436,0.0003238698,0.9867237,0.005250643,0.000008333308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1395223,0.00489245,0.5761182,0.01900319,0.003412475,0.0001477271,0.0008423703,0.0003509028,0.2557104],"genre_scores_gemma":[0.7492397,0.004717634,0.1278491,0.002682397,0.002911364,0.0002462761,0.0007541386,0.0005805542,0.1110189],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01118727,"threshold_uncertainty_score":0.03742522,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2036199750","doi":"10.1016/j.dam.2006.08.006","title":"Partially ordered knapsack and applications to scheduling","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":48,"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":"Knapsack problem; Mathematics; Combinatorics; Continuous knapsack problem; Generalization; Scheduling (production processes); Bounded function; Discrete mathematics; Polynomial-time approximation scheme; Partially ordered set; Time complexity; Class (philosophy); Mathematical optimization; Computer science; Artificial intelligence","authors":[{"name":"Stavros G. Kolliopoulos","is_ca":false},{"name":"George Steiner","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00967514078976895,"gpt":0.226119884697366,"spread":0.216444743907597,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009583357,0.001530286,0.001569275,0.001853837,0.001040559,0.002918722,0.001200064,0.001530641,0.007135069],"category_scores_gemma":[0.006189135,0.0008287746,0.0008043978,0.006834703,0.002019803,0.002984191,0.00119158,0.00358557,0.001246176],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001275847,"about_ca_system_score_gemma":0.001085356,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003204208,"about_ca_topic_score_gemma":0.00484874,"domain_scores_codex":[0.9992926,0.0002244421,0.00004670066,0.00008822526,0.0003010115,0.00004697761],"domain_scores_gemma":[0.9973568,0.001787739,0.0002168747,0.0001763443,0.0003609475,0.0001013604],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008024758,0.0001030671,0.0002924206,0.0004270835,0.00004882371,0.0001288204,0.0001916957,0.2142266,0.001163424,0.6712846,0.007830761,0.1042225],"study_design_scores_gemma":[0.00001514138,0.00002571696,0.0001441949,0.00004860431,0.00001382058,0.00006785495,0.00007949488,0.2575536,0.0003635241,0.7292963,0.01237072,0.00002092973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01008168,0.02348687,0.9397859,0.001567986,0.001873385,0.00004062139,0.0002055182,0.0002541723,0.02270391],"genre_scores_gemma":[0.3477025,0.04779532,0.5599406,0.0008300816,0.003775776,0.0003266266,0.0005436786,0.0002872662,0.03879813],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007135069,"threshold_uncertainty_score":0.02386916,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985638002","doi":"10.1016/j.dam.2007.10.015","title":"Partition into cliques for cubic graphs: Planar case, complexity and approximation","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":48,"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":"Combinatorics; Mathematics; Partition (number theory); Induced subgraph isomorphism problem; Disjoint sets; Discrete mathematics; Clique-sum; Cograph; Clique; Chordal graph; Induced subgraph; Partition problem; Planar graph; Frequency partition of a graph; Graph; 1-planar graph; Line graph; Graph power","authors":[{"name":"Márcia R. Cerioli","is_ca":false},{"name":"Luérbio Faria","is_ca":false},{"name":"T.O. Ferreira","is_ca":false},{"name":"Carlos A. J. Martinhon","is_ca":false},{"name":"Fábio Protti","is_ca":false},{"name":"Bruce Reed","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06445379228865139,"gpt":0.3174664405960601,"spread":0.2530126483074087,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002222798,0.001046419,0.00239768,0.002086094,0.002492727,0.007764037,0.004359215,0.003352802,0.01071421],"category_scores_gemma":[0.0261339,0.001212439,0.002434586,0.005363136,0.003208851,0.01471142,0.003854034,0.004815753,0.0007749489],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003754415,"about_ca_system_score_gemma":0.002729115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006351158,"about_ca_topic_score_gemma":0.008452965,"domain_scores_codex":[0.9971928,0.0006621417,0.0001194539,0.0006366956,0.000862093,0.0005268573],"domain_scores_gemma":[0.9725422,0.02119495,0.001930652,0.0025875,0.0007477992,0.0009969509],"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.001360157,0.0007124633,0.007613721,0.0008956363,0.0002699682,0.000352801,0.001550205,0.2592211,0.00389893,0.6128908,0.02376616,0.08746807],"study_design_scores_gemma":[0.0001393789,0.00006396195,0.001322102,0.00003631712,0.0000953441,0.0003442089,0.0003782844,0.3873646,0.001068419,0.6057726,0.003381676,0.00003312554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4748898,0.002567094,0.455555,0.01080406,0.0002300674,0.0004459141,0.002456516,0.0007434071,0.05230815],"genre_scores_gemma":[0.8235863,0.001786643,0.1514134,0.0008100019,0.0006357305,0.0003381379,0.003072168,0.0004091711,0.01794845],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01071421,"threshold_uncertainty_score":0.0358426,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2147807119","doi":"10.1016/s0166-218x(00)00172-4","title":"Three-dimensional orthogonal graph drawing algorithms","year":2000,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":48,"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":"Bounded function; Combinatorics; Vertex (graph theory); Mathematics; Minimum bounding box; Intersection (aeronautics); Graph drawing; Grid; Enhanced Data Rates for GSM Evolution; Graph; Degree (music); Discrete mathematics; Geometry; Computer science; Image (mathematics); Engineering","authors":[{"name":"Peter Eades","is_ca":false},{"name":"Antonios Symvonis","is_ca":false},{"name":"Sue Whitesides","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01467911643572559,"gpt":0.2393120154478885,"spread":0.2246328990121629,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000906517,0.00101702,0.001191604,0.002110248,0.000854101,0.002192597,0.002277412,0.001199779,0.01590133],"category_scores_gemma":[0.005037263,0.0007585612,0.001203623,0.003124348,0.000875315,0.002286668,0.003583281,0.002071429,0.003660586],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006510033,"about_ca_system_score_gemma":0.001167988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002619748,"about_ca_topic_score_gemma":0.004839699,"domain_scores_codex":[0.9989938,0.0002226535,0.00006783099,0.0001806727,0.0004356032,0.00009939608],"domain_scores_gemma":[0.9982339,0.0005764012,0.0001199013,0.0004962794,0.0004619181,0.0001114819],"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.0001604863,0.0001564908,0.0007030476,0.0002042108,0.00006450176,0.00006261982,0.000153752,0.09314463,0.005009534,0.1277922,0.01316505,0.7593834],"study_design_scores_gemma":[0.00006222753,0.00004558837,0.0001804772,0.00002767776,0.00002926425,0.00009766153,0.00006404036,0.9039912,0.00562211,0.07441945,0.01543353,0.0000268905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00278419,0.00007024684,0.9928535,0.00008030279,0.00004088133,0.00004443296,0.00007166779,0.001103126,0.002951549],"genre_scores_gemma":[0.07303513,0.0002763216,0.9196541,0.0001241672,0.00003824661,0.0002242805,0.0005504156,0.0005946459,0.005502626],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01590133,"threshold_uncertainty_score":0.05319524,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}