{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":2619,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":2619,"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":"ba5119847aeb","filters":{"venue":"Ars Combinatoria"}},"results":[{"id":"W22292547","doi":"","title":"Norm Of Weighted Composition operators From Bloch Space to H infinity on the Unit Ball.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Holomorphic and Operator Theory","field":"Mathematics","cited_by":105,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Unit sphere; Bloch space; Norm (philosophy); Ball (mathematics); Pure mathematics; Infinity; Uniform norm; Mathematical analysis; Compact space","authors":[{"name":"Stevo Stević","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04101186121649524,"gpt":0.2686199790499472,"spread":0.2276081178334519,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001810613,0.0008279703,0.0006541798,0.00269449,0.001400466,0.002692463,0.0009392147,0.0008130803,0.007120809],"category_scores_gemma":[0.004642525,0.0002604185,0.0005786653,0.001396664,0.003524688,0.004724648,0.003126601,0.00192442,0.001403373],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001180572,"about_ca_system_score_gemma":0.0008773797,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001662221,"about_ca_topic_score_gemma":0.00125909,"domain_scores_codex":[0.998387,0.0005237667,0.00007628647,0.0002827792,0.0005274861,0.0002027451],"domain_scores_gemma":[0.9980349,0.0005532562,0.0002996594,0.000177886,0.0005757,0.0003585724],"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.0000241089,0.000009328322,0.00009296461,0.00003072312,0.000009203848,0.00003062988,0.0001386164,0.0003552,0.0005367908,0.9932265,0.0007002981,0.004845693],"study_design_scores_gemma":[0.000009717114,0.00004405171,0.0003562805,0.00001973091,0.000006934396,0.0001058156,0.0001334569,0.008612578,0.0007202848,0.9828495,0.007126663,0.00001497577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.217507,0.003419782,0.5950372,0.002307237,0.001266987,0.00009946367,0.000442812,0.0004061044,0.1795135],"genre_scores_gemma":[0.8506883,0.002739535,0.06940317,0.0007876036,0.0009453492,0.0002136245,0.0004994815,0.0003731138,0.07434978],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007120809,"threshold_uncertainty_score":0.02382153,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W109448701","doi":"","title":"Bounds on the metric and partition dimensions of a graph","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Metric dimension; Partition (number theory); Vertex (graph theory); Dimension (graph theory); Graph; Discrete mathematics; Connectivity; Line graph; Pathwidth","authors":[{"name":"Glenn G. Chappell","is_ca":false},{"name":"John Gimbel","is_ca":false},{"name":"Chris Hartman","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02084863889451242,"gpt":0.2219481832698964,"spread":0.201099544375384,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003300298,0.001815297,0.001770586,0.003634278,0.002066555,0.004211962,0.002278591,0.002294869,0.002886475],"category_scores_gemma":[0.02928195,0.001208755,0.00109407,0.003434665,0.004661749,0.01214126,0.005050482,0.004099519,0.000519122],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003872769,"about_ca_system_score_gemma":0.0008644389,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009902224,"about_ca_topic_score_gemma":0.001447356,"domain_scores_codex":[0.9950316,0.001570962,0.0002559322,0.001287972,0.00116909,0.0006843941],"domain_scores_gemma":[0.9602651,0.02654276,0.003084383,0.005591721,0.002061291,0.002454763],"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.0005300927,0.0001068966,0.01273608,0.0003702794,0.000192246,0.0002481834,0.0008951053,0.0975213,0.008041568,0.8323274,0.01027299,0.03675785],"study_design_scores_gemma":[0.0000413615,0.0001942573,0.007114071,0.0001196022,0.0000846632,0.0006591122,0.000331676,0.2270312,0.004407726,0.7471381,0.01272167,0.000156469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5381631,0.006527631,0.3916066,0.007548013,0.0003219208,0.0001236498,0.003415939,0.00106292,0.05123026],"genre_scores_gemma":[0.9260726,0.001574294,0.06803083,0.000427171,0.0003368946,0.0002031007,0.001004193,0.0002232555,0.002127703],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004211962,"threshold_uncertainty_score":0.028099,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W36680195","doi":"10.3390/v15010155","title":"Eigenvalues of the Discrete p-Laplacian for Graphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":67,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Eigenvalues and eigenvectors; Laplacian matrix; Laplace operator; Pure mathematics; Combinatorics; Mathematical analysis; Physics","authors":[{"name":"S. Amghibech","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02646983396851626,"gpt":0.2914175538317178,"spread":0.2649477198632015,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006722977,0.00126879,0.0007479136,0.002953613,0.001096575,0.002024826,0.001304051,0.001836364,0.03046196],"category_scores_gemma":[0.003928205,0.0003448949,0.00101154,0.001976623,0.001627506,0.002800514,0.001520251,0.002312048,0.006977292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001328479,"about_ca_system_score_gemma":0.0005940588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00242364,"about_ca_topic_score_gemma":0.002871198,"domain_scores_codex":[0.9993988,0.0001801429,0.00002827002,0.000155843,0.0001363803,0.0001005398],"domain_scores_gemma":[0.9980394,0.000992869,0.0003287534,0.0001775915,0.00027229,0.0001891062],"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.00003546404,0.00003567387,0.0005514952,0.0002089556,0.0000265221,0.0003195212,0.0003034052,0.008684508,0.001567748,0.9450983,0.02329007,0.01987822],"study_design_scores_gemma":[0.000007858825,0.000009740524,0.0005208206,0.00002779627,0.000006575318,0.000366742,0.00008844553,0.02724973,0.0001622634,0.952814,0.0187267,0.00001932332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08112663,0.0104452,0.649586,0.01516162,0.002687356,0.0003235107,0.006702565,0.001261743,0.2327054],"genre_scores_gemma":[0.7172735,0.01647456,0.1142269,0.003572635,0.00352413,0.001180685,0.004689255,0.001099267,0.1379591],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03046196,"threshold_uncertainty_score":0.1019054,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2404127378","doi":"","title":"Radio Number for Square Paths.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":62,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Square (algebra); Statistics; Geometry","authors":[{"name":"Daphne Der‐Fen Liu","is_ca":false},{"name":"Melanie Xie","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01060503079864784,"gpt":0.2571862683527507,"spread":0.2465812375541028,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005104418,0.0005172806,0.0004449834,0.001693935,0.0009730235,0.002252741,0.0006698728,0.0007368873,0.03581395],"category_scores_gemma":[0.003995324,0.0001897288,0.0003021542,0.0009506675,0.001261948,0.002759519,0.001516633,0.00129343,0.008629655],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008328485,"about_ca_system_score_gemma":0.0006332156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006154297,"about_ca_topic_score_gemma":0.0009338608,"domain_scores_codex":[0.9995753,0.00008211091,0.00002059988,0.0000945565,0.0001189829,0.0001084041],"domain_scores_gemma":[0.9986424,0.000638879,0.0001687305,0.0001625997,0.0001924955,0.000194985],"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.00006618157,0.00001242327,0.0001468133,0.00006797294,0.000006481538,0.000051648,0.00007245169,0.0009963519,0.0008637407,0.966108,0.01275802,0.01884993],"study_design_scores_gemma":[0.00003279456,0.00005263224,0.0004319453,0.00004883477,0.00001252737,0.0002754462,0.00008687559,0.008242853,0.001332426,0.9284764,0.06098206,0.00002504395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1371548,0.003328894,0.2484055,0.006194497,0.002709952,0.0001280995,0.002102188,0.00134512,0.598631],"genre_scores_gemma":[0.7799116,0.001987436,0.05795636,0.001858319,0.001162917,0.0003117258,0.001072022,0.0004242467,0.1553153],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03581395,"threshold_uncertainty_score":0.1198096,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W117706154","doi":"","title":"PI Index of Armchair Polyhex Nanotubes.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":61,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Pure mathematics; Computer science; World Wide Web","authors":[{"name":"Али Реза Ашрафи","is_ca":false},{"name":"Amir Loghman","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01437029627748487,"gpt":0.2601400983097861,"spread":0.2457698020323012,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009996186,0.0003373615,0.0003385743,0.001491786,0.001286463,0.002153517,0.0004610419,0.0009005106,0.02514483],"category_scores_gemma":[0.0005071749,0.0001587691,0.0001209111,0.0008277888,0.0006722619,0.001407358,0.00106739,0.0007335904,0.003019758],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005152345,"about_ca_system_score_gemma":0.0003461805,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003741136,"about_ca_topic_score_gemma":0.0004993263,"domain_scores_codex":[0.9998223,0.00002095177,0.00001007994,0.00003085112,0.00006224553,0.00005351386],"domain_scores_gemma":[0.9997826,0.00004035004,0.00004267158,0.00003587538,0.00004211728,0.00005637426],"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.0001500113,0.00004166181,0.0004106437,0.00009591224,0.000007731629,0.0002196567,0.0001281933,0.0008848174,0.01359461,0.9559667,0.007178223,0.0213218],"study_design_scores_gemma":[0.0000266178,0.0001348245,0.002344246,0.0001032302,0.00002351413,0.0006216053,0.0004990837,0.02303322,0.03057472,0.8970405,0.045544,0.00005431602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.4646089,0.001045251,0.03032821,0.001179912,0.001332576,0.00006039058,0.001074485,0.0006367282,0.4997335],"genre_scores_gemma":[0.9467266,0.0006967005,0.005914775,0.0003433246,0.0001689824,0.0001132743,0.0005275588,0.0001625272,0.04534637],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02514483,"threshold_uncertainty_score":0.08411789,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W109780709","doi":"","title":"Super Connectivity of Star Graphs, Alternating Group Graphs and Split-Stars.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Stars; Mathematics; Star (game theory); Combinatorics; Group (periodic table); Astrophysics; Physics; Mathematical analysis","authors":[{"name":"Eddie Cheng","is_ca":false},{"name":"Marc J. Lipman","is_ca":false},{"name":"Hyungju Park","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0131934177858298,"gpt":0.2291992926725596,"spread":0.2160058748867298,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003060475,0.0002566418,0.0003249854,0.001089692,0.0006662799,0.001021892,0.000508863,0.0006084469,0.007194235],"category_scores_gemma":[0.002331467,0.0003232337,0.000268774,0.001043153,0.0008805219,0.003296959,0.0009755368,0.0008916096,0.0005343133],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000439525,"about_ca_system_score_gemma":0.0002657789,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000702399,"about_ca_topic_score_gemma":0.001463725,"domain_scores_codex":[0.999763,0.0000687471,0.00001062205,0.00005210458,0.00006175228,0.00004382907],"domain_scores_gemma":[0.9984286,0.0008207508,0.0002546587,0.0001374562,0.0001550297,0.0002033211],"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.00007253249,0.00002109761,0.0009587894,0.0001005212,0.00001423256,0.0002766816,0.0002666209,0.005254779,0.002241224,0.9675589,0.0058131,0.0174215],"study_design_scores_gemma":[0.0000114317,0.00001924177,0.0007725634,0.00002111329,0.00001239783,0.0003553922,0.0001636624,0.01545609,0.0005891391,0.9759132,0.006679724,0.000006085958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6063265,0.004546679,0.2056137,0.002576177,0.0003288763,0.00007932884,0.0008714816,0.0004471355,0.17921],"genre_scores_gemma":[0.9666127,0.001874681,0.01750301,0.0003203395,0.0002216736,0.00006502911,0.000573704,0.00006998937,0.01275886],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007194235,"threshold_uncertainty_score":0.02406704,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W170650356","doi":"","title":"On Super Edge-Magic Graphs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; MAGIC (telescope); Enhanced Data Rates for GSM Evolution; Combinatorics; Astronomy; Computer science; Physics; Artificial intelligence","authors":[{"name":"Ramón M. Figueroa-Centeno","is_ca":false},{"name":"Rikio Ichishima","is_ca":false},{"name":"Francesc A. Muntaner-Batle","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01560607092974055,"gpt":0.2119787918245898,"spread":0.1963727208948493,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001027294,0.0005788096,0.0007692746,0.002016243,0.002028089,0.002621658,0.001579959,0.001499489,0.01482996],"category_scores_gemma":[0.004453626,0.0005382138,0.0006361536,0.002605865,0.002459636,0.008294622,0.002898678,0.002757995,0.001835462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00163621,"about_ca_system_score_gemma":0.0007049382,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001521067,"about_ca_topic_score_gemma":0.003176632,"domain_scores_codex":[0.9989706,0.0003472818,0.00004480998,0.0002025924,0.0002275942,0.00020712],"domain_scores_gemma":[0.9961275,0.002243177,0.0003642658,0.0005939152,0.0002707747,0.0004003329],"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.00004782513,0.00002492533,0.0003619155,0.00009514139,0.000008932862,0.00003920049,0.0001092807,0.001907511,0.0005551639,0.9726712,0.008775023,0.01540388],"study_design_scores_gemma":[0.00001105483,0.000006715815,0.0002103088,0.00002687961,0.000006888208,0.00008286888,0.00009454189,0.006228698,0.0003903133,0.9854252,0.007509677,0.000007000212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2775422,0.005861848,0.3652454,0.008853268,0.0007813364,0.0001473661,0.002447303,0.0009765214,0.3381448],"genre_scores_gemma":[0.8140297,0.003546414,0.1230774,0.002098853,0.0006203968,0.0002311152,0.002544578,0.0003862273,0.05346533],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01482996,"threshold_uncertainty_score":0.04961115,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2395452549","doi":"","title":"The Wiener Polarity Index of Graph Products.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":58,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Polarity (international relations); Index (typography); Graph; Statistics; Combinatorics; Chemistry; Computer science","authors":[{"name":"Jing Ma","is_ca":false},{"name":"Yongtang Shi","is_ca":false},{"name":"Jun Yue","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01753218901229056,"gpt":0.2644962159810108,"spread":0.2469640269687202,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006176335,0.0005397034,0.0005707886,0.004478958,0.001217231,0.00380787,0.0006101659,0.000815366,0.008098797],"category_scores_gemma":[0.003659162,0.0003096809,0.0003528797,0.001868943,0.002168987,0.007619707,0.00180418,0.001512251,0.002321502],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009684731,"about_ca_system_score_gemma":0.0003443455,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000493724,"about_ca_topic_score_gemma":0.0005497118,"domain_scores_codex":[0.9994473,0.0001113091,0.00003219509,0.0001016416,0.0001995124,0.0001080562],"domain_scores_gemma":[0.9987364,0.0004425741,0.0002217231,0.0001426338,0.0002445683,0.0002121337],"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.00002625011,0.000006779664,0.0002797297,0.0000291442,0.00000498173,0.00003953301,0.00008937715,0.00023565,0.001054787,0.9873716,0.001953802,0.008908387],"study_design_scores_gemma":[0.000004513981,0.000009140398,0.0005011982,0.0000202622,0.000006537066,0.0001428787,0.00007870567,0.002196169,0.0009202863,0.9899132,0.006195551,0.00001150496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3837409,0.005752184,0.1354363,0.003716628,0.001570365,0.00005646012,0.001277415,0.0003856455,0.4680642],"genre_scores_gemma":[0.9479287,0.002918926,0.01280183,0.0004668618,0.001142161,0.00006639322,0.0005315403,0.0002260367,0.03391761],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008098797,"threshold_uncertainty_score":0.02709323,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W94353364","doi":"","title":"On computing the dissociation number and the induced matching number of bipartite graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":54,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Matching (statistics); Combinatorics; 3-dimensional matching; Graph; Statistics","authors":[{"name":"Rodica Boliac","is_ca":false},{"name":"Kathie Cameron","is_ca":false},{"name":"Vadim Lozin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01770208721375691,"gpt":0.2980210620098964,"spread":0.2803189747961394,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00199664,0.001289157,0.001658732,0.003114948,0.00167908,0.002892433,0.003776922,0.001807839,0.01283525],"category_scores_gemma":[0.02068749,0.0006927467,0.0009159585,0.003319574,0.002879498,0.0102728,0.003186761,0.002684803,0.003064831],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001975165,"about_ca_system_score_gemma":0.001316491,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00159107,"about_ca_topic_score_gemma":0.003417349,"domain_scores_codex":[0.998251,0.0005198051,0.00009181087,0.0004375793,0.0003740368,0.0003257273],"domain_scores_gemma":[0.9888877,0.007247736,0.0009886216,0.00166724,0.0004478098,0.00076086],"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.002600017,0.0009467722,0.01839506,0.0008531244,0.0002507076,0.0003622459,0.0005443039,0.1741062,0.008549937,0.4877056,0.04471805,0.2609679],"study_design_scores_gemma":[0.0001122976,0.00009606021,0.002496043,0.00004810747,0.0000438084,0.0002225632,0.0001466066,0.2512085,0.004062571,0.7366248,0.004898891,0.00003972397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4982349,0.002597113,0.4221818,0.003455496,0.000559016,0.000271183,0.003395878,0.003722007,0.06558254],"genre_scores_gemma":[0.7958079,0.0008943502,0.1835841,0.0005127357,0.0003941873,0.0002852464,0.004880321,0.0006770762,0.01296414],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01283525,"threshold_uncertainty_score":0.04293811,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2402190177","doi":"","title":"A proof to the odd-gracefulness of all lobsters.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Marine and fisheries research","field":"Environmental Science","cited_by":52,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Mathematical economics","authors":[{"name":"Xiangqian Zhou","is_ca":false},{"name":"Bing Yao","is_ca":false},{"name":"Chen Xiang-en","is_ca":false},{"name":"Haixia Tao","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01913491612644853,"gpt":0.25622921552363,"spread":0.2370942993971815,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001009219,0.000719713,0.00083627,0.001039612,0.0024376,0.002080523,0.001113306,0.00119564,0.02534411],"category_scores_gemma":[0.00821487,0.0005785084,0.001297746,0.0009034911,0.004807708,0.005444902,0.005703519,0.004164019,0.003303695],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001029288,"about_ca_system_score_gemma":0.0008586363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001946587,"about_ca_topic_score_gemma":0.002032731,"domain_scores_codex":[0.9991089,0.0001746962,0.00006191909,0.000282707,0.0001914829,0.0001802845],"domain_scores_gemma":[0.9953549,0.002238439,0.0002847278,0.0009702169,0.000572091,0.0005796666],"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.00007413107,0.00001985506,0.0007900418,0.00009112375,0.00002461913,0.0001833777,0.0002539521,0.0004936474,0.0008429025,0.972221,0.0116517,0.01335379],"study_design_scores_gemma":[0.00002543029,0.00002409639,0.0007746512,0.00003757869,0.00002220711,0.0003295704,0.0001287702,0.0007763607,0.0004024796,0.9740677,0.02338917,0.00002187351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1759909,0.006069303,0.3563428,0.02441847,0.005306458,0.0001212163,0.003260433,0.001597786,0.4268927],"genre_scores_gemma":[0.8815389,0.002011237,0.04447437,0.004698689,0.001664774,0.0001515115,0.001284517,0.0005908831,0.06358521],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02534411,"threshold_uncertainty_score":0.08478445,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2399012647","doi":"","title":"Hyperbolicity and parameters of graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics","authors":[{"name":"Junior Michel","is_ca":false},{"name":"José M. Rodrı́guez","is_ca":false},{"name":"José M. Sigarreta","is_ca":false},{"name":"María Villeta","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03253293733379627,"gpt":0.2614451418722669,"spread":0.2289122045384707,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007012148,0.0005916049,0.0005326738,0.002078563,0.001113687,0.003751209,0.001129425,0.001264701,0.01283162],"category_scores_gemma":[0.008060741,0.0005864786,0.0003951641,0.0016755,0.004295244,0.009216356,0.002700703,0.002901213,0.002222495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001474163,"about_ca_system_score_gemma":0.000384791,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001075167,"about_ca_topic_score_gemma":0.001053941,"domain_scores_codex":[0.9992162,0.0002426078,0.00004746052,0.0002150282,0.0001648577,0.0001139146],"domain_scores_gemma":[0.996401,0.001573661,0.000660466,0.0006696326,0.0003085683,0.0003867422],"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.00002737708,0.000008679216,0.0007085959,0.00003701816,0.000008354507,0.00003659806,0.0002826287,0.0009894603,0.0004576985,0.9895265,0.001778702,0.00613829],"study_design_scores_gemma":[0.000008243617,0.000005778671,0.0003565725,0.00001740688,0.000005400983,0.00008104114,0.0001591397,0.001235537,0.0002738691,0.9922554,0.005592556,0.000009056528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4624207,0.01326336,0.1478113,0.008230912,0.001024537,0.00009408341,0.001455451,0.0004812054,0.3652184],"genre_scores_gemma":[0.9624325,0.002417937,0.006856107,0.0003843317,0.000403372,0.00005309119,0.0003688757,0.0001602909,0.0269234],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01283162,"threshold_uncertainty_score":0.04292607,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W58703409","doi":"","title":"All Cycles are Edge-Magic.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Teaching and Learning Programming","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; MAGIC (telescope); Enhanced Data Rates for GSM Evolution; Astronomy; Computer science; Artificial intelligence; Physics","authors":[{"name":"Omer Berkman","is_ca":false},{"name":"Michal Parnas","is_ca":false},{"name":"Y. Roditty","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02086550752196746,"gpt":0.2653799760962254,"spread":0.244514468574258,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003546172,0.00111064,0.0007694333,0.001401475,0.002881585,0.003844156,0.001230068,0.001346623,0.06951389],"category_scores_gemma":[0.003515206,0.0008146511,0.0007812618,0.001753136,0.00196539,0.003949816,0.001981485,0.001955897,0.01556606],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008216869,"about_ca_system_score_gemma":0.001282905,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001994418,"about_ca_topic_score_gemma":0.003431456,"domain_scores_codex":[0.9990386,0.0001417361,0.00005896154,0.0002603826,0.0002231433,0.0002772342],"domain_scores_gemma":[0.998534,0.0002874468,0.0001515672,0.0003198942,0.0005357368,0.000171329],"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.0003215491,0.00007472366,0.0006702962,0.0002902949,0.00004651429,0.0003844389,0.0004440061,0.0007084947,0.006126218,0.8561492,0.04603339,0.08875085],"study_design_scores_gemma":[0.00005249973,0.00005626037,0.0004749639,0.0001185657,0.00004372041,0.0005439243,0.0003573059,0.001346097,0.008502787,0.7342392,0.2542255,0.00003920725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.06932261,0.001018553,0.1659826,0.001677657,0.001765022,0.000490699,0.003797062,0.002460673,0.7534851],"genre_scores_gemma":[0.5372847,0.002265776,0.1159876,0.001512816,0.0004431377,0.0006679273,0.005196215,0.00188269,0.3347591],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.06951389,"threshold_uncertainty_score":0.2325471,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W129481463","doi":"","title":"Tribonacci sequences with certain indices and their sums","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":43,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Statistics","authors":[{"name":"Emrah Kılıç","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01155628825511641,"gpt":0.2380246911680908,"spread":0.2264684029129744,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001022497,0.001154095,0.001140172,0.004534894,0.004334114,0.004782965,0.001380099,0.002101351,0.01141793],"category_scores_gemma":[0.003806206,0.0006760455,0.0009415909,0.004084061,0.003198749,0.005010441,0.002472319,0.002869517,0.003145275],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001385972,"about_ca_system_score_gemma":0.0008390973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006359923,"about_ca_topic_score_gemma":0.0008818662,"domain_scores_codex":[0.9989729,0.0002135608,0.00009400065,0.0001404221,0.0003554392,0.0002236578],"domain_scores_gemma":[0.9984315,0.0006005804,0.0002006312,0.0001931096,0.0002850468,0.0002890526],"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.00001712145,0.000007397449,0.00005491074,0.00001288162,0.000002988076,0.0000792012,0.0001318736,0.0001303074,0.0005134642,0.9958407,0.0006312941,0.00257784],"study_design_scores_gemma":[0.000008085313,0.00001140614,0.0001265437,0.00001841577,0.000008638752,0.0002827109,0.00009073487,0.001851335,0.0006761753,0.9894822,0.007425508,0.00001824307],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3915231,0.002795321,0.2006125,0.001695513,0.002383093,0.0001819393,0.0005015488,0.0005561479,0.3997509],"genre_scores_gemma":[0.7877325,0.001661678,0.0622793,0.001014453,0.001455267,0.0004894424,0.0006010314,0.0005607178,0.1442056],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01141793,"threshold_uncertainty_score":0.03819674,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2408690479","doi":"","title":"Total edge irregularity strength of strong product of two paths.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Product (mathematics); Geometry; Computer science; Artificial intelligence","authors":[{"name":"Ali Ahmad","is_ca":false},{"name":"Martin Bača","is_ca":false},{"name":"Yasir Bashir","is_ca":false},{"name":"Muhammad Kamran Siddiqui","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01552113693698124,"gpt":0.245013723919636,"spread":0.2294925869826548,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001559868,0.0004517178,0.0008294426,0.002273107,0.001770444,0.002677786,0.001351085,0.001095859,0.008709121],"category_scores_gemma":[0.008949172,0.000547221,0.0006162949,0.001462276,0.002051178,0.004539339,0.002324605,0.001653219,0.0007672438],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009163303,"about_ca_system_score_gemma":0.000478484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005614311,"about_ca_topic_score_gemma":0.0005623702,"domain_scores_codex":[0.9986432,0.0004218353,0.00007416771,0.0003182088,0.0003179719,0.0002245796],"domain_scores_gemma":[0.9900233,0.005310215,0.00128142,0.001157735,0.0009703583,0.001256915],"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.0004126573,0.00007273471,0.005268564,0.0001898491,0.00006154798,0.0003143721,0.0003578278,0.008649303,0.005910838,0.9562641,0.003836048,0.01866212],"study_design_scores_gemma":[0.00005103331,0.0001066219,0.003333668,0.0000645375,0.0000971578,0.00080616,0.0004058755,0.05315398,0.005162709,0.9302127,0.006556317,0.00004919757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8313795,0.0006127364,0.1042326,0.00112065,0.0001707136,0.00006504862,0.0007706801,0.0002613753,0.06138671],"genre_scores_gemma":[0.9829063,0.0002060683,0.01138042,0.0001206523,0.00008232687,0.00004983135,0.0003086229,0.0000701579,0.004875669],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008709121,"threshold_uncertainty_score":0.02913493,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2962898528","doi":"","title":"The generalized connectivity of complete bipartite graphs","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Spanning tree; Bipartite graph; Disjoint sets; Graph; Integer (computer science); Discrete mathematics; Computer science","authors":[{"name":"Shasha Li","is_ca":false},{"name":"Wei Li","is_ca":false},{"name":"Xueliang Li","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01519056727110667,"gpt":0.2369342640556601,"spread":0.2217436967845535,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004855699,0.0004818874,0.0005568314,0.001809537,0.0008039672,0.001469027,0.0007632239,0.0006424718,0.002486405],"category_scores_gemma":[0.004034585,0.0003992024,0.0003986016,0.001931926,0.001332517,0.002760362,0.001076039,0.0006825995,0.0001516838],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000930895,"about_ca_system_score_gemma":0.0003679715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001210563,"about_ca_topic_score_gemma":0.001263512,"domain_scores_codex":[0.9991996,0.0002082508,0.00004180648,0.0002336317,0.0001755714,0.0001411943],"domain_scores_gemma":[0.997466,0.001177269,0.0005456753,0.0002767741,0.0002925498,0.0002418124],"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.0004726766,0.00007280072,0.01136215,0.0006777667,0.0001612852,0.0008857904,0.001562201,0.07032985,0.01515779,0.8127879,0.009810626,0.07671926],"study_design_scores_gemma":[0.00008677022,0.0001206189,0.01470634,0.0001512395,0.0001048166,0.001866217,0.000590253,0.2005226,0.003632528,0.7517391,0.02641618,0.00006330911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8137069,0.002432347,0.1421834,0.001094293,0.00008397223,0.0001235619,0.002348541,0.0003012391,0.03772567],"genre_scores_gemma":[0.9734563,0.001435126,0.02097793,0.000163476,0.0002007099,0.0001995146,0.001453888,0.00004691475,0.002066061],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002486405,"threshold_uncertainty_score":0.008317888,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2397563057","doi":"","title":"Weighted Composition Operators From Bloch-Type Spaces To Weighted-Type Spaces.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Holomorphic and Operator Theory","field":"Mathematics","cited_by":41,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Composition (language); Pure mathematics; Linguistics; Geology","authors":[{"name":"Weifeng Yang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01893201615964881,"gpt":0.2739481385122142,"spread":0.2550161223525654,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001045308,0.0005884029,0.0003998691,0.001841671,0.001144914,0.002323522,0.0006687846,0.0006755042,0.008799881],"category_scores_gemma":[0.002822489,0.0003242104,0.0006179708,0.001393312,0.001900791,0.006742798,0.002712586,0.001879611,0.001424929],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007379291,"about_ca_system_score_gemma":0.0004446992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004140269,"about_ca_topic_score_gemma":0.0005688497,"domain_scores_codex":[0.9993611,0.000188061,0.00004151044,0.00009313229,0.0002358944,0.00008033598],"domain_scores_gemma":[0.9990929,0.0002249091,0.0001199474,0.0001394669,0.0002536205,0.0001692117],"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.000007843986,0.00000644205,0.00005042446,0.00001618753,0.000003811147,0.00002785024,0.00006977114,0.0001291175,0.0005386262,0.9938921,0.0007830029,0.004474871],"study_design_scores_gemma":[0.000004986829,0.000009474355,0.0001079923,0.00001051329,0.00000622981,0.0001253114,0.00007831498,0.002179572,0.0006150359,0.9894053,0.007450446,0.000006852504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1430512,0.00306895,0.6199329,0.00210087,0.001392658,0.00009175933,0.0004035967,0.0006034467,0.2293548],"genre_scores_gemma":[0.7436982,0.002885027,0.134939,0.0009758463,0.001014044,0.0001731077,0.0004241406,0.0004572563,0.1154334],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008799881,"threshold_uncertainty_score":0.02943856,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W29918265","doi":"","title":"Characterizations of arboricity of graphs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Combinatorics; Arboricity; Mathematics; Dense graph; Indifference graph; Pathwidth; Chordal graph; Discrete mathematics; Clique-sum; 1-planar graph; Bounding overwatch; Spanning tree; Trémaux tree; Cograph; Graph; Line graph; Planar graph; Computer science","authors":[{"name":"Ruth Haas","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008007175654805906,"gpt":0.1794947977873769,"spread":0.171487622132571,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007089751,0.0008262647,0.0004226368,0.002934966,0.0007045013,0.001716497,0.0008369412,0.000945325,0.007302269],"category_scores_gemma":[0.005653793,0.0003816778,0.0006558054,0.002373707,0.001282525,0.003639739,0.0009937107,0.001625762,0.000811216],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007310504,"about_ca_system_score_gemma":0.0002246892,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002254,"about_ca_topic_score_gemma":0.0004284075,"domain_scores_codex":[0.9990966,0.0002064161,0.00007497959,0.0002368998,0.0002518948,0.0001330848],"domain_scores_gemma":[0.9925235,0.004429303,0.001525818,0.00054342,0.0004709715,0.0005069272],"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.0002039933,0.0001451127,0.0111733,0.0006205348,0.00009229471,0.0006107564,0.0008215785,0.02866337,0.01891398,0.8583778,0.007149659,0.0732277],"study_design_scores_gemma":[0.00002354482,0.0001554054,0.00549641,0.0001221781,0.0000553598,0.002268796,0.0004866859,0.05322375,0.00585669,0.9111688,0.02111056,0.00003176791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.4262697,0.003674345,0.4651577,0.001695601,0.0001675304,0.0002027372,0.002813668,0.0006979863,0.09932083],"genre_scores_gemma":[0.9448115,0.001592652,0.04522379,0.0002909258,0.0002770366,0.0001721554,0.002475295,0.0001572375,0.004999387],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007302269,"threshold_uncertainty_score":0.02442849,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W172950155","doi":"","title":"Radio Labelings of Cycles","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Plant Surface Properties and Treatments","field":"Agricultural and Biological Sciences","cited_by":41,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic","authors":[{"name":"Ping Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02339689257608252,"gpt":0.1922108546035047,"spread":0.1688139620274222,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005923389,0.0006629928,0.0003967313,0.001211772,0.0008360026,0.0007675875,0.000935163,0.0005712346,0.007283539],"category_scores_gemma":[0.0007856386,0.0003647015,0.0004907165,0.0007719153,0.0006660101,0.000544814,0.0007938993,0.0009452101,0.001766109],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009364367,"about_ca_system_score_gemma":0.0004445162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00133296,"about_ca_topic_score_gemma":0.0018292,"domain_scores_codex":[0.9994707,0.0001333551,0.00002151688,0.000156548,0.0000641347,0.0001538219],"domain_scores_gemma":[0.9992626,0.0002214915,0.0000852097,0.0002591889,0.00009737557,0.00007424641],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006116398,0.00006790189,0.0007084736,0.000178605,0.00002517572,0.0001815046,0.0002281211,0.0007218351,0.965692,0.01461605,0.0009317209,0.016037],"study_design_scores_gemma":[0.00002276494,0.0003649786,0.0007949977,0.00001174081,0.00002704099,0.0001345132,0.00004308074,0.001139314,0.9777032,0.0006182884,0.01912917,0.00001104475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8157587,0.003522237,0.1061184,0.0005201158,0.0003658397,0.0002351928,0.0009503531,0.001251652,0.07127757],"genre_scores_gemma":[0.9308222,0.0009743248,0.02580897,0.0003562625,0.00007558989,0.0002377717,0.001543152,0.0007331124,0.03944868],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007283539,"threshold_uncertainty_score":0.02436584,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2403887512","doi":"","title":"The Harmonic Index on Unicyclic Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":40,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Harmonic; Combinatorics; Statistics; Computer science; Acoustics; Physics; World Wide Web","authors":[{"name":"Lingping Zhong","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0319056874760969,"gpt":0.2951569416950728,"spread":0.2632512542189759,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003981742,0.0004112572,0.000618829,0.003541625,0.001058381,0.00237643,0.001086605,0.0009150085,0.01037684],"category_scores_gemma":[0.004100023,0.0002696943,0.0002408681,0.002409749,0.00195514,0.003811559,0.002123724,0.001420638,0.001690828],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001246551,"about_ca_system_score_gemma":0.0003384195,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009787398,"about_ca_topic_score_gemma":0.001062998,"domain_scores_codex":[0.9995584,0.00008768857,0.00002058778,0.00008356704,0.0001590378,0.00009066238],"domain_scores_gemma":[0.998348,0.0007310463,0.0002882546,0.00018161,0.0001859366,0.0002652031],"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.00004133098,0.00001295961,0.0003880678,0.00006890885,0.000007864269,0.00005706869,0.0001755919,0.001047965,0.0008782493,0.9737235,0.005322992,0.01827553],"study_design_scores_gemma":[0.000007583456,0.00001005203,0.0005110902,0.00002681465,0.00000672339,0.0001442661,0.0001100568,0.004660646,0.0004328357,0.9877577,0.006321847,0.00001051909],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.4409902,0.01046678,0.08897784,0.004400165,0.001848255,0.00007513991,0.001326116,0.0003817619,0.4515338],"genre_scores_gemma":[0.9543715,0.003537315,0.007431684,0.0003605451,0.0009356583,0.00006345586,0.0004474659,0.0001375028,0.03271492],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01037684,"threshold_uncertainty_score":0.03471398,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2400382429","doi":"","title":"A Note on Strongly Graceful Trees.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics","authors":[{"name":"Bing Yao","is_ca":false},{"name":"Hui Cheng","is_ca":false},{"name":"Yao Ming","is_ca":false},{"name":"Meimei Zhao","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01117670606602096,"gpt":0.2383382808877684,"spread":0.2271615748217474,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001784929,0.0009482666,0.000951785,0.001474172,0.002555999,0.003150698,0.00182321,0.001600855,0.01725872],"category_scores_gemma":[0.005825154,0.0006316153,0.001092736,0.002771139,0.004335319,0.009412888,0.00474729,0.007269692,0.003815795],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002055536,"about_ca_system_score_gemma":0.001163739,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002724306,"about_ca_topic_score_gemma":0.004350436,"domain_scores_codex":[0.998722,0.000365625,0.00005741908,0.0002939987,0.0003806985,0.0001801886],"domain_scores_gemma":[0.9954706,0.002839781,0.0001615669,0.0008604006,0.0002657551,0.0004019474],"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.00002799565,0.00002000793,0.0001481739,0.00009280648,0.000007054513,0.00007543415,0.0001390516,0.001042668,0.0004962249,0.956397,0.02503135,0.01652223],"study_design_scores_gemma":[0.000005017606,0.0000101624,0.0001301108,0.00003056688,0.000006647572,0.00008247612,0.00005133812,0.001650575,0.0002990241,0.947388,0.05033547,0.00001065306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.03018262,0.0142554,0.3875914,0.04069439,0.008231443,0.0001344622,0.001557716,0.002046888,0.5153057],"genre_scores_gemma":[0.5169793,0.02596892,0.2616983,0.01704849,0.01089404,0.0004243322,0.001838477,0.002006817,0.1631414],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01725872,"threshold_uncertainty_score":0.05773622,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W179124857","doi":"","title":"Bounding the roots of independence polynomials","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Functional Equations Stability Results","field":"Mathematics","cited_by":40,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Bounding overwatch; Independence (probability theory); Combinatorics; Statistics; Artificial intelligence; Computer science","authors":[{"name":"Jason I. Brown","is_ca":false},{"name":"Richard J. Nowakowski","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04643839219436271,"gpt":0.3094851366357045,"spread":0.2630467444413419,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001768136,0.001178303,0.00121274,0.00261126,0.001736418,0.002785004,0.001906013,0.001311391,0.01281656],"category_scores_gemma":[0.01484906,0.0007128922,0.0008610049,0.001496319,0.003744316,0.006926496,0.00316583,0.006082311,0.002326282],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001679069,"about_ca_system_score_gemma":0.0007827351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001139105,"about_ca_topic_score_gemma":0.001527855,"domain_scores_codex":[0.9983497,0.0004639576,0.00004344234,0.0002846839,0.0005542999,0.0003039837],"domain_scores_gemma":[0.9889724,0.008161162,0.0007250952,0.0007561587,0.0008029701,0.0005823004],"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.00003234554,0.00002482335,0.0002935846,0.00004803087,0.000008884799,0.00005054584,0.0001329506,0.004586765,0.001171046,0.9844174,0.002267818,0.006965685],"study_design_scores_gemma":[0.000006618031,0.00000737795,0.0002168456,0.0000110742,0.000006737917,0.0000465795,0.00003280605,0.03456376,0.0008991205,0.962678,0.001520539,0.00001058291],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2384296,0.00163496,0.5385011,0.00418719,0.0003652265,0.00006372491,0.0004569295,0.0006525461,0.2157085],"genre_scores_gemma":[0.9427662,0.0007797591,0.02255223,0.0003676429,0.0005705835,0.00008160906,0.0002884421,0.0003213843,0.03227209],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01281656,"threshold_uncertainty_score":0.04287565,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2400192545","doi":"","title":"Note on the generalized connectivity.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics","authors":[{"name":"Hengzhe Li","is_ca":false},{"name":"Xueliang Li","is_ca":false},{"name":"Yaping Mao","is_ca":false},{"name":"Yuefang Sun","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01472740028650004,"gpt":0.2350378933231593,"spread":0.2203104930366592,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008219285,0.0008603114,0.0007513149,0.001860884,0.001339617,0.001878748,0.001346021,0.001143274,0.02470084],"category_scores_gemma":[0.005004642,0.0002984756,0.0009013828,0.001936814,0.004252781,0.005206979,0.002812285,0.003764809,0.002826353],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008536966,"about_ca_system_score_gemma":0.0005691761,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001564351,"about_ca_topic_score_gemma":0.001847846,"domain_scores_codex":[0.9992357,0.0002095989,0.00003340565,0.0002140193,0.0002261184,0.00008115581],"domain_scores_gemma":[0.9975957,0.001421181,0.0001062399,0.0004366695,0.0002956074,0.0001445762],"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.00001294932,0.000004605238,0.00008330245,0.00008231374,0.00001116792,0.0001638851,0.00006430066,0.0005697727,0.0003584088,0.9761204,0.01517106,0.007357877],"study_design_scores_gemma":[0.00000777802,0.0000192622,0.0002919944,0.00003993038,0.00001661203,0.0003381623,0.00004744604,0.001206744,0.0002156359,0.9356748,0.06212942,0.00001221818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.02305483,0.02469703,0.2035101,0.03475952,0.01481799,0.0001001713,0.001508606,0.0006668795,0.6968849],"genre_scores_gemma":[0.7088627,0.04349117,0.08745991,0.02287394,0.0221632,0.0004762002,0.00157252,0.0007357544,0.1123646],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02470084,"threshold_uncertainty_score":0.0826326,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2403011525","doi":"","title":"A note on the Kirchhoff index of bicyclic graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Resistance distance; Combinatorics; Generalization; Graph; Index (typography); Topological index; Discrete mathematics; Mathematical analysis; Graph power; Line graph; Computer science","authors":[{"name":"Lihua Feng","is_ca":false},{"name":"Guihai Yu","is_ca":false},{"name":"Kexiang Xu","is_ca":false},{"name":"Zhengtao Jiang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02145331754269859,"gpt":0.2789878806951229,"spread":0.2575345631524243,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006046719,0.0006391293,0.0007456054,0.002302343,0.001077525,0.001236156,0.001200253,0.000775231,0.005428205],"category_scores_gemma":[0.003112926,0.000318112,0.0004939639,0.002075062,0.002564099,0.003726988,0.001922751,0.002556174,0.0007800942],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000789788,"about_ca_system_score_gemma":0.0003731078,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001181909,"about_ca_topic_score_gemma":0.001261277,"domain_scores_codex":[0.9993175,0.0001226628,0.00004569469,0.0001653825,0.0002519186,0.00009678568],"domain_scores_gemma":[0.9982879,0.0009272819,0.0001589375,0.0002479581,0.0001794316,0.0001984687],"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.0001245656,0.00004686694,0.001090759,0.0003300712,0.00003086925,0.0003902501,0.000553339,0.003582482,0.008144785,0.93894,0.009266726,0.03749922],"study_design_scores_gemma":[0.00001992883,0.000113573,0.001822858,0.0000834317,0.00003098094,0.0008619264,0.0002086643,0.009240052,0.004311957,0.9370528,0.04614577,0.0001080141],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2311522,0.02944772,0.2813105,0.00658313,0.004358876,0.0001356076,0.00109925,0.000669769,0.445243],"genre_scores_gemma":[0.8977612,0.01042473,0.07278454,0.001712171,0.001830148,0.00005223999,0.0004214229,0.0001918927,0.01482166],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005428205,"threshold_uncertainty_score":0.01815915,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W168516241","doi":"","title":"Anti-Ramsey numbers for small complete bipartite graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Ramsey's theorem; Bipartite graph; Combinatorics; Robertson–Seymour theorem; Discrete mathematics; Graph; 1-planar graph; Chordal graph","authors":[{"name":"Maria Axenovich","is_ca":false},{"name":"Tao Jiang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04241386506238429,"gpt":0.284002078138853,"spread":0.2415882130764687,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001627307,0.0003849157,0.0004731155,0.002419641,0.001513459,0.002890991,0.0009640837,0.0008937211,0.009532367],"category_scores_gemma":[0.00906889,0.0004006388,0.000363042,0.0009391467,0.002732296,0.006200969,0.001631638,0.001755816,0.0009157329],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001237208,"about_ca_system_score_gemma":0.0005987855,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004476663,"about_ca_topic_score_gemma":0.0008250952,"domain_scores_codex":[0.9990282,0.00036459,0.00004922303,0.0001706013,0.0002650805,0.0001222707],"domain_scores_gemma":[0.9933338,0.004282412,0.0006871358,0.0004782734,0.0005306044,0.0006877717],"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.00002160165,0.00001002879,0.0001456949,0.00003091636,0.00000333509,0.00001473137,0.00005442066,0.0004061514,0.0002701359,0.9947978,0.001625866,0.00261925],"study_design_scores_gemma":[0.000009653985,0.000008356031,0.0001799781,0.00001673242,0.000005464509,0.00009645285,0.00005177348,0.004458227,0.0003338665,0.9917969,0.003036312,0.000006275639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4472799,0.003693944,0.1671284,0.005930352,0.0006430699,0.0001186552,0.001000011,0.0006659101,0.3735397],"genre_scores_gemma":[0.9664374,0.0008183502,0.01677999,0.0004162186,0.0002387256,0.0001826338,0.0002000968,0.00006660729,0.01486002],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009532367,"threshold_uncertainty_score":0.0318889,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2401964130","doi":"","title":"On The Global Asymptotic Behavior Of A System Of Two Nonlinear Difference Equations.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematical and Theoretical Epidemiology and Ecology Models","field":"Medicine","cited_by":36,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Nonlinear system; Applied mathematics; Mathematical analysis; Physics","authors":[{"name":"İbrahim Yalçınkaya","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02223837557010622,"gpt":0.2998731753405977,"spread":0.2776347997704914,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004486717,0.0008344487,0.001260491,0.001676265,0.0008696094,0.001899751,0.001492839,0.002233513,0.005370563],"category_scores_gemma":[0.03509731,0.0005456679,0.001272568,0.0006658378,0.004523083,0.003678671,0.003732511,0.002546677,0.0004891712],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001278871,"about_ca_system_score_gemma":0.001073151,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003266472,"about_ca_topic_score_gemma":0.001761437,"domain_scores_codex":[0.9987238,0.0006865211,0.00005983287,0.0001374837,0.0002361654,0.000156041],"domain_scores_gemma":[0.9790166,0.01625572,0.001700781,0.0006399618,0.001347965,0.001038937],"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.000044826,0.0000429049,0.002064574,0.0001454908,0.0001025612,0.0002793677,0.0002618222,0.05785935,0.001155764,0.9304736,0.002619099,0.004950606],"study_design_scores_gemma":[0.00003190428,0.00004098228,0.001103717,0.00004701138,0.0000352145,0.0001622891,0.0001202737,0.5288824,0.0002136616,0.4681324,0.00119744,0.00003259226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1570865,0.00324684,0.7880156,0.006678365,0.0006066413,0.0001365261,0.0003029542,0.000341269,0.04358535],"genre_scores_gemma":[0.9546033,0.001590955,0.0295334,0.0005772002,0.000426614,0.0002139147,0.0002247036,0.0001231027,0.01270684],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005370563,"threshold_uncertainty_score":0.02372825,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2219595186","doi":"","title":"On the metric dimension of Mobius ladders","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Combinatorics; Metric dimension; Mathematics; Vertex (graph theory); Dimension (graph theory); Cardinality (data modeling); Metric space; Constant (computer programming); Packing dimension; Discrete mathematics; Graph; Minkowski–Bouligand dimension; Chordal graph; Mathematical analysis","authors":[{"name":"Murtaza Ali","is_ca":false},{"name":"Gohar Ali","is_ca":false},{"name":"Muhammad Imran","is_ca":false},{"name":"Abdul Qudair Baig","is_ca":false},{"name":"Muhammad Kashif Shafiq","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01537372741380224,"gpt":0.2279979475346106,"spread":0.2126242201208083,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006833249,0.00057041,0.0005870507,0.002512577,0.001139583,0.001691031,0.0007075962,0.0006230085,0.003103403],"category_scores_gemma":[0.00297155,0.0003177132,0.0004937525,0.001496671,0.002625218,0.002623698,0.001823446,0.001133371,0.0003746883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001244709,"about_ca_system_score_gemma":0.0003080824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001023041,"about_ca_topic_score_gemma":0.0006319209,"domain_scores_codex":[0.9993464,0.0001661507,0.00003263558,0.0001583031,0.0001441466,0.0001523397],"domain_scores_gemma":[0.9979284,0.0008797049,0.0003690576,0.0002019145,0.0002078118,0.0004131129],"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.0000867367,0.00003158734,0.00186101,0.00007487817,0.00001804924,0.000121403,0.0005041815,0.00308145,0.002544295,0.9813647,0.001502421,0.008809333],"study_design_scores_gemma":[0.00002415377,0.00007552623,0.002702861,0.00004382442,0.00001869395,0.0003300024,0.0002939065,0.01861948,0.001053678,0.9689146,0.007885315,0.0000378657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8931292,0.002267221,0.05291029,0.001207849,0.000160353,0.00003817325,0.0005232582,0.0001304335,0.04963323],"genre_scores_gemma":[0.9826229,0.001054796,0.01227256,0.0001546677,0.0001959815,0.00004378914,0.0002468236,0.00004168017,0.003366887],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003103403,"threshold_uncertainty_score":0.01038194,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W31298921","doi":"10.1164/rccm.201906-1275ed","title":"Braodcast Chromatic Numbers of Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics","authors":[{"name":"Wayne Goddard","is_ca":false},{"name":"Sandra M. Hedetniemi","is_ca":false},{"name":"Stephen T. Hedetniemi","is_ca":false},{"name":"John M. Harris","is_ca":false},{"name":"Douglas F. Rall","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01929074242428957,"gpt":0.2675628570168777,"spread":0.2482721145925881,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005399504,0.0004031432,0.0003911941,0.002695398,0.001695786,0.003840384,0.0009991889,0.0008459408,0.03241947],"category_scores_gemma":[0.00386154,0.000326834,0.0002371622,0.00182365,0.001650717,0.004229306,0.001247876,0.001773416,0.003910072],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001868612,"about_ca_system_score_gemma":0.0007942436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002295499,"about_ca_topic_score_gemma":0.004971665,"domain_scores_codex":[0.9994414,0.00009240033,0.00002084611,0.0001372059,0.0001656232,0.0001424815],"domain_scores_gemma":[0.9978247,0.0008863319,0.0002203036,0.0003740788,0.0003525491,0.0003421014],"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.000142187,0.00002877293,0.0009352969,0.00006918261,0.000007548262,0.00003272587,0.0001657782,0.001764568,0.002170762,0.966822,0.009692138,0.01816897],"study_design_scores_gemma":[0.00003404797,0.00002836438,0.001628685,0.00005601294,0.00001284573,0.000136323,0.0002811898,0.01109098,0.003252486,0.9416687,0.04178441,0.00002596448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3513069,0.001943242,0.1056422,0.002771547,0.001085681,0.0001528602,0.004495137,0.001094259,0.5315081],"genre_scores_gemma":[0.8916117,0.001046773,0.02319683,0.0003713929,0.0002091605,0.0001472891,0.001930567,0.0003246394,0.08116159],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03241947,"threshold_uncertainty_score":0.1084539,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W145866003","doi":"","title":"A note on graphs with disjoint dominating and total dominating sets.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Disjoint sets; Dominating set; Combinatorics; Graph","authors":[{"name":"Michael A. Henning","is_ca":false},{"name":"Justin Southey","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01371175746408366,"gpt":0.2653739001692003,"spread":0.2516621427051166,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001825768,0.001387113,0.001603954,0.001937792,0.00228069,0.002724445,0.002338395,0.001444206,0.008218165],"category_scores_gemma":[0.007355422,0.0006754336,0.001929318,0.003130032,0.003643002,0.01023564,0.003673778,0.006633806,0.002607862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001694624,"about_ca_system_score_gemma":0.0007740869,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00254116,"about_ca_topic_score_gemma":0.00468628,"domain_scores_codex":[0.9987711,0.0003731638,0.00007654016,0.0003019158,0.0003721413,0.0001050521],"domain_scores_gemma":[0.9939901,0.004400233,0.0001841249,0.0006752636,0.0004285194,0.0003218427],"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.0001626377,0.00006641532,0.0006470297,0.0008887242,0.0001072833,0.001094024,0.0003844585,0.00341617,0.001972986,0.802287,0.1285512,0.06042201],"study_design_scores_gemma":[0.00001942467,0.00005087406,0.0007258378,0.0001519716,0.00007103574,0.00107626,0.0001650681,0.002622984,0.0004674202,0.8505216,0.1440949,0.00003258677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.02159759,0.09468618,0.318755,0.05822085,0.0404592,0.000218983,0.002088086,0.0009578956,0.4630162],"genre_scores_gemma":[0.3458553,0.1264368,0.3015352,0.02907211,0.05777767,0.0004763723,0.002074471,0.001221583,0.1355505],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008218165,"threshold_uncertainty_score":0.02749252,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W176713422","doi":"","title":"The Inverse Domination Number of a Graph.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Inverse; Graph; Combinatorics; Geometry","authors":[{"name":"Gayla S. Domke","is_ca":false},{"name":"Jean E. Dunbar","is_ca":false},{"name":"Lisa R. Markus","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01253304782969812,"gpt":0.2847599724812493,"spread":0.2722269246515512,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006815669,0.000476789,0.0005759065,0.003581371,0.001371719,0.003083018,0.0008358171,0.0008796536,0.01327754],"category_scores_gemma":[0.005532858,0.0002560386,0.000404925,0.001764657,0.002149218,0.004723758,0.001153243,0.001768856,0.001617567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001224495,"about_ca_system_score_gemma":0.0005903058,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007385503,"about_ca_topic_score_gemma":0.0009590536,"domain_scores_codex":[0.9991477,0.0001744829,0.00004495486,0.0002263381,0.0002301424,0.0001765139],"domain_scores_gemma":[0.9954618,0.002856745,0.0004292525,0.0003613627,0.000418533,0.0004723994],"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.0002363686,0.00005059088,0.002424392,0.0002048362,0.00003768508,0.0001437241,0.0004158182,0.002730826,0.005919998,0.9321733,0.01247465,0.04318786],"study_design_scores_gemma":[0.00002945795,0.00004678607,0.002755484,0.00007359794,0.00005002462,0.0008897801,0.0002624928,0.0100767,0.005538017,0.9461672,0.03406886,0.00004141681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4777745,0.00257453,0.09392923,0.004018691,0.0009064901,0.00008974021,0.0039022,0.0007694011,0.4160352],"genre_scores_gemma":[0.9555339,0.001235782,0.01643878,0.0003250942,0.0004477734,0.0001035974,0.001030415,0.0001691833,0.02471541],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01327754,"threshold_uncertainty_score":0.04441774,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W170988298","doi":"","title":"Twin Domination in Digraphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Physics","authors":[{"name":"Gary Chartrand","is_ca":false},{"name":"Peter Dankelmann","is_ca":false},{"name":"Michelle Schultz","is_ca":false},{"name":"Henda C. Swart","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01347268203076609,"gpt":0.2752534278787934,"spread":0.2617807458480273,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007871212,0.0005818884,0.0005292585,0.001867943,0.002364054,0.00342294,0.0005209831,0.0006250794,0.01186655],"category_scores_gemma":[0.002935567,0.0005713121,0.000709258,0.002437936,0.002133395,0.004380743,0.002162097,0.001193175,0.001408013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002226747,"about_ca_system_score_gemma":0.001000994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003174013,"about_ca_topic_score_gemma":0.006202702,"domain_scores_codex":[0.9989743,0.0002669348,0.00007762328,0.0002730998,0.0002155972,0.0001924389],"domain_scores_gemma":[0.9981495,0.0009554525,0.0001613037,0.0002062889,0.0002777448,0.000249686],"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.00004499816,0.0000142608,0.0006163499,0.00009681367,0.00001355654,0.0002452484,0.000884695,0.001042196,0.0009402211,0.9588364,0.00352021,0.03374498],"study_design_scores_gemma":[0.0000149789,0.00002193612,0.0005088921,0.00004879811,0.00002071212,0.0004785995,0.0003386872,0.005591355,0.001109055,0.9429004,0.04894639,0.00002018455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1979045,0.007245213,0.4029893,0.003017526,0.0007119753,0.0002322236,0.00219349,0.0009846768,0.384721],"genre_scores_gemma":[0.8378149,0.002743958,0.05364829,0.0006750025,0.0003366051,0.0002225711,0.001642816,0.0002326416,0.1026832],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01186655,"threshold_uncertainty_score":0.03969753,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W67537369","doi":"","title":"Semisymmetric Cubic Graphs Constructed from Bi-Cayley Graphs of An.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":32,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Cayley graph; Mathematics; Bipartite graph; Vertex-transitive graph; Combinatorics; Cubic graph; Vertex (graph theory); Symmetric graph; Graph; Foster graph; Discrete mathematics; Odd graph; Line graph; Voltage graph; 1-planar graph","authors":[{"name":"Zaiping Lu","is_ca":false},{"name":"Changqun Wang","is_ca":false},{"name":"Mingyao Xu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0255175707646788,"gpt":0.2851068964393023,"spread":0.2595893256746235,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001695948,0.0001892475,0.0001606178,0.0005322265,0.0007772782,0.000509525,0.0003888966,0.0002350887,0.002977206],"category_scores_gemma":[0.0008768899,0.0001535715,0.0002641253,0.0004939504,0.0006072918,0.0007095477,0.0006319839,0.0005437505,0.0001867512],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007343331,"about_ca_system_score_gemma":0.0005143302,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002352742,"about_ca_topic_score_gemma":0.006836172,"domain_scores_codex":[0.9998426,0.00003130055,0.000009307445,0.00003296153,0.00005046801,0.00003340192],"domain_scores_gemma":[0.9990897,0.0002611064,0.0002116461,0.0001614941,0.0001425267,0.0001335314],"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.0001876543,0.00005527532,0.002737546,0.0001661022,0.00002408728,0.0007588208,0.0006496806,0.009821281,0.02498944,0.9328874,0.003169284,0.02455351],"study_design_scores_gemma":[0.00005999447,0.00008428958,0.0050641,0.00004220555,0.00003791946,0.001351979,0.0006722716,0.08295523,0.0127457,0.8784279,0.0185245,0.00003389814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8997984,0.0001672834,0.05732026,0.0002439271,0.00004695847,0.00006698476,0.0006304175,0.0001864587,0.04153942],"genre_scores_gemma":[0.9756339,0.00009096212,0.01920759,0.00007786571,0.00001468715,0.00004242802,0.0005891336,0.00002379992,0.004319829],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002977206,"threshold_uncertainty_score":0.009959698,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2405045104","doi":"","title":"On Metric Dimension of Generalized Petersen Graphs P(n, 3).","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Metric dimension; Mathematics; Combinatorics; Dimension (graph theory); Metric (unit); Constant (computer programming); Discrete mathematics; Graph; Chordal graph; 1-planar graph","authors":[{"name":"Muhammad Imran","is_ca":false},{"name":"Abdul Qudair Baig","is_ca":false},{"name":"Muhammad Kashif Shafiq","is_ca":false},{"name":"Ioan Tomescu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01014705084220965,"gpt":0.2227669476679483,"spread":0.2126198968257387,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004862686,0.0004252696,0.0003718121,0.001543684,0.001337853,0.001264621,0.0005476001,0.0007879437,0.002197141],"category_scores_gemma":[0.002158621,0.0002622831,0.0003124886,0.001208829,0.001971851,0.002571302,0.00128051,0.0009411568,0.0002005902],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009559738,"about_ca_system_score_gemma":0.0002867677,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007644264,"about_ca_topic_score_gemma":0.000691853,"domain_scores_codex":[0.9995708,0.0001201848,0.00001504809,0.0001065369,0.00009035002,0.00009717911],"domain_scores_gemma":[0.9983853,0.0008245354,0.0003460438,0.0001349044,0.0000994933,0.0002096597],"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.0001233807,0.00004208835,0.004401574,0.0001063164,0.00002938422,0.0002043575,0.0005836199,0.008220056,0.00379202,0.9660351,0.002199824,0.01426239],"study_design_scores_gemma":[0.00002156349,0.00006865148,0.004162083,0.00003009711,0.00002400304,0.0005941464,0.0003715767,0.02595559,0.002550886,0.9581478,0.008037137,0.00003641938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9234059,0.001303112,0.04293064,0.001381514,0.0001063773,0.00002871937,0.0003119627,0.00007042596,0.03046134],"genre_scores_gemma":[0.9879416,0.0005465479,0.009035693,0.0001625114,0.0001002579,0.00002312465,0.0002046841,0.00001730576,0.001968347],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002197141,"threshold_uncertainty_score":0.007350206,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W171110949","doi":"","title":"The total number of generalized stable sets and kernels of graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","authors":[{"name":"Maria Kwaśnik","is_ca":false},{"name":"Iwona Włoch","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0120708156354744,"gpt":0.2810397959182403,"spread":0.2689689802827659,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001124787,0.0004792132,0.0008637065,0.003435465,0.001546672,0.004300762,0.001901521,0.001163638,0.008759669],"category_scores_gemma":[0.007442865,0.0005066975,0.0007817523,0.001904093,0.003143188,0.008065824,0.001799963,0.001082448,0.000791154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001127375,"about_ca_system_score_gemma":0.0004843825,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004906803,"about_ca_topic_score_gemma":0.0006193341,"domain_scores_codex":[0.9988702,0.0002390832,0.00007583698,0.0002739289,0.0003308789,0.0002100216],"domain_scores_gemma":[0.994514,0.002756738,0.0006726343,0.0007469147,0.0005918388,0.0007178937],"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.0001479159,0.00003894408,0.00347239,0.0001461655,0.00005926257,0.0001002056,0.0002873108,0.002986386,0.003552055,0.9703129,0.002642411,0.01625415],"study_design_scores_gemma":[0.0000217999,0.00002921272,0.002437531,0.00003109156,0.00004929255,0.0005058896,0.0002637063,0.01662227,0.002364816,0.9744962,0.003157236,0.00002097526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8587462,0.001080429,0.09036533,0.001300303,0.0001581394,0.00007220051,0.001486127,0.0003893994,0.04640187],"genre_scores_gemma":[0.9850326,0.0004911939,0.007759345,0.00007277553,0.0001260601,0.00006854066,0.0004583662,0.00007139162,0.005919691],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008759669,"threshold_uncertainty_score":0.02930403,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2401313454","doi":"","title":"On Some Metric Properties of the Sierpinski Graphs S(n, k).","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Sierpinski triangle; Metric (unit); Combinatorics; Discrete mathematics; Mathematical analysis; Fractal; Business; Marketing","authors":[{"name":"Daniele Parisse","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01289290419295852,"gpt":0.2076399068931017,"spread":0.1947470027001432,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001014831,0.0006519812,0.0007421704,0.002817965,0.001763154,0.00311193,0.001227019,0.001267333,0.00650556],"category_scores_gemma":[0.006972622,0.0004459604,0.0006067002,0.002772936,0.002558087,0.005416499,0.001911299,0.00194503,0.0008396739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001564601,"about_ca_system_score_gemma":0.0005923637,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001432276,"about_ca_topic_score_gemma":0.001936476,"domain_scores_codex":[0.9991189,0.0003214423,0.00005508383,0.000147636,0.0002014871,0.0001554455],"domain_scores_gemma":[0.9949882,0.002740377,0.0008541013,0.0003592818,0.0003756428,0.0006823749],"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.00006023248,0.00003338328,0.001050851,0.00009095128,0.00001508438,0.00007918618,0.000188727,0.003227765,0.001007494,0.97943,0.004615394,0.01020092],"study_design_scores_gemma":[0.00001759482,0.00003897355,0.001903333,0.00003829829,0.000017378,0.0002757056,0.0002404123,0.01382697,0.000628553,0.976683,0.006297347,0.00003248409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6560091,0.005472433,0.1485402,0.005573258,0.0004191606,0.0001314334,0.002399796,0.0004476194,0.1810071],"genre_scores_gemma":[0.9604867,0.001852331,0.02568839,0.0005525115,0.0003619574,0.0001434245,0.001082387,0.0001276741,0.00970471],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00650556,"threshold_uncertainty_score":0.02176321,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W49590405","doi":"","title":"Metric-Locating-Dominating Sets in Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Dominating set; Metric (unit); Combinatorics; Graph; Business","authors":[{"name":"Michael A. Henning","is_ca":false},{"name":"Ortrud R. Oellermann","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0120076420325398,"gpt":0.2406084657575433,"spread":0.2286008237250035,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001966911,0.00083638,0.001406831,0.001820767,0.002043809,0.004133786,0.002186592,0.002145114,0.006902426],"category_scores_gemma":[0.01275491,0.0007761318,0.0007935876,0.00326418,0.002415464,0.007910434,0.003156873,0.002609465,0.001432537],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002926011,"about_ca_system_score_gemma":0.001154363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001149998,"about_ca_topic_score_gemma":0.001767782,"domain_scores_codex":[0.9978101,0.0008015006,0.0001495991,0.0005178399,0.0004110339,0.0003098956],"domain_scores_gemma":[0.9909196,0.005795097,0.0008027772,0.001181278,0.0005653697,0.0007358675],"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.0002173927,0.0001142085,0.001770891,0.0005416741,0.00007395949,0.0001167982,0.0003902432,0.01767663,0.00220263,0.8987896,0.02376162,0.05434428],"study_design_scores_gemma":[0.00003965344,0.00005404911,0.000645395,0.00006539231,0.00004601477,0.0004262797,0.00035812,0.02514388,0.001844928,0.956732,0.01461871,0.00002546679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2514412,0.009338003,0.6042835,0.01305496,0.0009400683,0.0003551019,0.004443184,0.001338292,0.1148057],"genre_scores_gemma":[0.8123201,0.00363433,0.1550096,0.001272923,0.0005549342,0.0002910469,0.002689378,0.0003168932,0.02391076],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006902426,"threshold_uncertainty_score":0.0230909,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2397663352","doi":"","title":"On vertex irregular total labelings.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","authors":[{"name":"Ali Ahmad","is_ca":false},{"name":"Martin Bača","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007121993914556585,"gpt":0.2018209375120461,"spread":0.1946989435974895,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001305294,0.0007264657,0.0009066439,0.00230294,0.00226663,0.004053212,0.001561297,0.00135748,0.0139894],"category_scores_gemma":[0.007391845,0.0005860486,0.000891873,0.003656998,0.002751775,0.008103655,0.003166826,0.002833402,0.002260055],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002388568,"about_ca_system_score_gemma":0.0008221411,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0018924,"about_ca_topic_score_gemma":0.002976426,"domain_scores_codex":[0.9987429,0.0003794874,0.00007152643,0.000277364,0.0002898381,0.0002389709],"domain_scores_gemma":[0.9943385,0.003233368,0.0004769456,0.001086622,0.0004331922,0.0004313997],"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.00004986572,0.00002856113,0.000498839,0.00009604577,0.00001226941,0.00004000463,0.0001611098,0.00355548,0.0003494082,0.9649437,0.01074086,0.01952381],"study_design_scores_gemma":[0.00001117395,0.000008134162,0.0002224172,0.00002763597,0.000008771882,0.000089407,0.0001184193,0.008354736,0.0002474861,0.981709,0.009195094,0.000007608159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.2622179,0.003943065,0.4149177,0.007312366,0.0007572009,0.0001741514,0.004064115,0.001474175,0.3051395],"genre_scores_gemma":[0.7925254,0.003439805,0.1241192,0.001735576,0.0008412723,0.0003185109,0.005251287,0.000888148,0.07088072],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.0139894,"threshold_uncertainty_score":0.04679918,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2407498472","doi":"","title":"On The Generalized Fibonacci And Pell Sequences By Hessenberg Matrices.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Fibonacci number; Mathematics; Recurrence relation; Combinatorics; Pisano period; Lucas sequence; Lucas number; Sequence (biology); Fibonacci polynomials; Prime (order theory); Discrete mathematics; Arithmetic; Orthogonal polynomials","authors":[{"name":"Emrah Kılıç","is_ca":false},{"name":"Dursun Taşçı","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006300082100492631,"gpt":0.2459441925894685,"spread":0.2396441104889759,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005022149,0.0006448682,0.0003177974,0.001299269,0.0006969181,0.001418613,0.0004330072,0.0006435369,0.01111671],"category_scores_gemma":[0.002751547,0.0002271594,0.0003837206,0.00139159,0.001991989,0.003208932,0.0009018252,0.000987967,0.001859003],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00074197,"about_ca_system_score_gemma":0.0005761434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009056351,"about_ca_topic_score_gemma":0.001018661,"domain_scores_codex":[0.9996934,0.00007982937,0.00001601189,0.00005792659,0.00009187954,0.00006104035],"domain_scores_gemma":[0.9994071,0.0002759224,0.0001118384,0.0000539228,0.000095239,0.00005605624],"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.000005344982,0.000002971397,0.00005738128,0.00002376256,0.000001361765,0.00003218807,0.00006099229,0.001442707,0.0002860046,0.9883822,0.001009058,0.008696062],"study_design_scores_gemma":[0.000003479431,0.00001739394,0.0001482356,0.00001345782,0.000002191265,0.0001349644,0.00004145206,0.005942433,0.0004680874,0.9789743,0.01424335,0.00001066284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1488221,0.01447005,0.5634537,0.002711745,0.0022305,0.0001551516,0.0007227422,0.0003940024,0.2670399],"genre_scores_gemma":[0.7646194,0.01299758,0.09917317,0.0009688492,0.002137359,0.0002117929,0.00063762,0.0001813839,0.1190729],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01111671,"threshold_uncertainty_score":0.03718913,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W46767655","doi":"","title":"Vertex-distinguishing total coloring of graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Complete coloring; Brooks' theorem; Fractional coloring; Graph; 1-planar graph; Chordal graph; Line graph","authors":[{"name":"Zhang Zhong-fu","is_ca":false},{"name":"Pengxiang Qiu","is_ca":false},{"name":"Baogen Xu","is_ca":false},{"name":"Jingwen Li","is_ca":false},{"name":"Chen Xiang-en","is_ca":false},{"name":"Bing Yao","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01794874767751408,"gpt":0.2187151149053473,"spread":0.2007663672278333,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001074707,0.0006226075,0.0006469103,0.001182706,0.001607939,0.002796264,0.001469412,0.001100258,0.007822355],"category_scores_gemma":[0.005118506,0.0005188262,0.0006564069,0.001801443,0.001913301,0.00442577,0.002217795,0.002201875,0.0009050533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002078557,"about_ca_system_score_gemma":0.001026024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001840423,"about_ca_topic_score_gemma":0.002907838,"domain_scores_codex":[0.9989495,0.0003269976,0.00005289213,0.000246031,0.0001924653,0.0002321758],"domain_scores_gemma":[0.9942826,0.003471873,0.0004110335,0.001024693,0.0003423749,0.000467323],"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.0001655242,0.00007799856,0.001778086,0.0001929599,0.00002791072,0.00006671175,0.0002555312,0.008570135,0.00219894,0.9405715,0.01612298,0.02997164],"study_design_scores_gemma":[0.00002937471,0.00002272384,0.0006586199,0.00002672339,0.00002267749,0.0001642888,0.0001572142,0.02205166,0.001613104,0.9671048,0.008135509,0.00001328674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4580607,0.002056567,0.3538412,0.005521644,0.0006007127,0.0001577906,0.003764724,0.001552503,0.1744441],"genre_scores_gemma":[0.901763,0.0007249442,0.06945182,0.0007198021,0.0002273284,0.00009571426,0.002474612,0.000297478,0.02424536],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007822355,"threshold_uncertainty_score":0.02616841,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W180089728","doi":"","title":"Restricted edge-connectivity and minimum edge-degree.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Enhanced Data Rates for GSM Evolution; Degree (music); Mathematics; Computer science; Telecommunications; Physics","authors":[{"name":"Nicola Ueffing","is_ca":false},{"name":"Lutz Volkmann","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02030007296313182,"gpt":0.2329187095659705,"spread":0.2126186366028386,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004609674,0.0004485244,0.0005989387,0.0008811161,0.0005763892,0.001327151,0.001254599,0.0008789528,0.009672966],"category_scores_gemma":[0.00541561,0.0002779355,0.0002965044,0.001144792,0.001140786,0.003625141,0.001058498,0.001245383,0.001400608],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004082034,"about_ca_system_score_gemma":0.0002479465,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004289447,"about_ca_topic_score_gemma":0.0006841492,"domain_scores_codex":[0.9994518,0.0001545467,0.00003093736,0.0001468573,0.0001111053,0.0001046905],"domain_scores_gemma":[0.9970033,0.001719588,0.0003971565,0.0003584567,0.000285761,0.0002358132],"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.0002143107,0.00006551453,0.001448761,0.0003743078,0.00004610226,0.0003628806,0.000154082,0.0151016,0.004862399,0.9157573,0.01294652,0.04866622],"study_design_scores_gemma":[0.00002970084,0.00003578904,0.001010042,0.00004805655,0.00002661648,0.00073652,0.00009380811,0.02081013,0.001483243,0.9640252,0.01168628,0.00001459636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3561446,0.007888191,0.4166885,0.004239904,0.000509211,0.0001141015,0.002406914,0.0007811578,0.2112274],"genre_scores_gemma":[0.9500092,0.003095189,0.02983091,0.000342399,0.0002858028,0.0001135342,0.001087512,0.0001246879,0.01511064],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009672966,"threshold_uncertainty_score":0.0323593,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2405098219","doi":"","title":"A Convolution Formula For Bernoulli Polynomials.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":24,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Bernoulli's principle; Convolution (computer science); Bernoulli polynomials; Pure mathematics; Orthogonal polynomials; Difference polynomials; Artificial intelligence; Computer science; Physics","authors":[{"name":"Yuan He","is_ca":false},{"name":"Wenpeng Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03461364176142281,"gpt":0.3070050632982418,"spread":0.2723914215368191,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001140031,0.0005480641,0.000605494,0.001584282,0.001358746,0.002206024,0.0008036554,0.001067484,0.008230133],"category_scores_gemma":[0.005105279,0.0003566609,0.0007033743,0.001493331,0.001861139,0.004480542,0.002053709,0.002887444,0.002481474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001153228,"about_ca_system_score_gemma":0.0008322845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001194273,"about_ca_topic_score_gemma":0.001161153,"domain_scores_codex":[0.9993161,0.000156273,0.00002969748,0.00008809433,0.0003155387,0.00009432845],"domain_scores_gemma":[0.9987504,0.0004815443,0.0001078377,0.0001537083,0.0003239406,0.0001825091],"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.000009135647,0.000007643564,0.0001163347,0.00001929063,0.00000270041,0.00004761672,0.00006537585,0.0002557618,0.0004416404,0.990388,0.002369606,0.006276893],"study_design_scores_gemma":[0.000005085014,0.00001079792,0.0002209886,0.00002254453,0.000006978584,0.0002516674,0.00002881829,0.007545844,0.0004280984,0.982613,0.008855444,0.00001085951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.100474,0.008855851,0.5435932,0.004859599,0.003019294,0.00004692585,0.0005168709,0.0004713376,0.338163],"genre_scores_gemma":[0.8390681,0.0040732,0.08246879,0.001452292,0.002007039,0.00008112346,0.0003722807,0.0003054038,0.07017181],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008230133,"threshold_uncertainty_score":0.02753252,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W181220164","doi":"","title":"On the partition dimension and connected partition dimension of wheels","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Partition (number theory); Dimension (graph theory); Combinatorics","authors":[{"name":"Ioan Tomescu","is_ca":false},{"name":"Imran Javaid","is_ca":false},{"name":"Slamin Slamin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01299084395861121,"gpt":0.2261670760803161,"spread":0.2131762321217049,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002261009,0.001114708,0.002128259,0.004038164,0.004173262,0.007207201,0.003591094,0.003363749,0.011018],"category_scores_gemma":[0.01217432,0.001759538,0.001381864,0.004502766,0.007724821,0.01592943,0.005024975,0.004900218,0.0006978385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0033299,"about_ca_system_score_gemma":0.00106679,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00358696,"about_ca_topic_score_gemma":0.003389692,"domain_scores_codex":[0.9982896,0.0006125531,0.0000703021,0.0003319761,0.0002996355,0.000395777],"domain_scores_gemma":[0.9861342,0.009582623,0.001092476,0.001053877,0.0005960918,0.001540733],"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.00008674494,0.00003122821,0.0008033383,0.00007402472,0.00001653417,0.00002661143,0.00030179,0.006312665,0.0003292261,0.9850531,0.002350059,0.004614623],"study_design_scores_gemma":[0.00002314719,0.00001011448,0.0005723449,0.00003308394,0.000018311,0.00003996905,0.0001817304,0.01633194,0.0002157924,0.9807968,0.001754777,0.00002191034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7620004,0.004854739,0.1515767,0.007299198,0.0004181895,0.00008488794,0.0012251,0.0003395232,0.07220123],"genre_scores_gemma":[0.9649568,0.001536446,0.0211765,0.0005816392,0.0005219796,0.0001247138,0.0006545246,0.0001729801,0.01027442],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.011018,"threshold_uncertainty_score":0.03685892,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2394717430","doi":"","title":"Total edge irregularity strength of a categorical product of two paths.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Categorical variable; Enhanced Data Rates for GSM Evolution; Product (mathematics); Statistics; Geometry; Artificial intelligence; Computer science","authors":[{"name":"Ali Ahmad","is_ca":false},{"name":"Martin Bača","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01053064458863691,"gpt":0.229390639719757,"spread":0.2188599951311201,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001645564,0.0004146822,0.0008667045,0.002387838,0.002453584,0.003907023,0.001430388,0.001306695,0.0107264],"category_scores_gemma":[0.007314682,0.0006502219,0.0008077564,0.00168,0.003030914,0.006423234,0.002958858,0.002368496,0.0009239765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001267138,"about_ca_system_score_gemma":0.0005245441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000910363,"about_ca_topic_score_gemma":0.0009518254,"domain_scores_codex":[0.9983501,0.0004453952,0.0001033834,0.0004176323,0.0003886645,0.0002947397],"domain_scores_gemma":[0.9910233,0.004467828,0.001114965,0.001177816,0.0009504282,0.001265665],"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.0001300668,0.00003930528,0.001574242,0.0000618656,0.00001874941,0.0001364458,0.0002575812,0.001455619,0.001714165,0.9868859,0.001415218,0.006310818],"study_design_scores_gemma":[0.00002395106,0.00003606896,0.0009429102,0.00002786109,0.00003709755,0.0003212983,0.0002955023,0.009513026,0.001726308,0.9830478,0.004000681,0.0000273548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8054592,0.0004145588,0.1118206,0.001488749,0.000225504,0.00005697273,0.0006709208,0.0004109406,0.07945236],"genre_scores_gemma":[0.9767833,0.0001310935,0.01484691,0.0001817302,0.00009719928,0.00004050142,0.000331845,0.0001165863,0.007470781],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0107264,"threshold_uncertainty_score":0.03588337,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W125103475","doi":"","title":"On the detour number and geodetic number of a graph","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Geodetic datum; Mathematics; Graph; Combinatorics; Geodesy; Geography","authors":[{"name":"Gary Chartrand","is_ca":false},{"name":"Garry L. Johns","is_ca":false},{"name":"Ping Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009437448856650828,"gpt":0.2281541060738885,"spread":0.2187166572172377,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001511698,0.001024831,0.001331262,0.003780239,0.003026615,0.0041369,0.002418868,0.002350729,0.008577238],"category_scores_gemma":[0.008895075,0.0007617224,0.0007144926,0.003700897,0.005195613,0.008667857,0.002664969,0.003200984,0.0008735504],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002482621,"about_ca_system_score_gemma":0.0008151694,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002473355,"about_ca_topic_score_gemma":0.002898476,"domain_scores_codex":[0.9989396,0.0003934932,0.00004784597,0.0002215994,0.0001910534,0.0002064667],"domain_scores_gemma":[0.9873284,0.008950451,0.00123459,0.0008011992,0.0004757957,0.001209704],"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.0002205211,0.00005852118,0.002239688,0.0001155632,0.00002263203,0.00009177333,0.0003878317,0.01249349,0.00144249,0.9660234,0.004581419,0.01232275],"study_design_scores_gemma":[0.00003600995,0.00002819007,0.001112018,0.00003351835,0.00002214357,0.000150914,0.0002694307,0.0236719,0.0008086059,0.9693413,0.004495585,0.00003044947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7835736,0.00206806,0.1067119,0.008296804,0.0003967895,0.00006047484,0.001283642,0.0003266291,0.09728213],"genre_scores_gemma":[0.9606462,0.00141082,0.01942941,0.0004664327,0.0004743279,0.00008952642,0.0007225492,0.0001480688,0.01661273],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008577238,"threshold_uncertainty_score":0.02869368,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W140290324","doi":"","title":"Generalized Steiner Triple Systems with Group Size g = 7, 8.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Steiner system; Group (periodic table); Steiner tree problem; Combinatorics; Pure mathematics; Physics","authors":[{"name":"Dianhua Wu","is_ca":false},{"name":"Gennian Ge","is_ca":false},{"name":"Lie Zhu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004838672456518819,"gpt":0.1755905566206712,"spread":0.1707518841641524,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002966611,0.0004336255,0.0005857571,0.001082786,0.001483101,0.001553784,0.0007024488,0.001148409,0.01309828],"category_scores_gemma":[0.001195815,0.0002994119,0.0004476251,0.001188733,0.0009447271,0.001710287,0.001605668,0.0009544666,0.001750996],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007798107,"about_ca_system_score_gemma":0.0007059796,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007705857,"about_ca_topic_score_gemma":0.001392714,"domain_scores_codex":[0.9994916,0.0001388854,0.00003074887,0.00009017707,0.0001187657,0.0001298532],"domain_scores_gemma":[0.9991446,0.0002332624,0.0001680475,0.0001670903,0.0001323477,0.0001546595],"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.0004033062,0.00007760441,0.001129361,0.0002092426,0.00007195623,0.001360825,0.0004948173,0.01368736,0.01167817,0.9328024,0.01109491,0.0269901],"study_design_scores_gemma":[0.0001881394,0.0001914345,0.001211141,0.00008103705,0.00005859205,0.001088126,0.000909217,0.04429187,0.00841421,0.9233099,0.02019296,0.0000635276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7344223,0.0009614459,0.1256382,0.001679498,0.0005362913,0.0002343984,0.001792574,0.0008249105,0.1339104],"genre_scores_gemma":[0.9593223,0.0003186225,0.02567097,0.0002430751,0.00007665791,0.0001159384,0.0008162687,0.00006185615,0.01337443],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01309828,"threshold_uncertainty_score":0.04381806,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2399769410","doi":"","title":"On Some Rational Difference Equations.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Applied mathematics","authors":[{"name":"Bratislav Iričanin","is_ca":false},{"name":"Stevo Stević","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02277129587057327,"gpt":0.292089862847564,"spread":0.2693185669769907,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008765348,0.0006311748,0.0007083741,0.001374625,0.001251582,0.001869015,0.0008573205,0.0009509909,0.01823477],"category_scores_gemma":[0.003444591,0.0003572301,0.0007309017,0.001311359,0.002483546,0.00478472,0.002146037,0.003969726,0.002432256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001863453,"about_ca_system_score_gemma":0.000573521,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001377235,"about_ca_topic_score_gemma":0.001808103,"domain_scores_codex":[0.9994137,0.000156745,0.00002771626,0.00009553147,0.0001956788,0.0001105688],"domain_scores_gemma":[0.9989637,0.0005987323,0.00006963661,0.00009051845,0.0001870877,0.0000902533],"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.00001301289,0.000009640522,0.00009563871,0.00001812255,0.000003082763,0.00003369834,0.00009913888,0.0002134433,0.0001600557,0.9932514,0.00195558,0.004147118],"study_design_scores_gemma":[0.00001508351,0.000005938583,0.0001113213,0.00001197003,0.000003583219,0.00006134031,0.00004082881,0.001460863,0.0001583258,0.9927088,0.005417008,0.000005004271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1561412,0.005110797,0.1827191,0.01165697,0.002098111,0.00008610701,0.0009833125,0.0003348086,0.6408696],"genre_scores_gemma":[0.8304952,0.002799223,0.04679294,0.002204071,0.001289063,0.0001201126,0.0007945477,0.0002836502,0.1152213],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01823477,"threshold_uncertainty_score":0.06100136,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2407807588","doi":"","title":"Essential Norms Of Weighted Composition Operators From The Bergman Space To Weighted-Type Spaces On The Unit Ball.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Holomorphic and Operator Theory","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Unit sphere; Bergman space; Ball (mathematics); Composition (language); Type (biology); Space (punctuation); Pure mathematics; Arithmetic; Mathematical analysis; Computer science; Linguistics; Geology","authors":[{"name":"Stevo Stević","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.018605445227476,"gpt":0.2670452597752822,"spread":0.2484398145478061,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001332163,0.0007277227,0.0004656998,0.001906656,0.001035845,0.002263116,0.0009717317,0.0007186346,0.005235538],"category_scores_gemma":[0.004041072,0.0003362717,0.0006142773,0.000797909,0.002228539,0.005348981,0.00271016,0.002020369,0.00075742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008356515,"about_ca_system_score_gemma":0.0006129105,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000590698,"about_ca_topic_score_gemma":0.000727403,"domain_scores_codex":[0.9990846,0.000244023,0.00005865019,0.0001169702,0.0003723192,0.0001234487],"domain_scores_gemma":[0.9979996,0.0004776648,0.0002822472,0.0001392989,0.000546918,0.0005543127],"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.0000151454,0.000008124043,0.00007105734,0.00001520367,0.000003609006,0.00002596993,0.00007810594,0.0001864925,0.0006915135,0.9960517,0.0004104697,0.002442664],"study_design_scores_gemma":[0.000008977615,0.00001890047,0.0002059559,0.0000108066,0.000005547207,0.0001197653,0.0001006271,0.004138896,0.0007107723,0.9919653,0.002705568,0.000008855473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3862947,0.002534689,0.4584287,0.001759059,0.001049957,0.00008913267,0.0004700534,0.0002610401,0.1491128],"genre_scores_gemma":[0.894775,0.001651076,0.05476009,0.0004384384,0.0007233993,0.0001524642,0.0004464587,0.0002417077,0.04681135],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005235538,"threshold_uncertainty_score":0.01751459,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2399806649","doi":"","title":"Minimum Metric Dimension of Silicate Networks.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Dimension (graph theory); Metric (unit); Combinatorics","authors":[{"name":"Paul Manuel","is_ca":false},{"name":"Indra Rajasingh","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02149264337678972,"gpt":0.222831616258776,"spread":0.2013389728819862,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004083817,0.0004205348,0.0005615157,0.001405811,0.0009178997,0.002112783,0.0006597325,0.0008432255,0.005645369],"category_scores_gemma":[0.003268193,0.00031496,0.0002990992,0.0008502161,0.001037987,0.002426333,0.001528551,0.000868484,0.0008260463],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008368145,"about_ca_system_score_gemma":0.0004286886,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004035321,"about_ca_topic_score_gemma":0.0008000497,"domain_scores_codex":[0.999492,0.000150474,0.00002697829,0.00007674794,0.0001616274,0.00009213012],"domain_scores_gemma":[0.998593,0.0006027399,0.0002292159,0.0001303626,0.0001867677,0.0002577517],"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.0001749034,0.00002483443,0.001028699,0.0001811017,0.00004023736,0.00007973132,0.0001429442,0.01062978,0.004761865,0.9548618,0.008866174,0.01920798],"study_design_scores_gemma":[0.00002533088,0.00003929742,0.001056443,0.00003997265,0.00001703164,0.0003087488,0.0001107894,0.03084112,0.002511622,0.9542508,0.01078015,0.00001877866],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.69508,0.0033981,0.1501006,0.002830379,0.0003736046,0.00006940716,0.00265401,0.0003573369,0.1451366],"genre_scores_gemma":[0.9625936,0.001187799,0.02326954,0.0002127965,0.0001804252,0.0000893223,0.0009177201,0.00009016626,0.01145875],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005645369,"threshold_uncertainty_score":0.01888561,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2406639167","doi":"","title":"Vulnerability Of Mycielski Graphs Via Residual Closeness.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Closeness; Mathematics; Residual; Statistics; Combinatorics; Algorithm","authors":[{"name":"Tufan Turacı","is_ca":false},{"name":"Mukaddes Ökten","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03400394482779249,"gpt":0.3046801913416691,"spread":0.2706762465138766,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008293533,0.0003878978,0.0006380666,0.00210288,0.001566151,0.002667307,0.0009302021,0.001214503,0.00780443],"category_scores_gemma":[0.01037482,0.0004715374,0.0006142532,0.001232042,0.002654321,0.005568655,0.003391167,0.002196254,0.0007788523],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001100669,"about_ca_system_score_gemma":0.0004220807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001036042,"about_ca_topic_score_gemma":0.0007993813,"domain_scores_codex":[0.9989343,0.000314449,0.00004440088,0.0002438544,0.0002682201,0.000194722],"domain_scores_gemma":[0.9924306,0.004410684,0.001238053,0.0007930759,0.0005187591,0.0006088047],"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.0001637152,0.00003834905,0.003262138,0.0001090202,0.00003468948,0.0002438701,0.0007153526,0.007361328,0.002254739,0.9737438,0.002879783,0.009193328],"study_design_scores_gemma":[0.00002373972,0.00002902043,0.001398269,0.00003598188,0.00003577426,0.0004076949,0.0003643805,0.01607117,0.001218744,0.9767302,0.003663192,0.0000219913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7907247,0.0008923598,0.1196517,0.0032414,0.0001228947,0.00008870377,0.001033998,0.0004922682,0.0837519],"genre_scores_gemma":[0.9892206,0.0002785012,0.004933185,0.0001842479,0.0000616959,0.00003406622,0.0002860445,0.00006712449,0.004934707],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00780443,"threshold_uncertainty_score":0.02610838,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2402033281","doi":"","title":"On the Wiener index of unicyclic graphs with given girth.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Girth (graph theory); Wiener index; Index (typography); Combinatorics; Discrete mathematics; Graph; Computer science; World Wide Web","authors":[{"name":"Guihai Yu","is_ca":false},{"name":"Lihua Feng","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0144896464537898,"gpt":0.2546082013446283,"spread":0.2401185548908385,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000807766,0.0005283169,0.0009478746,0.003967072,0.001008278,0.002098382,0.001080842,0.0008493739,0.005039976],"category_scores_gemma":[0.006641257,0.0003617859,0.0003613891,0.002211367,0.002160646,0.004116409,0.002225092,0.001381531,0.00107082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001058666,"about_ca_system_score_gemma":0.0003161188,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005162403,"about_ca_topic_score_gemma":0.000749209,"domain_scores_codex":[0.9995092,0.0001216816,0.00002567275,0.00007853777,0.0001446414,0.0001203435],"domain_scores_gemma":[0.9971632,0.001484657,0.0004778645,0.00022642,0.0002263229,0.0004214817],"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.0001298141,0.00002688579,0.001223324,0.00007892772,0.00001869887,0.0001092085,0.0003349884,0.005225981,0.002767758,0.9740663,0.002637277,0.01338082],"study_design_scores_gemma":[0.00001374621,0.0000279953,0.001014516,0.00004599237,0.00001459277,0.0001844755,0.0001462943,0.01728781,0.001200397,0.9773912,0.002649719,0.00002334954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8054351,0.003574195,0.08783551,0.001404603,0.0004760503,0.00003580359,0.0005438861,0.0002782727,0.1004166],"genre_scores_gemma":[0.980526,0.001572837,0.00783116,0.0001479844,0.000322342,0.00004468773,0.0002384734,0.000128303,0.009188198],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005039976,"threshold_uncertainty_score":0.01686043,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2402513589","doi":"","title":"Decompositions of complete graphs into paths and cycles","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic","authors":[{"name":"Tay Woei Shyu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005252879354272561,"gpt":0.2022782413432858,"spread":0.1970253619890132,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005592414,0.000806879,0.0005920629,0.002394933,0.001108354,0.00286442,0.0008584846,0.0006898295,0.009429527],"category_scores_gemma":[0.00238708,0.0007804188,0.001062316,0.001950438,0.001375457,0.003654547,0.001281096,0.001376008,0.0009928979],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001005941,"about_ca_system_score_gemma":0.0007189791,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001539372,"about_ca_topic_score_gemma":0.002493131,"domain_scores_codex":[0.9993981,0.0001554026,0.00004037328,0.0001538087,0.0001487976,0.000103536],"domain_scores_gemma":[0.9980506,0.0007974613,0.0002927799,0.0003693377,0.0002775349,0.0002122747],"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.00004977616,0.00003323795,0.0003582455,0.00008566611,0.00002203023,0.0001040228,0.0003081961,0.008332717,0.001612035,0.965495,0.002556409,0.02104266],"study_design_scores_gemma":[0.00001169567,0.00001080482,0.0002938026,0.00003465982,0.00001896675,0.0001025562,0.0001209779,0.01648939,0.0006359657,0.975374,0.006897854,0.0000092715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1999513,0.0009151319,0.7099171,0.0007252875,0.000109108,0.0002344209,0.001439626,0.0005849347,0.08612308],"genre_scores_gemma":[0.6579076,0.001670003,0.2815185,0.0004579815,0.000191126,0.0004409215,0.002849099,0.0005271882,0.05443754],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009429527,"threshold_uncertainty_score":0.03154486,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}